Notice
editThis is being written on Wikipedia. However when I get my own wiki up and running, this wiki will be transferred.
Introduction
editWelcome to this Project Euler sub-wiki. In these pages I hope to help you solve any Project Euler problems you may be stuck on. Please note that no answers will be given. Once you have solved a puzzle, you will be able to enter the answer into a text box to reveal the code I used. The methods I give may not be the most efficient way, but if they give you the correct answer, who cares?
What Is Project Euler
editProject Euler is a website located at projecteuler.net which contains over 200 maths problems of varying difficulty. The maths problems are constructed in a way where it is almost impossible to solve them without writing a computer program to solve it - You are actually encouraged to do this. Each question supposedly is solvable in one minute on a normal computer. However I have come across some where I was unable to achieve this goal.
What you can do
editOnce you have solved the problem, you will be able add your code to a code archive to show others what you have done.
About Me
editI personally have completed 66/227 problems at the time of writing (001-059, 063, 067, 074, 079, 080, 092, 097), and am currently solving problem 96. I write my programs in PHP. The only one I have solved using pen and paper is problem 009.
Problems
editProblem 001-010
editProblem 001 | Add all the natural numbers below one thousand that are multiples of 3 or 5. |
Problem 002 | Find the sum of all the even-valued terms in the Fibonacci sequence which do not exceed four million. |
Problem 003 | Find the largest prime factor of a composite number. |
Problem 004 | Find the largest palindrome made from the product of two 3-digit numbers. |
Problem 005 | What is the smallest number divisible by each of the numbers 1 to 20? |
Problem 006 | What is the difference between the sum of the squares and the square of the sums? |
Problem 007 | Find the 10001st prime. |
Problem 008 | Discover the largest product of five consecutive digits in the 1000-digit number. |
Problem 009 | Find the only Pythagorean triplet, {a, b, c}, for which a + b + c = 1000. |
Problem 010 | Calculate the sum of all the primes below two million. |
Problem 011-020
editNot Complete
Problem 021-030
editNot Complete
Problem 031-040
editNot Complete
Problem 041-050
editNot Complete
Problem 051-060
editNot Complete
Problem 061-070
editNot Complete
Problem 071-080
editNot Complete
Problem 081-090
editNot Complete
Problem 091-100
editNot Complete
Problem 101-110
editNot Complete
Problem 111-120
editNot Complete
Problem 121-130
editNot Complete
Problem 131-140
editNot Complete
Problem 141-150
editNot Complete
Problem 151-160
editNot Complete
Problem 161-170
editNot Complete
Problem 171-180
editNot Complete
Problem 181-190
editNot Complete
Problem 191-200
editNot Complete
Problem 201-210
editNot Complete
Problem 211-220
editNot Complete
Problem 221-227
editNot Complete