Euler's sum of powers conjecture: Difference between revisions

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 ~~one~~, will still lose precision and find false solutions, ~~even~~ ~~if separating the integer part of q into p, as~~ difference of 2 in one of the summands results in a difference in just the 11th decimal ~~place~~. Even QL SuperBASIC can only make such FP comparisons down to the 7th. But the attempted fix should only be very slow.}}

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 the square root, will still lose precision and find false solutions, as a difference of 2 in one of the summands results in a difference in just the 11th place after the decimal point. Even QL SuperBASIC can only make such FP comparisons down to the 7th. But the attempted fix should only be very slow.}}

Very, very, very slow. Even with an emulator at full speed.