九章算术 & Fermat Little Theorem

500 BCE Confucius Period 孔子时代,Chinese ancient Math text “Nine Chapters of Arithmetic” 中国 (九章算术) already recorded the following:
p \mid  (2^{p} - 2) \text { for p prime}
\iff 2^{p} \equiv  2 \mod {p}

Fermat Little Theorem (17th century):
m^{p} \equiv  m \mod {p}

Note: Computer Cryptography is based on two math theorems: Chinese Remainder Theorem and Fermat Little Theorem.

Advertisements

One thought on “九章算术 & Fermat Little Theorem

  1. Pingback: Our Daily Story #1 : The Fermat’s Last Theorem | Math Online Tom Circle

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s