Archive for the Project Euler Category

Project Euler – Problem 6 – Sum square difference

Problem 6:  The sum of the squares of the first ten natural numbers is, 12 + 22 + … + 102 = 385 The square of the sum of the first ten natural numbers is, (1 + 2 + … + 10)2 = 552 = 3025 Hence […]

Read more

Project Euler Problem 5 – Smallest Multiple

Problem 5: 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 positive number that is evenly divisible by all of the numbers from 1 to 20?

Read more

Project Euler Problem 4 – Largest Palindrome Product

Problem 4: A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. Find the largest palindrome made from the product of two 3-digit numbers.

Read more

Project Euler – Problem 3 – Largest Prime Factor

Problem 3: The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ?

Read more

Project Euler – Problem 2 – Even Fibonacci Numbers

Problem 2:  Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … By considering the terms in the Fibonacci […]

Read more

Project Euler – Problem 1 – Multiples of 3 and 5

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 5 below 1000. Haskell Solutions […]

Read more