Numbers which are the cube roots of the product of their proper divisors: Difference between revisions

Attempting the task by computing divisor products (as this sample does) requires large integers as some of the products needed are quite big. This ignores numbers where the divisor product is going to be larger than the cube of the maximum number it considers.

It constructs a table of proper divisor products to avoid factorising each number. As the J sample suggests, alternative approaches could avoid the need for large integers.

<br>

Requires an implementation of Algol 68 where LONG INT is more than 64 bits, in ALGOL 68G, LONG INT is 128 bit in version 3 and allows up to 35 digits in version 2. In order to run this under Windows (and probably other operating systems) with Algol 68G, a large heap size must be specified, e.g. with <code>-heap 256M</code> on the command line.