PROJECT EULER · #0095
Amicable Chains
The proper divisors of a number are all the divisors excluding the number itself. For example, the proper divisors of
Interestingly the sum of the proper divisors of
Perhaps less well known are longer chains. For example, starting with
Since this chain returns to its starting point, it is called an amicable chain.
Find the smallest member of the longest amicable chain with no element exceeding one million.
Write-up coming later
The complete problem is available here. An approach, code, and answer will be added later.