Has anyone extended Wilson's Theorem?

If 9900000956 ! = x m o d 9900000959 9900000956! =x \bmod {9900000959} , find x x .

Hint : You may use the fact that 9900000959 is prime.

Please don't use computer to solve this problem.

500948503 none 759002068 4950000479

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.

3 solutions

Benjamin Ononogbu
Mar 29, 2016

ok here's something little i derived (p-3)! = (p-1)/2 mod p so applying it putting p=9900000959 in it we get 4950000479

you can add this extension to the wiki @ calvin lin

Benjamin ononogbu - 5 years, 2 months ago

Log in to reply

How ? (Proof please...)

Terza Reyhan - 5 years, 1 month ago
Ralph Macarasig
May 22, 2016

We know by Wilson's Theorem that for any prime p p ,

( p 1 ) ! (p-1)! \equiv 1 -1 m o d mod p p

Since 9900000959 9900000959 is prime, we have

( 9900000959 1 ) ! (9900000959-1)! \equiv 1 -1 m o d mod 9900000959 9900000959 or 9900000958 ! 9900000958! \equiv 9900000958 9900000958 m o d mod p p

It can be observed that 9900000958 ! = 9900000958 × 9900000957 × 9900000956 ! 9900000958! = 9900000958 \times 9900000957 \times 9900000956!

Also, 9900000958 9900000958 \equiv 1 -1 m o d mod 9900000959 9900000959 and 9900000957 9900000957 \equiv 2 -2 m o d mod 9900000959 9900000959

So,

9900000958 × 9900000957 × 9900000956 ! 9900000958 \times 9900000957 \times 9900000956! \equiv ( 1 ) × ( 2 ) × 9900000956 ! (-1)\times(-2)\times 9900000956!\ \equiv 9900000958 9900000958 m o d mod 9900000959 9900000959

Thus,

9900000956 ! 9900000956! \equiv 9900000958 ( 1 ) × ( 2 ) \frac{9900000958}{(-1)\times(-2)}\equiv 4950000479 4950000479 m o d mod 9900000959 9900000959

Cantdo Math
Apr 22, 2020

From wilsons theorem it follows that, the answer is 1 2 \frac{-1}{2} modulo that prime we can easliy find the modular inverse of 2 here.Simply, p r i m e + 1 2 \frac{prime+1}{2} for that minus sign we subtract the modular inverse of 2 from that prime which results in 4950000479

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...