jct/codingtests
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Added first version of helper tool

Browse Source
This commit is contained in:
FuryFire
2012-03-15 13:12:02 +01:00
parent 823b0a332a
commit e99ce2c532
10 changed files with 92 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
ProjectEuler/023/desc.yml
View File

@ -6,8 +6,6 @@ desc: |
A number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if this sum exceeds n.
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.
|
todo: Improve algorithm
solution: From we http://mathworld.wolfram.com/AbundantNumber.html we cheat and limit our search to 20161