Home
Class 12
MATHS
Prove by induction that if n is a positi...

Prove by induction that if `n` is a positive integer not divisible by `3`, then `3^(2n)+3^(n)+1` is divisible by `13`.

Text Solution

Verified by Experts

Let `P(n)=3^(2n)+3^(n)+1, forall n ` is a positive integer not divisible by 3 .
Step I For `n=1`.
`P(1)=3^2+3+1=9+3+1=13`, which is divisible by 13.
Therefore , P(1) is true .
Step II Assume P(n) is true For `n=k, k` is a positive integer not divisible by 3. then
`P(k)=3^(2k)+3^(k)+1`. is divisible by 13.
`rArr P(k)=13r`, where r is an integer .
Step III For `n=k+1`,
`P(k+1)=3^(2(k+1))+3^(k+1)+1`
`=3^2.3^2k+3.3^k+1`

`rArr P(k+1)=3^2(3^(2k)+3^k+1)-6.3^k-8`
`=9P(k)-2(3^(k+1)+4)`
`=9*13r)-2(3^(k+1)+4)` [by assumption step]
which is divisible by 13 as `3^(k+1)+4` is also divisible by `13, forall k in N`. and not divisible by 3. This shows that the result is true for `n=k+1`. Hence , by the principle of mathematical induction , the result is true for all natural numbers not divisible by 3.
Promotional Banner

Similar Questions

Explore conceptually related problems

10^(2n-1)+1 is divisible by 11.

49^(n)+16 n-1 is divisible by

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

If n is a positive integer, then n^(3)+2n is divisible

n^7-n is divisible by 42 .

If n is a +ve integer, 4^(n)-3 n-1 is divisible by

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

For every positive integer n, prove that 7^(n) – 3^(n) is divisible by 4.

Use proof by contradiction to prove that if for an integer a, a^2 is divisible by 3, then a is divisible by 3.

n^2 -1 is divisible by 8, if n is