I need to show that if (n−2)!≡1(modn) then n is prime.
I think that if n is composite, then we'll have every factor of n in (n−2)!, and it would yield that (n−2)!≡0(modn).
However, I didn't use the fact that it specifically congruent to 1mod, so I think I'm getting something fundamental wrong. Is my solution correct? Why do we demand congruence to 1 \bmod n?
Thursday, 10 July 2014
congruences - Showing a number n is prime if (n−2)!equiv1pmodn
Subscribe to:
Post Comments (Atom)
real analysis - How to find lim_{hrightarrow 0}frac{sin(ha)}{h}
How to find \lim_{h\rightarrow 0}\frac{\sin(ha)}{h} without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
-
Ok, according to some notes I have, the following is true for a random variable X that can only take on positive values, i.e P(X \int_0^...
-
Self-studying some properties of the exponential-function I came to the question of ways to assign a value to the divergent sum $$s=\sum_{k=...
-
The question said: Use the Euclidean Algorithm to find gcd (1207,569) and write (1207,569) as an integer linear combination of 1207 ...
No comments:
Post a Comment