Conservapedia

Changes

Fermat's Little Theorem (view source)

Revision as of 23:46, May 28, 2025

210 bytes added ,  23:46, May 28, 2025
no edit summary
Line 1: Line 1:  
'''[[Fermat]]'s Little Theorem''' (so called to distinguish it from [[Fermat's Last Theorem]]) is that:
 
'''[[Fermat]]'s Little Theorem''' (so called to distinguish it from [[Fermat's Last Theorem]]) is that:
   −
:if p is prime and b < p, than b<sup>(p-1)</sup> = 1(mod p).
+
: if p is a [[prime number]], then for any integer x, the number x<sup>p</sup> − x is an integer multiple of x.
 +
 
 +
:Alternatively, x<sup>p</sup> ≡ x (mod p).
 +
 
 +
Stated another way:
 +
:if p is prime and b < p, than b<sup>(p-1)</sup> = 1 (mod p).
 +
 
 
[[Category:Mathematics]]
 
[[Category:Mathematics]]
 +
[[Category:Number Theory]]
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/2129016"