Ruth-Aaron numbers: Difference between revisions
Content added Content deleted
m (→{{header|ALGOL 68}}: Notes) |
(→{{header|ALGOL 68}}: notes) |
||
| Line 36: | Line 36: | ||
Uses sieves for the prime factor sums and prime divisor sums, assumes that the first Ruth-Aaron triples are under 99 000 000.<br> |
Uses sieves for the prime factor sums and prime divisor sums, assumes that the first Ruth-Aaron triples are under 99 000 000.<br> |
||
This uses a large amount of memory - too much for Algol 68G under Windows (and possibly under Linux).<br> |
This uses a large amount of memory - too much for Algol 68G under Windows (and possibly under Linux).<br> |
||
With max number set to 1 000 000, Algol 68G can find the first triple using factors in a few seconds (the loop to find the first divisors triple must be commented out or removed) - Real time: 0.941 s on TIO.RUN. |
With max number set to 1 000 000, Algol 68G can find the first triple using factors in a few seconds (the loop to find the first divisors triple must be commented out or removed) - Real time: 0.941 s on TIO.RUN for the cutdown version. |
||
<lang algol68>BEGIN # find Ruth-Aaron pairs - pairs of consecutive integers where the sum # |
<lang algol68>BEGIN # find Ruth-Aaron pairs - pairs of consecutive integers where the sum # |
||
# of the prime factors or divisors are equal # |
# of the prime factors or divisors are equal # |
||