Introduction

Here are my notes for techniques for solving Project Euler problems. It is a continuous work in progress. I tend to update this when there is a technique that applies to more than one problem. I keep a list of candidate topics that I might write about in the future here:

• Seiving
• Modular arithmetic
• Dynamic Programming
• Lucy’s Algorithm
• Diophantine equations
• closed form solutions
• summing multiplicative functions
• groups, adjuncts, etc