Anonymous user
Talk:Euler's sum of powers conjecture: Difference between revisions
Talk:Euler's sum of powers conjecture (view source)
Revision as of 22:34, 2 April 2020
, 4 years ago→What if we were to create a program where power was much larger than 5?(like 20+): new section
No edit summary |
|||
Line 26:
:: 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)
== What if we were to create a program where power was much larger than 5?(like 20+) ==
Clearly none of the optimisations provided in c++ would be able to tackle such a quantitywithout even considering that c++ isn't very good with large integers
| |||