Dubious Selection

( 7878 3939 ) m o d 7879 = ? \large \dbinom{7878}{3939} \bmod{7879} = \ ?

Note : You may use the fact that 7879 is prime.


The answer is 7878.

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.

2 solutions

Otto Bretscher
Sep 17, 2015

Wilson's Theorem does the job. With p = 7879 p=7879 and m = p 1 2 = 3939 m=\frac{p-1}{2}=3939 , we know that ( p 1 ) ! p 1 ( m o d p ) (p-1)!\equiv{p-1}\pmod{p} and ( m ! ) 2 ( 1 ) m + 1 = 1 ( m o d p ) (m!)^2\equiv(-1)^{m+1}=1\pmod{p} , by a straightforward refinement of Wilson's Theorem. Thus ( 7878 3939 ) = 7878 ! ( 3939 ! ) 2 7878 ( m o d 7879 ) {7878\choose{3939}}=\frac{7878!}{(3939!)^2}\equiv{\boxed{7878}}\pmod{7879}

The refinement of Wilson's Theorem is based on the factorization 1 ( p 1 ) ! = 1 2 . . . m ( p m ) ( p ( m 1 ) ) . . . ( p 1 ) ( m ! ) 2 ( 1 ) m ( m o d p ) -1\equiv(p-1)!=1*2*...*m*(p-m)*(p-(m-1))*...*(p-1)\equiv(m!)^2(-1)^m\pmod{p}

Nice! I knew Wilson's Theorem was the key, (which is why I just guessed at 7878 7878 as the answer), but I didn't know about the refinement, (which finally made sense to me after a few minutes). Thanks for this new bit of knowledge. :)

Brian Charlesworth - 5 years, 9 months ago

Log in to reply

I answered 1 -1 , which is technically correct but not recognized by the website :)

Anyway, here is a more elementary solution: Note that 7878 1 , 7877 2 , , 3940 3939 7878 \equiv -1, 7877 \equiv -2, \ldots, 3940 \equiv -3939 modulo 7879. Therefore ( 7878 3939 ) 3940 3941 7878 3939 3938 1 ( 3939 ) ( 3938 ) ( 1 ) 3939 3938 1 \left(\begin{array}{c} 7878 \\ 3939 \end{array}\right) \equiv\frac{3940 \cdot 3941 \cdots 7878}{3939 \cdot 3938 \cdots 1} \equiv \frac{(-3939)\cdot(-3938)\cdots(-1)}{3939\cdot3938\cdots1} ( 1 ) ( 1 ) ( 1 ) 3939 times ( 1 ) 3939 1. \equiv \underbrace{(-1)\cdot(-1)\cdots(-1)}_{\text{3939 times}} \equiv (-1)^{3939} \equiv -1. (It is essential that the base of modulo, 7879, is prime. Otherwise we would end up dividing by a zero divisor, which is undefined.)

Arjen Vreugdenhil - 5 years, 8 months ago

Did it the same way

Samarth Agarwal - 5 years, 8 months ago
Lu Chee Ket
Oct 30, 2015

Observed features for prime numbers from 3 to 53 and realized. 7878 C 3939 must be an integer!

If not 7878, then it must be 1. Tried with 7878 correct! Calculator cannot tell the answer; it only tells a wrong answer of // 6526.4351304442254481560126764616 //.

For X: Not prime and V: Prime for the following,

...

7875 X

7877 V

7879 V

7881 X

7883 V

7885 X

...

Most likeliness for 7879 Prime is having a remainder of 7878.

Answer: 7878

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...