This repository contains my personal solutions to the computational and mathematical problems from Project Euler.
These solutions are written in Python using Jupyter Notebooks, focusing on algorithmic efficiency, mathematical optimization, and clean code.
Project Euler is a series of challenging mathematical/computer programming problems that will require more than just mathematical insights to solve. Although mathematics will help you arrive at elegant and efficient methods, the use of a computer and programming skills will be required to solve most problems.
Each Jupyter Notebook contains the problem description, the thought process, and the Python code used to solve it. Files are named chronologically (e.g., Problem_001.ipynb).
| Problem | Title | Key Concepts Used | Language |
|---|---|---|---|
| 005 | Smallest multiple | Prime Factorization, LCM | Python |
| 006 | Sum square difference | Mathematical Formula, |
Python |
| 007 | 10001st prime | Sieve of Eratosthenes, Prime Numbers | Python |
| 011 | Largest product in a grid | 2D Arrays, Sliding Window | Python |
| ... | ... | ... | ... |
(Note: The table above is just an example format. I update it as I solve new problems.)
You can clone this repository and run the notebooks locally:
git clone https://github.com/Heperowt/Project_Euler.git
cd Project_Euler
jupyter notebook
If you are currently trying to solve these problems on your own, I highly recommend avoiding looking at the solutions here until you've given it a solid try. The real value of Project Euler is in the struggle and the learning process!