Category Archives: Project Euler

Code solutions I have come to for ProjectEuler.net problems.

Projecteuler.net – Problem 1 – Java solution

http://projecteuler.net/problem=1 If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.Find the sum of all the multiples of 3 or … Continue reading

Posted in Java, Project Euler | Leave a comment

Projecteuler.net – Problem 11 – Python 3 solution

http://projecteuler.net/problem=11 In the 2020 grid below, four numbers along a diagonal line have been marked in red. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 … 32 98 … Continue reading

Posted in Project Euler, Python | Leave a comment

Projecteuler.net – Problem 10 – C solution

http://projecteuler.net/problem=10 The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million.

Posted in C, Project Euler | Leave a comment

Projecteuler.net – Problem 10 – Python 3 solution

http://projecteuler.net/problem=10 The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million.

Posted in Project Euler, Python | Leave a comment

Projecteuler.net – Problem 9 – C solution

http://projecteuler.net/problem=9 A Pythagorean triplet is a set of three natural numbers, a b c, for which, a2 + b2 = c2 For example, 32 + 42 = 9 + 16 = 25 = 52. There exists exactly one Pythagorean triplet for which a + b … Continue reading

Posted in C, Project Euler | Leave a comment

Projecteuler.net – Problem 9 – Python 3 solution

http://projecteuler.net/problem=9 A Pythagorean triplet is a set of three natural numbers, abc, for which, a2 + b2 = c2 For example, 32 + 42 = 9 + 16 = 25 = 52. There exists exactly one Pythagorean triplet for which a + b + c = … Continue reading

Posted in Project Euler, Python | Leave a comment

Projecteuler.net – Problem 8 – C solution

http://projecteuler.net/problem=8 Find the greatest product of five consecutive digits in the 1000-digit number. 731671765313 … … 0420752963450

Posted in C, Project Euler | Leave a comment

Projecteuler.net – Problem 8 – Python 3 solution

http://projecteuler.net/problem=8 Find the greatest product of five consecutive digits in the 1000-digit number. 731671765313 … … 0420752963450

Posted in Project Euler, Python | Leave a comment

Projecteuler.net – Problem 7 – C solution

http://projecteuler.net/problem=7 By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10001st prime number?

Posted in C, Project Euler | Leave a comment

Projecteuler.net – Problem 7 – Python 3 solution

http://projecteuler.net/problem=7 By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10001st prime number?

Posted in Project Euler, Python | Leave a comment