This repository contains my solutions to Project Euler problems - a series of challenging mathematical and computer programming problems that require mathematical insight and programming skills to solve.
| Problem | Title | Solution | Difficulty |
|---|---|---|---|
| 1 | Multiples of 3 or 5 | problem=1.py | ⭐ |
| 2 | Even Fibonacci Numbers | problem=2.py | ⭐ |
| 3 | Largest Prime Factor | problem=3.py | ⭐ |
| 4 | Largest Palindrome Product | problem=4.py | ⭐ |
| 5 | Smallest Multiple | problem=5.py | ⭐ |
| 6 | Sum Square Difference | problem=6.py | ⭐ |
| 7 | 10001st Prime | problem=7.py | ⭐ |
| 8 | Largest Product in a Series | problem=8.py | ⭐ |
| 9 | Special Pythagorean Triplet | problem=9.py | ⭐ |
| 10 | Summation of Primes | problem=10.py | ⭐ |
| 11 | Largest Product in a Grid | problem=11.py | ⭐ |
| 12 | Highly Divisible Triangular Number | problem=12.py | ⭐ |
| 13 | Large Sum | problem=13.py | ⭐ |
| 14 | Longest Collatz Sequence | problem=14.py | ⭐ |
| 15 | Lattice Paths | problem=15.py | ⭐ |
| 16 | Power Digit Sum | problem=16.py | ⭐ |
| 17 | Number Letter Counts | problem=17.py | ⭐ |
| 18 | Maximum Path Sum I | problem=18.py | ⭐ |
| 19 | Counting Sundays | problem=19.py | ⭐ |
| 20 | Factorial Digit Sum | problem=20.py | ⭐ |
| 21 | Amicable Numbers | problem=21.py | ⭐ |
| 22 | Names Scores | problem=22.py | ⭐ |
| 23 | Non-Abundant Sums | problem=23.py | ⭐ |
| 24 | Lexicographic Permutations | problem=24.py | ⭐ |
| 25 | 1000-digit Fibonacci Number | problem=25.py | ⭐ |
| 26 | Reciprocal Cycles | problem=26.py | ⭐ |
| 27 | Quadratic Primes | problem=27.py | ⭐ |
| 28 | Number Spiral Diagonals | problem=28.py | ⭐ |
| 29 | Distinct Powers | problem=29.py | ⭐ |
| 30 | Digit Fifth Powers | problem=30.py | ⭐ |
| 31 | Coin Sums | problem=31.py | ⭐ |
| 32 | Pandigital Products | problem=32.py | ⭐ |
| 33 | Digit Cancelling Fractions | problem=33.py | ⭐ |
| 34 | Digit Factorials | problem=34.py | ⭐ |
| 35 | Circular Primes | problem=35.py | ⭐ |
| 36 | Double-base Palindromes | problem=36.py | ⭐ |
| 37 | Truncatable Primes | problem=37.py | ⭐ |
| 38 | Pandigital Multiples | problem=38.py | ⭐ |
| 39 | Integer Right Triangles | problem=39.py | ⭐ |
| 40 | Champernowne's Constant | problem=40.py | ⭐ |
| 41 | Pandigital Prime | problem=41.py | ⭐ |
| 42 | Coded Triangle Numbers | problem=42.py | ⭐ |
| 43 | Sub-string Divisibility | problem=43.py | ⭐ |
| 44 | Pentagon Numbers | problem=44.py | ⭐ |
| 45 | Triangular, Pentagonal, and Hexagonal | problem=45.py | ⭐ |
| 46 | Goldbach's Other Conjecture | problem=46.py | ⭐ |
| 47 | Distinct Primes Factors | problem=47.py | ⭐ |
| 48 | Self Powers | problem=48.py | ⭐ |
| 49 | Prime Permutations | problem=49.py | ⭐ |
| 50 | Consecutive Prime Sum | problem=50.py | ⭐ |
Each solution is a standalone Python script that can be executed directly:
python problem=1.pyAll solutions include:
- Clean, readable code with comments
- Direct implementation of the algorithm
- Output that displays the answer with context
- Language: Python 3
- Approach: Mathematical algorithms and computational problem-solving
Each solution file follows a consistent pattern:
- Problem title and URL in comments
- Main function(s) implementing the solution logic
if __name__ == "__main__"block with execution code- Formatted output showing the result
- Solve Project Euler problems using efficient algorithms
- Write clean, understandable Python code
- Improve mathematical and computational problem-solving skills
As per Project Euler's philosophy, these solutions are shared for educational purposes. I encourage you to attempt the problems yourself before looking at solutions!
Progress: 50 problems solved and counting! 🎉