Home
Class 11
MATHS
prove that 4^(n)-1 is divisible by 3, fo...

prove that `4^(n)-1` is divisible by 3, for each natural number n.

Text Solution

Verified by Experts

Let `P(n):4^(n)-1` is divisible by 3 for each natural number n. Step I Now, we observe that P(1) is true.
`P(1)=4^(1)-1=3`
It is clear that 3 is divisible by 3.
Hence, P(1) is true.
Step II Assume that, P(n) is true for n=k
`P(k):4^(k)-1` is divisible by 3
`x4^(k)-1=3q`
Step III Now, to prove that P(k+1) is true. `P(k+1):4^(k+1)-1`
`=4^(k).4-1`
`=4^(k).3+4^(k)-1`
`=3*4^(k)+3q[because4^(k)-1=3q]`
`=3(4^(k)+q)`
Thus, P(k+1) is true whenever P(k) is true.
Hence, by the principle of mathematical P(n) is true for all natural number n.
Promotional Banner

Topper's Solved these Questions

  • PRINCIPLE OF MATHEMATICAL INDUCTION

    NCERT EXEMPLAR|Exercise LONG ANSWER TYPE QUESTION|9 Videos
  • PRINCIPLE OF MATHEMATICAL INDUCTION

    NCERT EXEMPLAR|Exercise OBJECTIVE TYPE QUESTIONS|5 Videos
  • PERMUTATIONS AND COMBINATIONS

    NCERT EXEMPLAR|Exercise Matching The Columns|5 Videos
  • PROBABILITY

    NCERT EXEMPLAR|Exercise Matching The Columns|2 Videos

Similar Questions

Explore conceptually related problems

prove that 3^(2n)-1 is divisible by 8, for all natural numbers n.

prove that n(n^(2)+5) is divisible by 6, for each natural number n.

n^(3)-n is divisible by 6, for each natural numbers n ge2

Show that 10^(2n-1)+1 is divisible by 11 for all natural numbers n.

Prove that (n!+1) is not divisible by any natural number between 2 and n

Using the principle of mathematical induction, prove that (7^(n)-3^(n)) is divisible by 4 for all n in N .

Statement-1: For each natural number n,(n+1)^(7)-n^(7)-1 is divisible by 7 . Statement-2: For each natural number n,n^(7)-n is divisible by 7 .

If n is any natural number, then 5^(2n)-1 is always divisible by how many natural numbers ?

Using binomial theorem, prove that (2^(3n)-7n-1) is divisible by 49, where n in N.