RosettaCodeData/Task/Amicable-pairs/Frink/amicable-pairs.frink
2023-07-01 13:44:08 -04:00

16 lines
263 B
Text

n = 1
seen = new set
do
{
n = n + 1
if seen.contains[n]
next
sum = sum[allFactors[n, true, false, false]]
if sum != n and sum[allFactors[sum, true, false, false]] == n
{
println["$n, $sum"]
seen.put[sum]
}
} while n <= 20000