Skip to content

Instantly share code, notes, and snippets.

@rayyildiz

rayyildiz/ProjectEuler4.hs

Created September 5, 2016 07:16
Show Gist options
  • Save rayyildiz/e4f8e671832b49b93ee139807d274dc6 to your computer and use it in GitHub Desktop.
Save rayyildiz/e4f8e671832b49b93ee139807d274dc6 to your computer and use it in GitHub Desktop.
Download ZIP
Largest palindrome product (Project Euler Question 4)
Raw
ProjectEuler4.hs
palindromicNumbers = [x*y | x<-[1..999], y<- [1..999], reverse(show(x*y))==show(x*y)]
@rayyildiz
Copy link
Author

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.

Find the largest palindrome made from the product of two 3-digit numbers.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment