Open main menu
Home
Random
Log in
Settings
About Conservapedia
Disclaimers
Conservapedia
Search
Changes
← Older edit
Newer edit →
Fermat's Little Theorem
(view source)
Revision as of 12:24, July 13, 2016
No change in size
,
12:24, July 13, 2016
→top
:
clean up & uniformity
Line 2:
Line 2:
: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
]]
DavidB4-bot
Block, SkipCaptcha, apieditor,
Automoderated users
,
Bots
, edit, ratelimit-exempt
58,748
edits