Talk:Euler's sum of powers conjecture: Difference between revisions
Content added Content deleted
m (clarification, I hope) |
(answered Fermat's little theorem question) |
||
| Line 10: | Line 10: | ||
(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) |
(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). Now x^{5-1}=x^{3-1}^2, so it is 1 mod 3. --[[User:TomHyer|Tom Hyer]] |
|||
---- |
---- |
||