Q1.A student was asked to prove a statement P ( n ) by method of induction . He proved that P ( 3 ) is true and that P(n)⇒P(n+1) for all natural numbers n . On the basis of this the criteria applied on n for P ( n ) to be true
Answer : Option AExplaination / Solution:
Since by the principle of mathematical induction if p( n ) is true for n = 3 then that will be the minimum point to be considered for the process.Also that P ( n ) ⇒P(n+1)
Answer : Option AExplaination / Solution:
when n = 1 the value is 64. By induction process the consecutive replacement of n = 2,3,4....will be multiples of 64.
Answer : Option CExplaination / Solution:
Since when n = 1 , we get the inequality as 1>1, which is not true. also for n = 2 , we get 2>2, which is false. Hence the given statement is true for n>2
Answer : Option CExplaination / Solution: when n = 1 , 2>3, which is not true.When n = 2, 4>6, which is false as well. Also when n = 3 we get 8>9.When n = 4 , 16>12 Hence it is trure frm n = 4 .
Answer : Option BExplaination / Solution: When n = 1 we get 3<1, and when n = 2 we get 5<2,. when n = 3 9<6, which are inavlid inequations. Only when n = 4 we get 17<24, which is valid.
Answer : Option BExplaination / Solution:
When n = 1 we have a + b.And the subsequent substitution of n as 2,3,... will result in the expression whose factor is a + b.