CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

For any positive integer , n3n is always divisible by ___?


A

6

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
B

12

No worries! We‘ve got your back. Try BYJU‘S free classes today!
C

15

No worries! We‘ve got your back. Try BYJU‘S free classes today!
D

18

No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution

The correct option is A

6


n3n=n(n21)=(n1).n.(n+1)

Whenever a number is divided by 3, the remainder obtained is either 0 or 1 or 2.
n=3p or 3p+1 or 3p+2, where p is some integer.
If n=3p, then n is divisible by 3.
Ifn=3p+1, thenn1=3p+11=3p is divisible by 3.
If n=3p+2, then n+1=3p+2+1=3p+3=3(p+1) is divisible by 3.
So, we can say that one of the numbers among n, n – 1 and n + 1 is always divisible by 3.
n(n1)(n+1) is divisible by 3.

Similarly, whenever a number is divided 2, the remainder obtained is 0 or 1.
n=2q or 2q+1, where q is some integer.
If n=2q, then n is divisible by 2.
If n=2q+1,then n1=2q+11=2q is divisible by 2 and n + 1 = 2q + 1 + 1 = 2q + 2 = 2 (q + 1) is divisible by 2.
So, we can say that one of the numbers among n, n – 1 and n + 1 is always divisible by 2.
n(n1)(n+1) is divisible by 2.
Since,n(n1)(n+1) is divisible by 2 and 3.
We know that if a number is divisible by both 2 and 3 , then it is divisible by 6.
n(n1)(n+1)=n3n is divisible by 6.


flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Euclid's Division Algorithm_Tackle
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon