Aliquot sequence classifications: Difference between revisions
Content added Content deleted
(Added Mathematica) |
(→{{header|Fortran}}: The new Mathematica example, with its N-precision arithmetic, confirms the third value for the monster. Via Fortran, crunching two steps of the sequence takes about a second.) |
||
| Line 139: | Line 139: | ||
After 2, overflows! 15355717786080,44534663601120 |
After 2, overflows! 15355717786080,44534663601120 |
||
Allowing more rope leads 1488 to overflow after the 83'rd value. Extending TOOBIG to 2**48 produces overflow from step 88, and the monster test value manages one more step. |
Allowing more rope leads 1488 to overflow after the 83'rd value. Extending TOOBIG to 2**48 produces overflow from step 88, and the monster test value manages one more step, to 144940087464480 and confirmed via the Mathematica example. |
||
Because the task involves only a few numbers to test, there is not so much advantage to be gained by pre-calculating a set of sums of proper divisors, but it does mean that no special tests are needed for N = 1 in function SUMF. |
Because the task involves only a few numbers to test, there is not so much advantage to be gained by pre-calculating a set of sums of proper divisors, but it does mean that no special tests are needed for N = 1 in function SUMF. |
||