The Problem
What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
The Solution
I know this can be calculated very easily with pen and paper but overcomplicating stuff is just fun, I guess =)
What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
I know this can be calculated very easily with pen and paper but overcomplicating stuff is just fun, I guess =)
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? =)
Finding the largest palindrome made from the product of two 3-digit numbers.
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.
What is the largest prime factor of the number 600851475143?
That should do it. There could be some room to improve, however.
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