Anonymous user
Euler's sum of powers conjecture: Difference between revisions
m
→{{header|QL SuperBASIC}}
(→{{header|QL SuperBASIC}}: outline changes for ZX80) |
|||
Line 3,397:
=={{header|QL SuperBASIC}}==
This program enhances a modular brute-force search, posted on fidonet in the 1980s, via number theoretic enhancements as used by the program listed under ZX Spectrum Basic, but without the early exit in the control framework so as to be backward-compatible with the lack of floating point in Sinclair ZX80 BASIC (whereby the latter is truly 'zeroeth' generation). To emulate running on a ZX80 (needing a 16K RAM pack & MODifications, some given below)
<lang qbasic>
1 CLS
2 DIM i%(255,6) : DIM
3 DIM v%(255,
4 RESTORE 137
6 FOR m=0 TO 6
7 READ t%
8 FOR j=1 TO 255
11 LET i%(j,m)=j MOD t%
|