User:ProjectEuler
Jump to navigation
Jump to search
- This article is not detailed enough and needs to be expanded. Please help us by adding some more information.
- For the esolang named Project Euler, see Project Euler (language)
Project Euler stores a set of mathematical or computational problems that may be easy or hard. There are currently 846 problems from Project Euler, where the last problem was solved by 172 people as of September 25, 07:16:42 UTC+0.
Problems overview
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 |
List of problems
ID | title | keywords |
---|---|---|
1 | Multiples of 3 and 5 | FizzBuzz |
2 | Even Fibonacci numbers | Fibonacci |
3 | Largest prime factor | Factorization, big constant |
4 | Largest palindrome product | Palindrome^{[citation needed]} |
5 | Smallest multiple | |
6 | Sum square difference | |
7 | 10001st prime | |
8 | Largest product in a series | searching |
9 | Special Pythagorean triplet | Pythagorean triplet |
10 | Summation of primes | |
11 | Largest product in a grid | |
12 | Highly divisible | Factorization |
13 | Large sum | |
14 | Longest Collatz sequence | |
15 | Lattice paths | Pascal's triangle |
16 | Power digit sum | digit sum |
17 | Number letter counts | English |
18 | Maximum path sum I | dynamic programming |
19 | Counting Sundays | calendar |
20 | Factorial digit sum | digit sum |
21 | Amicable numbers | |
22 | Names scores | sorting |
23 | Non-abundant sums | |
24 | Lexicographic permutations | |
25 | 1000-digit Fibonacci number | Fibonacci |
26 | Reciprocal cycles | Fermat pseudo-prime^{[citation needed]} |
27 | Quadratic primes | negative output |
28 | Number spiral diagonals | number spiral |