Let n = x n=x

Level 2

For n ≥ 2 n\ge2 and a prime number Find:-

Find ( n − 1 ) ! m o d ( n ) (n-1)! \mod (n)


The answer is -1.

Sumukh Bansal by Sumukh Bansal , 16, 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.

2 solutions

Sumukh Bansal
Dec 9, 2017

Use Wilson's theorem

0 Helpful 0 Interesting 0 Brilliant 0 Confused
Sathvik Acharya
Dec 9, 2017

Wilson's Theorem

0 Helpful 0 Interesting 0 Brilliant 0 Confused

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...