Project Euler

The Euler exercises implemented in Python.

Project Euler is:

series of challenging mathematical/computer programming problems that will require more than just mathematical insights to solve. Although mathematics will help you arrive at elegant and efficient methods, the use of a computer and programming skills will be required to solve most problems. The motivation [...] is to provide a platform for the inquiring mind to delve into unfamiliar areas and learn new concepts in a fun and recreational

While Euler is in some senses more about maths than computation, it's a neat exercises for practicing programming and learning more about your favourite programming language. This section of the site is a record of my solutions for the Euler problems. Problems will probably have more than one solution, and be added to and modified as time passes.

001 - find the sum of all multiples: Find the sum of all the multiples of 3 or 5 below 1000.
002 - find the sum of the fibonacci sequence: Find the sum of all the even-valued terms in the Fibonacci sequence which do not exceed one million.
003 - prime factors: Find the largest prime factor of 317584931803.
004 - palindromic numbers: Find the largest palindrome made from the product of two 3-digit numbers.
005 - evenly divisible: What is the smallest number that is evenly divisible by all of the numbers from 1 to 20?
006 - sum of squares less square of sums: Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.
007 - 10001st prime: What is the 10001st prime number?
008 - paths across grid: Find the greatest product of five consecutive digits in a 1000-digit number.
009 - Pythagorean triplets: Find the Pythagorean triplet (a62 + b^2 = c^2) for which a + b + c = 1000.
010 - sum of primes: Find the sum of all the primes below one million.
015 - paths across grid: How many routes are there through a 20x20 grid?
016 - sum a power of 2: What is the sum of the digits of the number 2^1000?
017 - sum a power of 2: If all the numbers from 1 to 1000 (one thousand) inclusive were written out in words, how many letters would be used?
020 - sum factorial digits: Find the sum of the digits in the number 100!
035 - counting circular primes: How many circular primes (primes that when rotated are still primes) are there below one million?
112 - counting bouncy numbers: Find the point at which the proportion of bouncy numbers is 99%.

Personal tools

Project Euler

Document Actions

Visitors

Ads

Sections