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 02:16, August 17, 2016
6 bytes added
,
02:16, August 17, 2016
clean up
Line 1:
Line 1:
−
[[Fermat]]'s Little Theorem (so called to distinguish it from [[Fermat's Last Theorem]]) is
this
:
+
'''
[[Fermat]]'s Little Theorem
'''
(so called to distinguish it from [[Fermat's Last Theorem]]) is
that
:
−
:if p is prime and b < p,
then
b<sup>(p-1)</sup> = 1(mod p).
+
:if p is prime and b < p,
than
b<sup>(p-1)</sup> = 1(mod p).
[[Category:Mathematics]]
[[Category:Mathematics]]
DavidB4-bot
Block, SkipCaptcha, apieditor,
Automoderated users
,
Bots
, edit, ratelimit-exempt
58,447
edits