This repository contains all the solutions from the book Project Euler: The First 100 Problems Solved with Python by Miguel Casañas. Each solution is implemented in Python, accompanied by a brief explanation to enhance understanding.
You can download the book here.
- Language: Python
- Problems: Project Euler, problems 1–100
- Purpose: Educational resource and reference for solving mathematical and algorithmic problems
- Multiples of 3 or 5
- Even Fibonacci Numbers
- Largest Prime Factor
- Largest Palindrome Product
- Smallest Multiple
- Sum Square Difference
- 10001st Prime
- Largest Product in a Series
- Special Pythagorean Triplet
- Summation of Primes
- Largest Product in a Grid
- Highly Divisible Triangular Number
- Large Sum
- Longest Collatz Sequence
- Lattice Paths
- Power Digit Sum
- Number Letter Counts
- Maximum Path Sum I
- Counting Sundays
- Factorial Digit Sum
- Amicable Numbers
- Names Scores
- Non-Abundant Sums
- Lexicographic Permutations
- 1000-digit Fibonacci Number
- Reciprocal Cycles
- Quadratic Primes
- Number Spiral Diagonals
- Distinct Powers
- Digit Fifth Powers
- Coin Sums
- Pandigital Products
- Digit Cancelling Fractions
- Digit Factorials
- Circular Primes
- Double-base Palindromes
- Truncatable Primes
- Pandigital Multiples
- Integer Right Triangles
- Champernowne's Constant
- Pandigital Prime
- Coded Triangle Numbers
- Sub-string Divisibility
- Pentagon Numbers
- Triangular, Pentagonal, and Hexagonal
- Goldbach's Other Conjecture
- Distinct Primes Factors
- Self Powers
- Prime Permutations
- Consecutive Prime Sum
- Prime Digit Replacements
- Permuted Multiples
- Combinatoric Selections
- Poker Hands
- Lychrel Numbers
- Powerful Digit Sum
- Square Root Convergents
- Spiral Primes
- XOR Decryption
- Prime Pair Sets
- Cyclical Figurate Numbers
- Cubic Permutations
- Powerful Digit Counts
- Odd Period Square Roots
- Convergents of
$e$ - Diophantine Equation
- Maximum Path Sum II
- Magic 5-gon Ring
- Totient Maximum
- Totient Permutation
- Ordered Fractions
- Counting Fractions
- Counting Fractions in a Range
- Digit Factorial Chains
- Singular Integer Right Triangles
- Counting Summations
- Prime Summations
- Coin Partitions
- Passcode Derivation
- Square Root Digital Expansion
- Path Sum: Two Ways
- Path Sum: Three Ways
- Path Sum: Four Ways
- Monopoly Odds
- Counting Rectangles
- Cuboid Route
- Prime Power Triples
- Product-sum Numbers
- Roman Numerals
- Cube Digit Pairs
- Right Triangles with Integer Coordinates
- Square Digit Chains
- Arithmetic Expressions
- Almost Equilateral Triangles
- Amicable Chains
- Su Doku
- Large Non-Mersenne Prime
- Anagramic Squares
- Largest Exponential
- Arranged Probability