Changes

Jump to navigation Jump to search

Fermat's Little Theorem (view source)

Revision as of 16:05, September 5, 2007

4 bytes added ,  16:05, September 5, 2007
undeadend
Line 1: Line 1: −
Fermat's Little Theorem is this:
+
[[Fermat]]'s Little Theorem is this:
    
:if p is prime and b < p, then b<sup>(p-1)</sup> = 1(mod p).
 
:if p is prime and b < p, then b<sup>(p-1)</sup> = 1(mod p).
 
[[category:mathematics]]
 
[[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,214

edits

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

Navigation menu