Solutions for Project Euler Problems, see https://projecteuler.net/problems
| # | Name | Seconds | ||
|---|---|---|---|---|
| 1 | Multiples of 3 and 5 | 0.0 | Problem | Solution |
| 2 | Even Fibonacci numbers | 0.0 | Problem | Solution |
| 3 | Largest prime factor | 0.9 | Problem | Solution |
| 4 | Largest palindrome product | 0.1 | Problem | Solution |
| 5 | Smallest multiple | 2.5 | Problem | Solution |
| 6 | Sum square difference | 0.0 | Problem | Solution |
| 7 | 10001st prime | 0.1 | Problem | Solution |
| 8 | Largest product in a series | 0.0 | Problem | Solution |
| 9 | Special Pythagorean triplet | 0.1 | Problem | Solution |
| 10 | Summation of primes | 3.5 | Problem | Solution |
| 11 | Largest product in a grid | 0.0 | Problem | Solution |
| 12 | Highly divisible triangular number | 5.3 | Problem | Solution |
| 13 | Large sum | 0.0 | Problem | Solution |
| 14 | Longest Collatz sequence | 1.6 | Problem | Solution |
| 15 | Lattice paths | 0.0 | Problem | Solution |
| 16 | Power digit sum | 0.0 | Problem | Solution |
| 17 | Number letter counts | 0.0 | Problem | Solution |
| 18 | Maximum path sum I | 0.0 | Problem | Solution |
| 19 | Counting Sundays | 0.0 | Problem | Solution |
| 20 | Factorial digit sum | 0.0 | Problem | Solution |
| 21 | Amicable numbers | 2.6 | Problem | Solution |
| 22 | Names scores | 0.0 | Problem | Solution |
| 23 | Non-abundant sums | 14.8 | Problem | Solution |
| 24 | Lexicographic permutations | 6.6 | Problem | Solution |
| 25 | 1000-digit Fibonacci number | 0.0 | Problem | Solution |
| 26 | Reciprocal cycles | 11.9 | Problem | Solution |
| 27 | Quadratic primes | 5.5 | Problem | Solution |
| 28 | Number spiral diagonals | 0.3 | Problem | Solution |
| 29 | Distinct powers | 0.0 | Problem | Solution |
| 30 | Digit fifth powers | 2.5 | Problem | Solution |
| 31 | Coin sums | 0.0 | Problem | Solution |
| 32 | Pandigital products | 7.9 | Problem | Solution |
| 33 | Digit cancelling fractions | 0.0 | Problem | Solution |
| 34 | Digit factorials | 0.5 | Problem | Solution |
| 35 | Circular primes | 3.0 | Problem | Solution |
| 36 | Double-base palindromes | 0.8 | Problem | Solution |
| 37 | Truncatable primes | 1.3 | Problem | Solution |
| 38 | Pandigital multiples | 0.1 | Problem | Solution |
| 39 | Integer right triangles | 16.2 | Problem | Solution |
| 40 | Champernowne's constant | 0.4 | Problem | Solution |
| 41 | Pandigital prime | 28.2 | Problem | Solution |
| 42 | Coded triangle numbers | 0.0 | Problem | Solution |
| 43 | Sub-string divisibility | 20.5 | Problem | Solution |
| 44 | Pentagon numbers | 0.3 | Problem | Solution |
| 45 | Triangular, pentagonal, and hexagonal | 0.0 | Problem | Solution |
| 46 | Goldbach's other conjecture | 0.5 | Problem | Solution |
| 47 | Distinct primes factors | 96.5 | Problem | Solution |
| 48 | Self powers | 0.0 | Problem | Solution |
| 49 | Prime permutations | 0.0 | Problem | Solution |
| 50 | Consecutive prime sum | 2.3 | Problem | Solution |
| 51 | Prime digit replacements | 5.1 | Problem | Solution |
| 52 | Permuted multiples | 0.1 | Problem | Solution |
| 53 | Combinatoric selections | 0.1 | Problem | Solution |
| 54 | Poker hands | 0.2 | Problem | Solution |
| 55 | Lychrel numbers | 0.1 | Problem | Solution |
| 56 | Powerful digit sum | 0.4 | Problem | Solution |
| 57 | Square root convergents | 0.8 | Problem | Solution |
| 58 | Spiral primes | 11.8 | Problem | Solution |
| 59 | XOR decryption | 8.0 | Problem | Solution |
| 60 | Prime pair sets | 75.4 | Problem | Solution |
| 61 | Cyclical figurate numbers | 2.1 | Problem | Solution |
| 62 | Cubic permutations | Problem | ||
| 63 | Powerful digit counts | Problem | ||
| 64 | Odd period square roots | Problem | ||
| 65 | Convergents of e | Problem | ||
| 66 | Diophantine equation | Problem | ||
| 67 | Maximum path sum II | 0.1 | Problem | Solution |
| 68 | Magic 5-gon ring | Problem | ||
| 69 | Totient maximum | Problem | ||
| 70 | Totient permutation | Problem | ||
| 71 | Ordered fractions | Problem | ||
| 72 | Counting fractions | Problem | ||
| 73 | Counting fractions in a range | Problem | ||
| 74 | Digit factorial chains | Problem | ||
| 75 | Singular integer right triangles | Problem | ||
| 76 | Counting summations | Problem | ||
| 77 | Prime summations | Problem | ||
| 78 | Coin partitions | Problem | ||
| 79 | Passcode derivation | Problem | ||
| 80 | Square root digital expansion | Problem | ||
| 81 | Path sum: two ways | Problem | Solution | |
| 82 | Path sum: three ways | Problem | ||
| 83 | Path sum: four ways | Problem | ||
| 84 | Monopoly odds | Problem | ||
| 85 | Counting rectangles | Problem | ||
| 86 | Cuboid route | Problem | ||
| 87 | Prime power triples | Problem | ||
| 88 | Product-sum numbers | Problem | ||
| 89 | Roman numerals | 0.0 | Problem | Solution |
| 90 | Cube digit pairs | Problem | ||
| 91 | Right triangles with integer coordinates | Problem | ||
| 92 | Square digit chains | 51.5 | Problem | Solution |
| 93 | Arithmetic expressions | Problem | ||
| 94 | Almost equilateral triangles | Problem | ||
| 95 | Amicable chains | Problem | ||
| 96 | Su Doku | Problem | ||
| 97 | Large non-Mersenne prime | Problem | ||
| 98 | Anagramic squares | Problem | ||
| 99 | Largest exponential | Problem | ||
| 100 | Arranged probability | Problem |
Overall time: 392.5 seconds. Generation time: 395.8 seconds.