Home
Class 12
MATHS
Using mathematical induction prove that ...

Using mathematical induction prove that `n^(3)-7n+3 ` is divisible by `3, AA n in N`

Text Solution

Verified by Experts

Let `P(n):n! lt ((n+1)/(2))^n`
Step I For `n=2,2!lt ((2+1)/(2))^1rArr 2 lt (9)/(4)`
`rArr 2lt 2.25`, which is true.
Therefore , P(2)is true .
Step III For `n=k+1, we shall prove that `P(k+1):(k+1)!lt ((k+2)/(2))^(k+1)`
From assumption step `k!((k+1)^k)/(2^k)`
`rArr (k+1)k!lt ((k+1)^(k+1))/(2^k)`
`rArr (k+1)!lt ((k+1)^(k+1))/(2^k)` ......(i)
Let us assume , `((k+1)^(k+1))/(2^k)lt ((k+2)/(2))^(k+1)` .....(ii)
`rArr ((k+2)/(k+1))^(k+1)gt 2rArr (1+(1)/(k+1))^(k+1)gt 2`
`rArr 1+(k+1).(1)/((k+1))+.^(k+1)C_(2)((1)/(k+1))^2+....gt 2`
`rArr 1+1+.^(k+1)C_(2)((1)/(k+1))^2+.....gt 2`
Which is true , hence Eq. (ii) is true. From Eqs. (i) and (ii) , we get `(k+1)!lt ((k+1)^(k+1))/(2^k)` lt ((k+2)/(2))^(k+1)`
`rArr (k+1)!lt ((k+2)/(2))^(k+1)`
Therefore , `P(k+1)` is true. Hence , by the principle of mathematical induction P(n) is true for all `n in N`.
Promotional Banner

Similar Questions

Explore conceptually related problems

Prove that 3^(2n)+24n-1 is divisible by 32 .

Prove by mathematical induction that 10^(2n-1)+1 is divisible by 11

n^7-n is divisible by 42 .

Prove by induction that 41^n-14^n is divisible by 27

Prove that (n !) is divisible by (n !)^(n-1)!

3^(2n+2)-8n-9 is divisible by 8.

Using mathematical induction , show that n(n+1)(n+5) is a multiple of 3 .

Prove by the mathematical induction x^(2n)-y^(2n) is divisible by x+y

Use the principle of mathematical induction to show that (a^(n) - b^n) is divisble by a-b for all natural numbers n.

Prove by induction that n(n+1) (2n+1) is divisible by 6.