Talk:Euler's sum of powers conjecture: Difference between revisions

Answer to N (mod 3) = N^5 (mod 3)
 
(Answer to N (mod 3) = N^5 (mod 3))
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)
 
----
EchoLisp solution :
 
if N = 3p + 1 , N^5 = "243p^5 +405p^4 +270p^3 +90p^2 +15p +1 " , which is 1 (mod 3)
 
if N = 3p + 2 ; N^5 = "243p^5 +810p^4 +1080p^3 +720p^2 +240p +32 ", which is 2 (mod 3)
--[[User:G.Brougnard|G.Brougnard]] ([[User talk:G.Brougnard|talk]]) 22:10, 8 July 2015 (UTC)