Three More Euler Problems Solutioned

Through overwhelming use of my brain powers, I have successfully (albeit, not particularly elegantly) solved three more Project Euler Problems. In Problem 5 I found the smallest integer divisible by all numbers 1 - 20. My solution to this one is TERRIBLE, but it works, so I haven't fixed it yet. Problem 6 I found the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum. I'm pretty happy with my solution to that one, but I'm no expert, and I'm sure all of these can be further simplified. Last on the updates is Problem 8 which came out nearly allright. I could pretty it up a bit, but it's a decent way to muscle through this particular problem, which was to find the greatest product of five consecutive digits in the 1000-digit number given.

Keep in mind that there are much more intelligent humans solving these in much more intelligent ways than I am currently. I just happen to have gone slightly insane, and find it kind of fun to spend my Friday nights at home working on math problems and listening to Phil Ochs. If a version of myself were to time travel to now from the past, I'm sure he would be horrified to the point of self obliteration, and thusly eliminate all possibility of me ever falling into this lifestyle.

Project Euler Solutions