Find the largest 3-digit prime number that divides P 1 0 0 0 2 0 0 0
Here, P r n is Permutation = ( n − r ) ! n !
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Btw @Vaibhav Prasad answer to your previous problem was 6 6 1 ??
Log in to reply
yes....... i had mistaken nCr for nPr
Log in to reply
Did you made this problem on your own??
Log in to reply
@Harsh Shrivastava – no.... it's from RMO 1992
Log in to reply
@Vaibhav Prasad – OK,
BTW, kal Tripathi sir ka admission test hain for ssc, difficult aayega kya??
Log in to reply
Log in to reply
Log in to reply
@Harsh Shrivastava – see it's solution
@Harsh Shrivastava – can you post me a solution to exponents are scary
Log in to reply
@Vaibhav Prasad – Well take mod 8 on both sides and see the magic!!
Log in to reply
@Harsh Shrivastava – still don't get it :(
Log in to reply
@Vaibhav Prasad – Will post a solution afterwards.
Have to study SSC 😓
Problem Loading...
Note Loading...
Set Loading...
If p is any 3-digit prime,then p 2 > 2 0 0 0 .
⟹ highest power of p that divides 2 0 0 0 ! is [ p 2 0 0 0 ] and 1 0 0 0 ! is [ p 1 0 0 0 ] .
⟹ highest power of p that divides 1 0 0 0 ! 2 0 0 0 ! is [ p 2 0 0 0 ] − [ p 1 0 0 0 ] .
If we put 9 9 7 = p we get [ 9 9 7 2 0 0 0 ] − [ 9 9 7 1 0 0 0 ] = 1
⟹ largest prime that divides P 1 0 0 0 2 0 0 0 is 9 9 7 .