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.
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.
NOTE : read the rest of the series, or check out the source code.
If you enjoy reading these exercises then please buy Crista’s book to support her work.
Since joining JUST EAT I have been much more active in attending meetups because our office is walking distance to the Code Node. In particular, I have been a regular at Phil Trelford’s F#unctional Londoners group which meets twice a month.
After reading the question, a quick search on how to test if a point is in a triangle turned up this useful SO answer. Translating the algorithm to…