Rosetta Code

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

Page Discussion

Numbers which are the cube roots of the product of their proper divisors (view source)

Revision as of 12:59, 30 September 2022

1 byte added ,  1 year ago
m
→‎{{header|ALGOL 68}}: typo, typo...
m (→‎{{header|ALGOL 68}}: typo, typo...)
Line 24:
Whilst deceptively simple, the task reuires large integers as some of the divisor prioducts needed are large. This ignores numbers where the divisor product is going to be larger than the cube of the maximum number it considers.
<br>
ReuiresRequires an implementation of Algol 68 where LONG INT is longer than 64 bits, in ALGOL 68G, LONG INT is 128 bit in version 3 and allows up to 35 digits in version 2. Constructs a table of proper divisor products to avoid factorising each number. 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> of the command line.
<syntaxhighlight lang="algol68">
BEGIN # find some numbers which are the cube roots of the product of their #
Tigerofdarkness
3,048

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/330937"