Below you will find pages that utilize the taxonomy term “project-euler”
Writings
project euler problem 4 in clojure
I solved a few of the problems on Project Euler in the past, both in Java and Ruby, and thought it would be useful to redo them in Clojure, thus improving my skills on the language’s core functions and libraries. Today I’ll share problem 4.
Go ahead and read it but here’s the meat of it:
“Find the largest palindrome made from the product of two 3-digit numbers."
From this statement we can tell two things: (1) we’ll need a function that can tell whether a number is a palindrome or not and (2) that the largest palindrome is given by the product of two numbers between 100 and 999, inclusive.