Q1. If a statement is to be proved by mathematical induction, then the different steps necessary to prove it are
Q2. Every even power of an odd number greater than 1 when divided by 8 leaves 1 as the remainder.The inductive step for the above statement is
Q3. 2.42n + 1 + 33n + 1 for all n is divisible by
Q4. If P(k) is the statement 23k - 1 is divisible by 7, then P(k + 1) is
Q5. The sum of cubes of three consecutive natural numbers is divisible by:
Q6. If P(n) : n3 + n is divisible by 3, then which of the following is true
Q7. The greatest natural number, which divides (n + 1) (n +2) (n + 3)(n + 4) is
Q8. _______ reasoning depends on working with each case, and developing a conjecture by observing incidence till each and every case is observed.
Q9. P(n): n2+n+1 is prime for n=1,2.......40. The least number for which the result does not hold is
Q10. The principle of mathematical induction is for the set of:
Therefore, (2k + 3)2n + 2 = 8A + 1 for some natural numbers A.
Comments
Post a Comment