when n = 1 the value is 8 which is the multiple pf 8.

When n = 1 we get 16>16, which is false. when n = 2 we get 25>32,which is false as well. As n = 3,4,5....the inequalty does not hold correct.

The smallest positive integer ‘ n ‘ for which holds is :

When n = 1 ,we get ,which is not valid. When n takes values 2,3,4,5 the inequality is invalid . But when n = 6 we have ,which is valid.

If is divisible by 9 for all n N , then the least positive integral value of k is :

When n = 1 we have 58. Given that the expression is divisible by 9 . Hence the least value of k will be 5,so that the value becomes 63 which is divisible by 9.

When n = 1 we get ,which is invalid. When n = 2 we get, which is valid.

Let is a prime number . then :

Since when n = 41 we have , which is not a prime number.

This criteria is from the basic principle of mathematical induction.

Since the statement is not true for n = 1 ,we cannot predict the validity for all natural numbers n.

Since the values of n as 1,2,3gives inavlid inequations but when n = 4 we have 16<24, which is valid.

If is divisible by x – k for all n belongs to natural numbers N , then the least positive integral value of k is :

since we have x - 1 as a factor of xn - 1n.