Let n be a natural number, n≥2. Prove that if (n-1)!\equiv-1 \mod n then n is prime. I tried few things but I my skills in equations modulo n are not well enough. I would really appreciate your help.
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