Problem definition: Euler Problem 1

Python version

print reduce(lambda x, y : x + y,
 filter(lambda x: x % 3 == 0 or x % 5 == 0,
 range(1, 1001)))

Erlang version

-module(p1).
-export([pr_sum/0]). %% print sum

pr_sum() –>
      L = lists:seq(1, 1000),
      L1 = [ X ||X <– L, (X rem 3) == 0 orelse (X rem 5) == 0],
      sum(L1). 

sum(L) –> sum(L, 0).
sum([], Acc) –> Acc;
sum([H|T], Acc) –> sum(T, Acc + H).