So here is how we plan to do this.

1) We will post the problems from Project Eucler, starting from the easiest ones (ID 1, 2, etc)

We will work through each one, everyone is welcome to submit their code snippet in different languages or optimization/generalization of the previously submitted code.

2) Once a problem is thoroughly solved, we will move to the next set of problem or so.

3) You are encouraged to sign up on the Eucler page and solve problems at your own choice.

Here is the first problem

**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.

Problem 2

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, ...Find the sum of all the even-valued terms in the sequence which do not exceed four million.

Problem 3

Problem 3

The prime factors of 13195 are 5, 7, 13 and 29.

What is the largest prime factor of the number 600851475143 ?

Problem 4

Problem 4

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 9199.

Find the largest palindrome made from the product of two 3-digit numbers.

Problem 5

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