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

Content added Content deleted

Inline

Revision as of 02:26, 9 July 2015 (view source) Rdm (talk \| contribs) m (→‎Fermat's little theorem?) ← Older edit		Revision as of 05:53, 9 July 2015 (view source) rosettacode>G.Brougnard m (clarification, I hope) Newer edit →
Line 22:		Line 22:

	: Actually, I don't see any such expression in echolisp's solution. That solution does make sense to me - but I'm not seeing anything related to fermat's little theorem there, yet. Nor am I seeing anything like that polynomial. --[[User:Rdm\|Rdm]] ([[User talk:Rdm\|talk]]) 02:26, 9 July 2015 (UTC)		: Actually, I don't see any such expression in echolisp's solution. That solution does make sense to me - but I'm not seeing anything related to fermat's little theorem there, yet. Nor am I seeing anything like that polynomial. --[[User:Rdm\|Rdm]] ([[User talk:Rdm\|talk]]) 02:26, 9 July 2015 (UTC)

			:: It was just a mean to demonstrate that '''N = 0,1,2 (mod 3) implies N^5 = 0,1,2 (mod 3)'''. I do'nt know any more. This is not used in EchoLisp solution to the task. In this '''talk''' 'Echolisp solution' only means I computed the powers of 3p+i polynomials with EchoLisp. I should have written 'EchoLisp solution to your question in this talk' .Sorry for the misunderstanding. --[[User:G.Brougnard\|G.Brougnard]] ([[User talk:G.Brougnard\|talk]]) 05:53, 9 July 2015 (UTC)