Python Solutions for Project Euler Problems

This repository contains Python solutions to a variety of Project Euler problems. Each script addresses a specific problem, implementing algorithms to compute mathematical results efficiently.

Features

• Solutions to multiple Project Euler problems in Python
• Clear, straightforward implementations focusing on algorithmic correctness
• Includes problems involving palindromes, Fibonacci sequences, prime factorization, and multiples

Tech Stack

• Python 3

Getting Started

Prerequisites

• Python 3.x installed on your system

Installation

Clone the repository:

git clone https://github.com/justin-napolitano/ProjectEuler.git
cd ProjectEuler

Running Solutions

Navigate to the euler_python_solutions directory and run the desired problem script with Python:

cd euler_python_solutions
python Problem1.py
python Problem4.py
# etc.

Project Structure

ProjectEuler/
├── README.md                  # This file
└── euler_python_solutions/    # Directory containing Python solution scripts
    ├── Problem1.py            # Sum of multiples problem
    ├── Problem2.py            # Fibonacci even terms sum (incomplete)
    ├── problem2.1.py          # Fibonacci with even terms sum
    ├── Problem2.2.py          # Fibonacci series generation and sum of evens
    ├── Problem3.py            # Largest prime factor
    ├── Proboem3.py            # Duplicate of Problem3.py with typo in filename
    └── Problem4.py            # Largest palindrome product

Future Work / Roadmap

• Complete and refactor incomplete or erroneous scripts (e.g., Problem2.py and Proboem3.py)
• Add more Project Euler problem solutions
• Improve code documentation and comments
• Add automated tests for correctness verification
• Modularize code for reuse and clarity
• Consider performance optimizations for large inputs