Q. 205.0( 2 Votes )
Using the princip
Answer :
To Prove:
Let us prove this question by principle of mathematical induction (PMI) for all natural numbers
Let P(n):
For n = 1 P(n) is true since
which is divisible of 9
Assume P(k) is true for some positive integer k , ie,
=
, where m ∈ N …(1)
We will now prove that P(k + 1) is true whenever P( k ) is true.
Consider ,
[ Adding and subtracting
]
[ Using 1 ]
, where r =
is a natural number
Therefore
Therefore, P (k + 1) is true whenever P(k) is true
By the principle of mathematical induction, P(n) is true for all natural numbers, ie, N.
Hence proved.
Rate this question :


Prove that cos α
RD Sharma - MathematicsProve that sin x
RD Sharma - MathematicsProve the followi
RD Sharma - MathematicsProve the followi
RD Sharma - MathematicsProve the followi
RD Sharma - MathematicsProve the followi
RD Sharma - MathematicsProve the followi
RD Sharma - MathematicsProve the followi
RD Sharma - MathematicsProve the followi
RD Sharma - MathematicsProve that <span
RD Sharma - Mathematics