Project Euler

Project Euler gathers math and computing problems which often require quite some time and thought. I have studied problems from this website for years now – quite irregularly I admit. I solved my first problem in 2016, as an undergraduate student. Since then, I solved 112 problems. In 2020, I ranked among the top 1% of the website members (only counting those that solved at least one problem).

Working on these problems is a similar experience to actual signal processing research. Many problems are posed in a way that does not indicate which tools to use. A great part of the job then lies in reframing the question and identifying the math field that can address it.

Many problems involve, among other fields, number theory, probability theory, geometry, dynamic programming, or optimization. As a doctor in signal processing, I particularly enjoy problems involving probability theory, geometry and physics.

Here are 3 selected problems:

• The problem I solved and enjoyed most: Problem 202: Laserbeam (difficulty: 60%)
• The hardest problem I solved (according to the website difficulty ranking): Problem 339: Peredur Fab Efrawg (difficulty: 70%)
• The problem I did not solve yet and enjoyed most: Problem 252: Convex Holes (difficulty: 60%)

and some of my favorite solved problems:

• Problems 81, 82 and 83: shortest path problems with different constraints (respective difficulties: 10%, 20% and 25%)
• Problem 84: Monopoly Odds (difficulty: 35%)
• Problem 144: Investigating multiple reflections of a laser beam (difficulty: 50%)
• Problem 267: Billionaire (difficulty: 50%)
• Problem 286: Scoring Probabilities (difficulty: 50%)
• Problem 317: Firecracker (difficulty: 35%)
• Problem 607: Marsh Crossing (difficulty: 20%)
• Problem 610: Roman Numerals II (difficulty: 35%)