\(gcd(k,p)=1\)

The formula states:

\({ k }^{ p\quad }\equiv \quad k-p\quad (mod\quad p)\)

\(k>p\)

For example:

Using \(2\) as \(p\),

And knowing that \(k=3\)

\({ 3 }^{ 2 }\quad \equiv \quad 1\quad (mod\quad 2)\)

By trying out other primes, this always work.

However, one link is still missing can we solve this equation by only knowing \(p\)?

## Comments

Sort by:

TopNewestIt doesnt only work for primes, it works for some other numbers too, but I'm not sure how to generalize it – Lee Isaac · 2 years, 3 months ago

Log in to reply

This has been proven using Fermat's Little theorem. But how do I validate it? – Luke Zhang · 2 years, 3 months ago

Log in to reply

And how did u find time during CNY? – Julian Poon · 2 years, 3 months ago

Log in to reply