# Theorems and Their Proofs > This note documents some common theorems and the proofs of them. ## Fermat's Little Theorem *if $p$ is a prime number, then for any integer $a$ that is not divisible by $p$, it holds $a^{p-1} \equiv 1 \pmod p$.*
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up