Project Euler Problem Four
Find the largest palindrome made from the product of two 3-digit numbers. This is problem four of project euler, and this one actually caused me some problems. The reason was that I wrongly assumed that a number with the largest divisor would also would be the largest number. But of course this is not necessarily the case.
As the previous three problems I have posted about, this is written to run on node.js.
Latest Comments