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 π

# Tag: Euler

## Project Euler and Lego Mindstorms

I used Lego Mindstorms EV3 Intelligent Brick and Mindstorms programming platform (powered byΒ National Instruments’ LabVIEW software)Β to solve Project Euler problem #1: Multiples of 3 and 5. And here’s the result:

## Project Euler Problem Update #6

Some more solutions.

- Problem 95: Amicable chains
- Problem 63: Powerful digit counts
- Problem 125: Palindromic sums
- Problem 145: How many reversible numbers are there below one-billion?
- Problem 41: Pandigital prime
- Problem 87: Prime power triples

Problem 87 was my 50th problem and I’m now at Level 2 at Project Euler.

In addition to advancing me to the next level, Problem 87 (or rather the gurus who’d solved it before me) reminded me of an important feature of Java Sets… They do not allow duplicates. Very important lesson indeed, since changing solution from List to Set made my solution execute almost 400 times faster π

## Project Euler Problem Update #5

More solutions.

- Problem 39: Integer right triangles
- Problem 53: Combinatoric selections
- Problem 55: Lychrel numbers
- Problem 92: Square digit chains
- Problem 120: Square reminders
- Problem 206: Concealed square
- Problem 214: Totient chains

I solved problem 214 using Python, others using Xtend. Most, if not all, my solutions are based on brute force and it really isn’t optimal way to solve them. It really makes me feel dumb when my solution takes an hour and others have solved the same problem in seconds… *shrug* π

## Project Euler Problem Update #4

More solutions.

- Problem 32: Pandigital products
- Problem 35: Circular primes
- Problem 37: Truncatable primes
- Problem 40: Champernowne’s constant
- Problem 56: Powerful digit sum
- Problem 69: Totient maximum
- Problem 104: Pandigital Fibonacci ends

I solved Problem 69 using Python instead of Xtend, because Python was better performing than Xtend.

## Project Euler Problem Update #3

Some more solutions

- Problem 17: Number letter counts
- Problem 19: Counting sundays
- Problem 22: Names scores
- Problem 23: Non-abundant sums
- Problem 29: Distinct powers
- Problem 30: Digit fifth powers
- Problem 36: Double-based palindromes

Problems get harder as their number gets bigger. The above problems were relatively easy but I have several in progress that I have a hard time finding the solution. Problem 221 for example π

## Project Euler Problem Update #2

More solutions

- Problem 12: Highly divisible triangular number
- Problem 21: Amicable numbers
- Problem 42: Coded triangle numbers
- Problem 45: Triangular, pentagonal, and hexagonal
- Problem 48: Self powers
- Problem 59: XOR decryption
- Problem 97: Large non-Mersenne prime

Try and err. Use brute force. Try and err. Think. Try and err. Think more and use brute force again. Try, try and try.

That’s the typical formula for solving problems π