Fermat's little theorem
The proof of the correctness of RSA is based on Fermat's little theorem, stating that for any integer "a" and prime "p", not dividing "a".