Jump to content

Euler's sum of powers conjecture: Difference between revisions

(Added XPL0 example.)
Line 3,098:
{{out}}
<pre>133^5 + 110^5 + 84^5 + 27^5 = 144^5</pre>
=={{header|Picat}}==
<lang Picat>
import sat.
main =>
X = new_list(5), X :: 1..150, decreasing_strict(X),
X[1]**5 #= sum([X[I]**5 : I in 2..5]),
solve(X), printf("%d**5 = %d**5 + %d**5 + %d**5 + %d**5", X[1], X[2], X[3], X[4], X[5]).
</lang>
{{out}}
<pre>144**5 = 133**5 + 110**5 + 84**5 + 27**5</pre>
<pre>CPU time 6.626 seconds</pre>
 
=={{header|PicoLisp}}==
Cookies help us deliver our services. By using our services, you agree to our use of cookies.