Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
project euler 4, haskell
--http://www.haskell.org/haskellwiki/Euler_problems/1_to_10 --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. problem_4 = maximum [x | y<-[100..999], z<-[y..999], let x=y*z, let s=show x, s==reverse s] main = print $ problem_4
run
|
edit
|
history
|
help
0
ad-hoc braille dot rendering
project euler 9, haskell
divisibleBy a b
Haskell Prime Factorizer
(Int,Int) -> Bool plot
Eerste programma
credit card number validator
Modular arithmetic with propagating type-checked modulus
Anonymous recursion. Why doesnt compile?
Exercise