Problem 23

Projekt Euler w Ruby
1

Problem 23

A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect number.

A number whose proper divisors are less than the number is called deficient and a number whose proper divisors exceed the number is called abundant.

As 12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number that can be written as the sum of two abundant numbers is 24. By mathematical analysis, it can be shown that all integers greater than 28123 can be written as the sum of two abundant numbers. However, this upper limit cannot be reduced any further by analysis even though it is known that the greatest number that cannot be expressed as the sum of two abundant numbers is less than this limit.

Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.

2

[code=ruby]def sum_of_divisors(number)
(1…number).inject(0){|sum,item| sum = (number%item == 0)? sum + item : sum }
end

ab = (1…28123).select{ |number| sum_of_divisors(number)>(2*number) }

supersum=ab.collect{|item| ab.collect{|a| a+item} }.flatten.uniq.sort

sum = (1…28123).inject(0){|sum,item| sum= (!supersum.include?(item))? sum+item : sum }

p sum[/code]

3

[code=ruby]def abundant(n)
a= []
if (1…(n/2)).select{|q| n % q == 0}.inject(:+)
then a << n
end
end

a = (2…28123).to_a.select{|x| abundant(x)}
b = a.repeated_combination(2).to_a
e = []
(0…(b.size -1)).each{|x| e << a[x].inject(:+)}
c = ((1…28123).to_a - e).inject(:+)[/code]
Witam wszystkich serdecznie! Z góry uprzedzam, że nowy ze mnie zawodnik i mogę zaskoczyć sporą ignorancją. Co do rozwiązania zarówno moje jak i kolegi wyżej pada gdyż, “fail to allocate memory”. Dla mniejszego przedziału zdaje się funkcjonować słusznie. Czy mam rację?