Project Euler, Problem 4, in Erlang
Problem 4 is an interesting one. “A palindromic number reads the same both ways. Find the largest palindrome made from the product of two 3-digit numbers.”
I thought about this for a few minutes and decided the best way to approach it would be to build candidate palindromic numbers and and then test them to [...]
