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.

**zakariae**: hello , i get this number : 7652483it's a prime number and is a 7-digit pandigital :why the solution is 7652413 and not 7652483.my program...**mrb**: This program is not fast, but it shows a different method to check whether the numbers are premutations or not. I compare the sums of the powers of 2 ...**mrb**: This one runs in 0 ms. (in C)I took a different approach. First I derived the increment for each number, and I used that every hexagonal number is...**mrb**: Here is the code I implemented in C, where I use some very simple self made functions. It runs about 47 ms and can be executed easily for different po...**Larry C**: Interesting set of solutions and a fun set of four problems.I started out similar to you, but by the time I got to problems 116 and 117 I had evol...**jeras**: I originally implemented a solution in python similar to yours, but it took about 1.3 seconds. There is actually a much faster implementation based o...

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: