You can follow the discussion on **A 1000 Pythagorean triplets – Problem 9** without having to leave a comment. Just enter your email address in the form here below and you’re all set.

You can follow the discussion on **A 1000 Pythagorean triplets – Problem 9** without having to leave a comment. Just enter your email address in the form here below and you’re all set.

Grab the RSS feed for Free Updates!

(What's this? — Learn more about RSS)

subscribe

OR Get blog updates sent directly to your inbox by entering your email address below:

- Project Euler 267: Billionaire
- Making decisions under uncertainty in everyday life
- Taking a break
- Project Euler 146: Investigating a Prime Pattern
- Project Euler 145: How many reversible numbers are there below one-billion?
- UVa Online Judge New Platform
- Project Euler 144: Investigating multiple reflections of a laser beam.
- Project Euler 143: Investigating the Torricelli point of a triangle
- Project Euler 142: Perfect Square Collection
- Project Euler 141:Investigating progressive numbers, n, which are also square.

**GSW**: The only thing I am unsure of is (in the brute force method = BFI brute force and ignorance); how do we know that a < s/3 and b < s/2? My solut...**Michael J**: got the time down to about .2-.5 ms...**Jean-Marie Hachey**: Application of the algo (1) gives us all the identities where products are 1 through 9 pandigital except for the first two ones: 4*1738=6952 and 4*196...**shohan**: why take long long int i knew that int size is 32 bit so pow(2,32) is fits to the int...**Sr**: Hi, I managed to write the algorithm on my own. But I still couldn't get the wright answer. And I saw you used the modulo operator to get the rest of ...**peter**: Hi Sandu, No consolation but I get exactly the same result as you in my Ruby program. It runs in 1s and the sums are all OK, except for d=8. The corre...

Algebra API Arithmetic BigInteger Brute Force C# Calculus Combinatorics Competition Continued fractions Coprimes Diophantine Equation Dynamic Programming Euler's totient function Factorial Fibonacci Fractions Geometry Greatest Common Divisor Induction Java Jokes Linear Algebra Links Modulo Palindromes Pandigital Pell's equation Pen & Paper Pentagonal numbers Permutations Prime factorisation Prime Generation Prime numbers Programming Project Euler Proofs Pythagoras Recursion Repunit Sequences String Manipulation Teaching UVa Online Judge Video

search#### Search the Site: