My solutions to different Project Euler problems.
The directory structures is as follows:
Problem #/ - top level files containing everything pertaining to a single project.
Problem #/language - a folder named after the language the preceding source is in. (java, c++, etc.)
Problem #/language/README.md - a file containing specific notes for that implementation.
| Problem # | Description | Java | C++ | Javascript | PHP | Perl |
|---|---|---|---|---|---|---|
| 1 | Add all natural numbers below one thousand that are multiples of 3 or 5. | Yes | No | No | No | No |
| 2 | By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms. | Yes | No | No | No | No |
| 3 | Find the largest prime factor of a composite number. | Yes | No | No | No | No |
| 4 | Find the largest palindrome made from the product of two 3-digit numbers. | Yes | No | No | No | No |
| 5 | What is the smallest number divisible by each of the numbers 1 to 20? | Yes | No | No | No | No |
| 6 | What is the difference between the sum of the squares and the square of the sums? | Yes | No | No | No | No |
| 7 | Find the 10001st prime. | Yes | No | No | No | No |
| 8 | Discover the largest product of five consecutive digits in the 1000-digit number. | Yes | No | No | No | No |
| 9 | Find the only Pythagorean triplet, {a, b, c}, for which a + b + c = 1000. | Yes | No | No | No | No |
| 10 | Calculate the sum of all the primes below two million. | Yes | No | No | No | No |