Project Euler Problem Three

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 again, you will need node.js to run the code.

Related Posts

20 Feb 2012
Quick Local Branch Removal Script
A couple of weeks ago I wrote a post about a bash script I used to clean up remote branches. I have just created its brother (and have plans to combine them to one script at one point). In both scripts I...read post »»
07 Feb 2012
How to do a Regular Expression Search Replace with Case Shifting In TextMate
Recently I had to clone a lot of repositories from BitBucket into a FLOW3 installation. But since FLOW3 expects that packages are named with camelcase, and bitbucket insists on saving all names as lowercase, I need to set the name of the...read post »»
26 Jan 2012
JavaScript Module with Global Scope Removal
Even though I regularly rant about not including jQuery as a default, without ensuring that you actually need it, I have done so myself. However I have done it in a special way (at the time of writing, this is only a...read post »»