Anonymous user
Euler's sum of powers conjecture: Difference between revisions
→{{header|ZX Spectrum Basic}}: completed "slide rule" fix
m (→ES5: fixed error that was only in output) |
(→{{header|ZX Spectrum Basic}}: completed "slide rule" fix) |
||
Line 3,945:
{{Incorrect|ZX Spectrum Basic|ZX Spectrum Basic has one numerical type, floating point consisting of 5 bytes, of which one holds the exponent, leaving 4 for the
mantissa. 249^4 is not too big to fit in those 4 bytes, but even 215^4 fills up all available bits. Adding up logarithmic "percentages" by subtracting that of the target sum from that of each summand and seeing if the inverses add up to
Very, very, very slow. Even with an emulator at full speed.
<lang zxbasic>
2 DIM p(249): DIM q(249)
4 FOR i=1 TO 249: q(i)=5*LN i: p(i)=q(i)/2: NEXT i
20 FOR w=7 TO
35 LET lnsum=LN sum
▲20 FOR w=7 TO (m-1)STEP 7: FOR x=5 TO (m-3)STEP 5: FOR y=3 TO (m-5)STEP 3: FOR z=2 TO (m-6)STEP 2
▲30 LET sum=EXP((q(w)-q(m))*5)+ EXP((q(x)-q(m))*5) + EXP((q(y)-q(m))*5) + EXP((q(z)-q(m))*5)
▲50 IF sum=1 THEN PRINT w;"^5+";x;"^5+";y;"^5+";z;"^5=";m;"^5": STOP
60 NEXT z: NEXT y: NEXT x: NEXT w
| |||