Project Euler : problem 001

[Franck]

Problem 1 : Find the sum of all the multiples of 3 or 5 below 1000.

Code: Select all

 
: pe001(n) -- n1 :  Returns sum of all multiples of 3 or 5 below n
| i |
   0 n 1- loop: i [ i 3 mod i 5 mod and ifFalse: [ i + ] ] ;