Select Page

Project Euler 1: Multiples of 3 and 5 – SOLVED

Project Euler 1 Problem Statement 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 5 below 1000. Solution Obvious solution This can be...

Project Euler 5: Smallest multiple – SOLVED

Project Euler 5 Problem Statement 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smallest number that is evenly divisible by all of the numbers from 1 to 20? Solution Euclid’s algorithm The...

Project Euler 7: 10001st prime – SOLVED

Project Euler 7 Problem Statement 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? Solution This solution will solve both this problem and the HackerRank version of Project Euler 7....

Project Euler 10: Summation of primes – SOLVED

Project Euler 10 Problem Statement The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million. Solution Using our prime number sieve introduced in problem 7 this is easy to solve in less than 100ms with a couple lines of...

Project Euler 11: Largest product in a grid – SOLVED

Project Euler 11 Problem Statement Project Euler 11: In the 20×20 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 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00 81 49 31...