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

Assertion : If n is an odd prime then [(5+2)n]2n+1 is not divisible by 20n, where [.] denotes greatest integer function.


Reason: If n is prime then nC1,nC2.....nCn1 must be divisible by n.

A
Both Assertion and Reason are correct and Reason is the correct explanation for Assertion
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
Both Assertion and Reason are correct but Reason is not the correct explanation for Assertion
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
Assertion is correct but Reason is incorrect
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
Both Assertion and Reason are incorrect
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
Open in App
Solution

The correct option is D Both Assertion and Reason are incorrect
We have PCr=P!r!(pr)!r!(Pr)!PCr=P!
As P|P! we get P|r!(P_r)PCr
But for 1rP1, neither r! nor (Pr)!is divisible by P
P|PCr
We have 52=15+20<52<10<f=(52)n<1
Let (2+5)n+N+F where 0<F<1
Now N+Ff2n+1=(5+2)n(52)n
=2[nC1s(n1)2(2)+nC3sn3223]+...+nCn2(5)2n1 (1)
Since n is odd
Since n is an odd prime each of nC1,nC3,...nCn2 is divisible by n
Thus R.H.S of (1) is divisible by 20n
Also Ff is an integer
Since 0<F<1 and 0<f<1, we get 1<Ff<1
As Ff is an integer, we get Ff=0 or F=f
Therefore integral part of (2+5)n2n+1 is N2n+1 which is divisible by 20n

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