Yet another Project Euler problem, solved with rather brute force. I simply became too business process oriented to develop clever solutions to mathematical problems, maybe? =)

The Problem

Finding the largest palindrome made from the product of two 3-digit numbers.

The Solution

Sorry for the lack of elegance. The most interesting thing to learn while coding this was finding out that parseInt([x,y,z,z,y,x].join(“”)) was much faster than (x100001) + (y10010) + (z*1100) in JavaScript. Hmm.

Edit: It probaby was a weird issue that I had. parseInt trick doesn’t work anymore.

I wanted to share my boring solution to Problem 3 on Project Euler.

The Problem

What is the largest prime factor of the number 600851475143?

Solution

That should do it. There could be some room to improve, however.

So, here we go

I’d like to gather my thoughts about JavaScript and other technologies around web development, here. Hope it all goes well and I can wrap my head around this Jekyll stuff