Just a quick Project Euler update. Number 8 was pretty straightforward, I just went through and got each product and then found the max. For Number 9, I created a Triplet class with an IsPythagorean method. I then use three loops (nested) to go start from 1 and go up to a given n. It’s not entirely brute force, because the 2nd number must be greater than the 1st, and the 3rd number can be calculated using the Pythagorean theorum. Then, if that Triplet sums to the given n, I add it to a list, and return that list at the end. The Triplet with the highest sum is the answer. Since the problem says there is only one that sums to 1000, I simply return .Single() of the list.
Number 10 was yet another prime-numbers problem. I used the IsPrime method from before, and simply looped from 1 to a million, and added the primes to a list. Linq can be used then to sum up the list, and done.
As before, check out all the source on CodePlex.
Write a response