Okay, yesterday slipped by without a post so I guess I owe you all two posts today. How about this one will be on Project Euler and the other will be a Helmssmith update? Sound good? Sure.
So problem 23 is about abundant numbers, or numbers where the sum of their divisors adds up to be more then the number itself. In other cases the number is ‘perfect’ or ‘deficient’. After learning that bit of trivia, the question is what is the sum of all positive numbers that can not be made by adding two abundant numbers. For reasons you don’t have to check any higher then just over twenty eight thousand.
Welp, at first I thought it was just looking for the highest number meeting that criteria. Nope. Then I was having trouble with numbers that were smaller then the smallest abundant number, it was only flagging even ones up until they got big enough to work correctly. I think this is the first time I’ve used do while loops and I kind of like them. Also I may go back and swap the test for abundance with a search in the list of abundant numbers generated. Lets see how long it takes me to implement binary search. Woo.
