Anonymous user
Talk:Euler's sum of powers conjecture: Difference between revisions
Talk:Euler's sum of powers conjecture (view source)
Revision as of 16:01, 29 September 2015
, 8 years agono edit summary
(answered Fermat's little theorem question) |
No edit summary |
||
Line 11:
(Reading that code, I'm having trouble deciding whether it could work for arbitrarily large values of N.) --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 17:21, 8 July 2015 (UTC)
ANSWER: Fermat's little theorem says x^p == x (mod p). Think of this as saying x^{p-1} == 1 OR x == 0 (mod p).
----
| |||