It’s been a while since I solved any Project Euler problems and shame on me. Solving them is one of the good things in life, even if my solutions are generally brute force 🙂
It’s worth mentioning that I used NetRexx for the first time in my life to solve Problem 99. I’ve used Xtend in most other solutions, but Project Euler is good excuse to use other languages as well, for example Python and LEGO MindStorms that I used to solve Problem 1 the second time.
- Problem 11: Largest product in a grid
- Problem 112: Bouncy numbers
- Problem 47: Distinct primes factors
- Problem 1: Multiples of 3 and 5 (LEGO MindStorms)
- Problem 99: Largest exponential (NetRexx)
- Problem 74: Digit factorial chains
- Problem 34: Digit factorials
- Problem 70: Totient permutation (Python)
- Problem 49: Prime permutations
- Problem 15: Lattice paths (NetRexx)
- Problem 52: Permutated multiples
- Problem 123: Prime square remainders (Python)
It’s also worth mentioning that Leonhard Euler is one of the greatest mathematicians and former Soviet Union honored him with a stamp, as is shown as this posts featured image. Others have honored him in paintings and yet others have honored him with a banknote.