euler/old-ruby/021.rb
2019-06-11 13:43:20 +02:00

32 lines
783 B
Ruby

descr=%{
Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n).
If d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called amicable numbers.
For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.
Evaluate the sum of all the amicable numbers under 10000.
}
def d(n)
sum=0
(1..n/2).each do |i|
if n % i == 0
sum += i
end
end
return sum
end
h={}
(1..10000).each do |n|
h[n]=d(n)
end
sum=0
h.each do |n,m|
if h[m] == n && n != m
puts "#{m}\t#{n}"
sum+=n
end
end
puts sum