Home
Class 12
MATHS
If p is a fixed positive integer, prove ...

If p is a fixed positive integer, prove by induction that `p^(n +1) + (p + 1)^(2n - 1)` is divisible by `P^2+ p +1` for all `n in N`.

Text Solution

Verified by Experts

`P(n) : p^(n+1) + (p+1)^(2n-1)` is divisible by `p^(2) + p + 1`
For `n = 1, P(1) : p^(2) + p + 1`
So, `P(1)` is true.
Let `P(k)` be true.
Then `p^(k+1) + (p+1)^(2k-1)` is divisible by `p^(2) + p + 1`
`rArr p^(k+1) + (p+1)^(2k-1) = (p^(2) + p + 1) m "....."(1)`
Now, `p^(k+1) + (p + 1)^(2k+1)`
`= p xx p^(k+1) + (p + 1)^(2k-1) xx (p+1)^(2)`
`= p [m(p^(2) + p + 1 ) - (p + 1)^(2k-1)] + (p+1)^(2k-1)(p+1)^(2)`
`= p(p^(2) + p + 1) m - p (p+1)^(2k-1) + (p+1)^(2k-1)(p^(2) + 2p+1)`
`= p (p^(2) + p + 1) m + (p+1)^(2k-1)(p^(2) + p + 1)`
`= (p^(2) + p + 1 ) [mp+(p+1)^(2k-1)]`
`= (p^(2) + p + 1) xx ("an interger")`
Therefore, `P(k+1)` is also true whennever`P(k)` is true.
Hence, by principle of mathematical induction, `P(n)` is true `AA n in N`.
Promotional Banner

Topper's Solved these Questions

  • PRINCIPLE OF MATHEMATICAL INDUCTION

    CENGAGE|Exercise Exercise|9 Videos

  • PERMUTATION AND COMBINATION

    CENGAGE|Exercise Question Bank|4 Videos

  • PROBABILITY

    CENGAGE|Exercise Comprehension|2 Videos

Similar Questions

Explore conceptually related problems

Prove that if rlt=slt=n ,t h e n ' n P_s is divisible by n P_r .

Prove by mathematical induction that for every natural number n, 3^(2n+2)-8n-9 is divisible by 8 for all n ge 1.

Prove that by using the principle of mathematical induction for all n in N : 10^(2n-1)+1 is divisible by 11

If r lt s le n " then prove that " ^(n)P_(s) " is divisible by "^(n)P_(r).

Prove that n^(2)-n divisible by 2 for every positive integer n.

P=n(n^(2)-1)(n^(2)-4)(n^(2)-9)…(n^(2)-100) is always divisible by , (n in I)

It is tossed n times. Let P_n denote the probability that no two (or more) consecutive heads occur. Prove that P_1 = 1,P_2 = 1 - p^2 and P_n= (1 - P) P_(n-1) + p(1 - P) P_(n-2) for all n leq 3 .

Statement 1: If p is a prime number (p!=2), then [(2+sqrt(5))^p]-2^(p+1) is always divisible by p(w h e r e[dot] denotes the greatest integer function). Statement 2: if n prime, then ^n C_1,^n C_2,^n C_2 ,^n C_(n-1) must be divisible by ndot

If tan ((p pi)/4)=cot ((qpi)/4) , then prove that p+q=2(2n+1), n in Z .

If .^(n-1) P_(3) : P_(4) = 1 , 10 find n.