Achilles numbers: Difference between revisions

=={{header|RPL}}==

Based on Wikipedia definition: n = p₁^a₁p₂^a₂…p_k^a_k is an Achilles number if min(a₁, a₂, …, a_k) ≥ 2 and gcd(a₁, a₂, …, a_k) = 1.

{{works with|HP|49g}}

≪ → s

≪ { } DUP

1 s SIZE '''FOR''' j

SWAP s j GET + '''NEXT'''

≫ ≫ '<span style="color:blue">UNBUNDL</span>' STO

≪ DUP FACTORS

'''IF''' DUP SIZE 4 < '''THEN''' DROP2 0

'''ELSE'''

<span style="color:blue">UNBUNDL</span> → p a

≪ 1 p INV - ΠLIST →NUM *

a ≪ MIN ≫ STREAM 2 ≥

a ≪ GCD ≫ STREAM 1 ==

AND *

≫

'''END'''

≫ '<span style="color:blue">ACH?</span>' STO

≪ { } 1 → n

≪ '''WHILE''' DUP SIZE 50 < '''REPEAT'''

'''IF''' 'n' INCR <span style="color:blue">ACH?</span> '''THEN''' n + '''END'''

'''END'''

≫ ≫ EVAL

≪ { } 1 → n

≪ '''WHILE''' DUP SIZE 20 < '''REPEAT'''

'''IF''' 'n' INCR <span style="color:blue">ACH?</span> 4 RND R→I <span style="color:blue">ACH?</span> '''THEN''' n + '''END'''

'''END'''

≫ ≫ EVAL

{{out}}

<pre>

2: {72 108 200 288 392 432 500 648 675 800 864 968 972 1125 1152 1323 1352 1372 1568 1800 1944 2000 2312 2592 2700 2888 3087 3200 3267 3456 3528 3872 3888 4000 4232 4500 4563 4608 5000 5292 5324 5400 5408 5488 6075 6125 6272 6728 6912 7200}

1: {500 864 1944 2000 2592 3456 5000 10125 10368 12348 12500 16875 19652 19773 30375 31104 32000 33275 37044 40500}

</pre>

First 50 Achilles numbers found in 1 minutes 53 seconds on the ''iHP48'' emulator running on a iPhone Xr; first 20 strong Achilles numbers found in 14 minutes on the same platform.