Isn't that easy? >_<

Number Theory Level 3

( 5915587277 6777784 ) {5915587277\choose 6777784} Mod ( 5915587277 5915587277 )


The answer is 0.

Shivamani Patil by shivamani patil , 21, India

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.

1 solution

Jaiveer Shekhawat
Nov 18, 2014

01 01

: P \huge{:P}

0 Helpful 0 Interesting 0 Brilliant 0 Confused

one must keep in mind that Luca's theorem can be applied only if in (mod p); p is prime, thus i assumed it 5915587277 as a prime which it was!!

jaiveer shekhawat - 6 years, 6 months ago

Log in to reply

It is fact that if n is a prime then nCr mod n=0

shivamani patil - 6 years, 6 months ago

simple application of lucas theorem

Rajarshi Chatterjee - 6 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...