Skip to main content

4

Q1. If a statement is to be proved by mathematical induction, then the different steps necessary to prove it are

  • Basic step to be proved
  • Inductive step to be proved
  • Prove P(1), P(2), P(3)
  • Prove Basic step and Inductive step
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

  • P(1) = 32 = 8.1 + 1
  • P(k) = (2k - 1)2 = 8a + 1 implies P(k + 1); (2k + 1)2 = 8b + 1 for some natural  numbers a,b
  • P(k) = (2k + 1)2 = 8a + 1 implies P(k + 1):(2k + 3)2 = 8b + 1 for some natural numbers a,b
  • P(k) = (2k + 1)2n = 8a + 1 implies P(k + 1) : (2k + 3)2n + 2 = 8b + 1 for some natural number a,b
Q3. 2.42n + 1 + 33n + 1 for all n is divisible by

  • 2
  • 3
  • 4
  • 11
Q4. If P(k) is the statement 23k - 1 is divisible by 7, then P(k + 1) is

  • 23k+1 - 1 is divisible by 7
  • 23k - 2 is divisible by 7
  • 23k+2 - 1 is divisible by 7
  • 23k +3 - 1 is divisible by 7
Q5. The sum of cubes of three consecutive natural numbers is divisible by:

  • 2
  • 5
  • 7
  • 9
Q6. If P(n) : n3 + n is divisible by 3, then which of the following is true

  • P (1) is true
  • P (2) is true
  • P (3) is true
  • P (4) is true
Q7. The greatest natural number, which divides (n + 1) (n +2) (n + 3)(n + 4) is

  • 1
  • 4
  • 24
  • 6
Q8. _______ reasoning depends on working with each case, and developing a conjecture by observing incidence till each and every case is observed.

  • Inductive Reasoning
  • Deductive Reasoning
  • Mathematical Reasoning
  • Logical Reasoning
Q9. P(n): n2+n+1 is prime for n=1,2.......40. The least number for which the result does not hold is

  • 41
  • 42
  • 51
  • 47
Q10. The principle of mathematical induction is for the set of:

  • Whole number
  • Integers
  • Positive integers
  • Rational numbers

Comments