Numbers which are the cube roots of the product of their proper divisors: Difference between revisions
Numbers which are the cube roots of the product of their proper divisors (view source)
Revision as of 19:56, 2 October 2022
, 1 year ago→{{header|PL/M}}: typo
(→{{header|PL/M}}: Alternative sample based on modular arithmetic and prime factors) |
(→{{header|PL/M}}: typo) |
||
Line 500:
</pre>
Alternative version, calculating the proper divisor products and cubes modulo 65536 (as PL/M uses unsigned
Using this technique, the first 50 numbers can be found in a few seconds but to find the 5000th takes several minutes. As the candidates increase, the proportion that have cubes that are 0 mod 65536 increases and the factorisation and aggregation is quite expensive (the code could doubtless be improved).
{{works with|8080 PL/M Compiler}} ... under CP/M (or an emulator)
|