Changes

Jump to navigation Jump to search

Fermat's Little Theorem (view source)

Revision as of 03:01, July 14, 2007

119 bytes added ,  03:01, July 14, 2007
New page: Fermat's Little Theorem is this: :if p is prime and b < p, then b<sup>(p-1)</sup> = 1(mod p). category:mathematics
Fermat's Little Theorem is this:

:if p is prime and b < p, then b<sup>(p-1)</sup> = 1(mod p).
[[category:mathematics]]
Aschlafly
Anthony, Irenaeus, Siteadmin, apieditor, Bureaucrats, Check users, nsAm_Govt_101RO, nsAm_Govt_101RW, nsAm_Govt_101_ta, nsJudgesRO, nsJudgesRW, nsJudges_talkRO, nsJudges_talkRW, nsTeam2RO, nsTeam2RW, nsTeam2_talkRO, nsTeam2_talkRW, oversight, Administrators
126,215

edits

Retrieved from "https://www.conservapedia.com/Special:MobileDiff/231458"

Navigation menu