I want to show when the following is true for $p$ a prime number. $(p - 2)! \equiv 1 \pmod p$. Could someone help me prove this? It worked for $p = 2$, $p = 3$, $p = 5$, so I believe it may work for all primes but I need to prove it. I don't know how to apply Wilson's or Fermat's theorem to this. I tried to rewrite it as $(p - 1 - 1)! \equiv 1 \pmod p$ but I still couldn't see how to apply Wilson's theorem to it. Could someone help me?
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}...
-
How can one proof the equality $$\sum\limits_{v=0}^k \frac{k^v}{v!}=\sum\limits_{v=0}^k \frac{v^v (k-v)^{k-v}}{v!(k-v)!}$$ for $k\in\mathbb{...
-
Good evening, I have a question concerning the euclidean algorithm. One knows that for $a_1 , \ldots , a_n \in \mathbb{N} $ and $k\in \mathb...
-
Using mathematical induction, I have proved that $$1+ 5+ 9 + \cdots +(4n-3) = 2n^{2} - n$$ for every integer $n > 0$. I would like to kn...
No comments:
Post a Comment