Skip to content

Instantly share code, notes, and snippets.

Keybase proof

I hereby claim:

  • I am nditada on github.
  • I am ndt (https://keybase.io/ndt) on keybase.
  • I have a public key ASC1-uvxcq7p_-VgTgqsOTbeU8xBsJhY3atMFMSvpPAJNAo

To claim this, I am signing this object:

@nditada
nditada / gist:4076434
Created November 15, 2012 03:16
Project Euler problem 1 (http://projecteuler.net/problem=1)
(defn euler1
"Find the sum of all the multiples of 3 or 5 below 1000."
{}
[number]
(if (= number 0)
0
(if (or
(= 0 (mod number 3))
(= 0 (mod number 5))
)