Changes
Jump to navigation
Jump to search
← 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,183
edits
Navigation menu
Personal tools
Create account
Log in
Namespaces
Article
talk page
Variants
Views
Read
View source
View history
More
Search
Popular Links
Main Page
Recent changes
New Pages
Random page
Statistics
Edit Console
Special pages
Printable version