Home
Class 12
MATHS
5^(n)-1 is always divisible by (n in N)...

`5^(n)-1` is always divisible by `(n in N)`

A

(a) 3

B

(b) 4

C

(c) 5

D

(d) 6

Text Solution

Verified by Experts

The correct Answer is:
B
Promotional Banner

Topper's Solved these Questions

  • PRINCIPLE OF MATHEMATICAL

    AAKASH INSTITUTE ENGLISH|Exercise Section-D:(Assertion-Reason Type Questions)|11 Videos
  • PRINCIPLE OF MATHEMATICAL

    AAKASH INSTITUTE ENGLISH|Exercise Section-B((Objective Type Questions (One option is correct))|20 Videos
  • PERMUTATIONS AND COMBINATIONS

    AAKASH INSTITUTE ENGLISH|Exercise Assignment Section-J (Aakash Challengers Questions)|7 Videos
  • PROBABILITY

    AAKASH INSTITUTE ENGLISH|Exercise ASSIGNMENT SECTION-J (aakash challengers questions)|11 Videos

Similar Questions

Explore conceptually related problems

P=n(n^(2)-1)(n^(2)-4)(n^(2)-9)…(n^(2)-100) is always divisible by , (n in I) (a) 2!3!4!5!6! (b) (5!)^(4) (c) (10!)^(2) (d) 10!11!

If n is a natural number, then 9^(2n)-4^(2n) is always divisible by (a) 5 (b) 13 (c) both 5 and 13 (d) none of these

Statement-1: n(n+1)(n+2) is always divisible by 6 for all n in N . Statement-2: The product of any two consecutive natural number is divisible by 2.

Most of the formulae are verified on the basis of induction method by putting n=1,2,... 27^(n)-8^(n) is divisible by: ("for "n in N)

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

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

10^n+3(4^(n+2))+5 is divisible by (n in N)

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

9^(n)-8^(n)-1 is divisible by 64 is

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