Euler#4

euler4.erl

is_palindrome([]) -> true;
is_palindrome([_|_=[]]) -> true;
is_palindrome(L) when is_integer(L) -> is_palindrome(erlang:integer_to_list(L));
is_palindrome(L) -> L == lists:reverse(L).

product_palindrome(A) -> [A * B || B <- lists:seq(A + 1, 999)].

problem4() ->
	L = [product_palindrome(A)  || A <- lists:seq(100, 998)],
	L1 = lists:filter(fun(I) -> is_palindrome(I) end, lists:flatten(L)),
	io:format("~p", [lists:last(lists:sort(L1))]).