Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Stack Overflow for Teams is now called Stack Internal. Bring the best of human thought and AI automation together at your work.
Bring the best of human thought and AI automation together at your work. Learn more
Stack Internal
Knowledge at work
Bring the best of human thought and AI automation together at your work.
Fermat's Little Theorem tells us for a prime $p$ if $\gcd(p,n)=1$, then:
$$n^{p-1} \equiv 1 \pmod p$$
If $n | (p+1)$, does it necessarily follow that:
$$n^{p-2} \equiv \frac{p+1}{n} \pmod p$$
