Project Euler — Problem 83 Solution

Project Euler — Problem 83 Solution

Tweet The problem description is here, and click here to see all my other Euler solutions in F#.   This is a more difficult version of problem 82, and now you can move in all four directions! As before, we start by loading the input data into a 2D array: and initialize another matrix of the

Project Euler — Problem 82 Solution

Project Euler — Problem 82 Solution

Tweet The problem description is here, and click here to see all my other Euler solutions in F#.   This is a more difficult version of problem 81, but still, as you can’t move left so we can still optimize one column at a time. First, let’s read the input file into a 2D array:

Project Euler — Problem 75 Solution

Project Euler — Problem 75 Solution

Tweet The problem description is here, and click here to see all my other Euler solutions in F#.   I based my solution on Euclid’s formula for generating Pythagorean triples. And given that max L is 1,500,000, the maximum value for m we need to consider is . Because and , we can deduce that ; and since