Continuing our combined node.js and project euler posts. We got to problem five, which asks us “What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?”. First of all we only check numbers below or equal to 20! because we know for sure that this number [...]
Continuing my posts about Project Euler Problems, this time with problem three, which asks us to find the “the largest prime factor of the number 600851475143″. This time I have decided to explain the code a bit more, through comments – since this problem is a bit more tricky than the previous two problems. Once [...]
Yesterday I posted my first euler-code. This time we will take a look at problem two, again with the help of some javascript running on node.js. The problem is “Find the sum of all the even-valued terms in the [fibonacci] sequence which do not exceed four million.” My take on the solution was to run [...]
A long time ago I decided to do a couple of posts about project euler. I find the problems to be great excersize. It was not before I began to look into node.js though, that I began writing code for the problems for the purpose of publishing it. The first problem on the list is [...]
Latest Comments