Find the largest - digit number , such that divides .
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.
(n-1)!= -1(mod n) [It follows directly from Wilson's Theorem] So, if n divides (n-1)! + 1, n is prime. Now, you can check out the list for the largest 3 digit prime no. note link [[This is the link on Brilliant itself from Arron Kau's Note]].