Test: Principle Of Mathematical Induction- 1 - Commerce MCQ

Given, P(n) = P(n+1)∀n∈N
Substituting n−1 in place of n,
P(n−1) = P(n)
Thus if P(k) is true for some k ∈ N, then it is true for k−1 and k+1.
Thus, it is true ∀ k ∈ N

P(n) = (n+1)(n+2).........(n+r)
 
Now find p(1)
P(1) = r! (r+1)
 
Similarly
P(k) will be divisible by r!
P(k+1) is also divisible by r!
 
Hence p(n) will also be divisible by r!.

32n+2−8n−9=9n+1−9−8n32n+2−8n−9=9n+1−9−8n

=9(9n−1)−8n=9(9n−1)−8n

=9((8+1)n−1)−8n=9((8+1)n−1)−8n

=9∑k=1n(nk)8k−8n=9∑k=1n(nk)8k−8n

==9∑k=2n(nk)8k+64n9∑k=2n(nk)8k+64n

is a multiple of 64

Induction works in the following way: If you show that the result being true for any integer implies it is true for the next, then you need only show that it is true for n=1 for it to be true for n=2 and then n=3 and so on.

Step 1: Show true for n=1

For n=1, n^3+2n=(1)^3+2(1)

n^3+2n=3

3 is definitely divisible by 3 so the statement is true for n=1.

Step 2: Assume true for n=k

We assume that for any integer k, n^3+2n is divisible by 3. We can write this mathematically as:

k^3+2k=3m, where m is an integer

Step 3: Show true for k+1

For n=k+1,

n^3+2n=(k+1)^3+2(k+1)

=(k^3+3k^2+3k+1)+2k+2

=(k^3+2k)+3(k^2+k+1)

Subbing in from part 2 for (k^3+2k), we get:

n^3+2n=3m+3(k^2+k+1)

=3(m+k^2+k+1)

which is divisible by 3.

This means that the statement being true for n=k implies the statement is true for n=k+1, and as we have shown it to be true for n=1 the proof of the statement follows by induction.

Sol : Let P(n) = 10n + 3.4n+2 + 5 is divisible by 9.

Step 1 : for n =1  we have
P(1) ; 10 + 3x64 + 5 = 207 = 9x23
Which is divisible by 9 .
∴ P(1) is true .

Step 2 :For n =k assume that P(k) is true .
Then P(k) : 10k + 3.4k+2 + 5 is divisible by 9.
   10k + 3.4k+2 + 5  = 9m
10k = 9m - 3.4k+2 - 5  ----------(1)

Step 3 ;
We have to to prove that P(k+1) is divisible by 9 for n = k + 1.

P(k + 1) : 10k+1 + 3.4k+1+2 + 5
            = 10 x 10k + 3.4k+2 .4+ 5 
            = 10 ( 9m - 3.4k+2 - 5 ) + 3.4k+2 .4+ 5 
            = 90m - 30 4k+2 - 50 + 12.4k+2 + 5    
            = 90m - 18 4k+2 - 45
            = 9( 10m - 2.4k+2 - 5 )
which is divisible by 9 .
∴ P (k +1 ) is true .
Hence by the Principle of mathematical induction P(n) is true for all n∈N.