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.

**Antonio Sanchez**: I'm not sure I follow (or would trust in general) your first approach. It seems like you are suggesting that if p does not divide R(10^{"sufficiently...**Jean-Marie Hachey**: Adding layers to a cube...C(x,y,z,n) C(1,1,1,1) = 6 C(1,1,1,2) = 18 C(1,1,1,3) = 38 C(1,1,1,4) = 66 C(1,1,1,5) = 102 C(1,1,1,6) = 146 C(1,1...**Jean-Marie Hachey**: Using the general formula presented in the above article : C(x,y,z,n) = 2(x*y + y*z + x*z) + 4(x+y+z + n -2 )*(n-1) and a spreadsheet (here Excel)....**Sierra**: I'm doing it by hand, btw...**Sierra**: Won't the arithmetic/geometric approach double add numbers that are both multiples of 3 and 5 (e.g. 15)?...**Imesh**: I think it's easy to use prime numbers and get the multiphications cus modulo & division take time to process .Every prime has a unique continued ...

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:

This site uses cookies. ☒