Skip to content

Instantly share code, notes, and snippets.

@ShahOdin

ShahOdin/biggestPrimes.clj

Created November 30, 2019 23:58
Show Gist options
  • Save ShahOdin/35a37e001f3ecc9f988dacb5bae8360f to your computer and use it in GitHub Desktop.
Save ShahOdin/35a37e001f3ecc9f988dacb5bae8360f to your computer and use it in GitHub Desktop.
Download ZIP
clojure attempt
Raw
biggestPrimes.clj
(defn is_divisible [n m] (= (mod n m) 0))
(defn is_prime[n]
(every?
#(not (is_divisible n %))
(range 2 (- n 1))))
(take-last 3 (filter is_prime (range 1 20)))
@ShahOdin
Copy link
Author

ShahOdin commented Dec 1, 2019 •
edited
Loading

Scala equivalent:

def isDivisible(n: Int, m: Int): Boolean = (n % m) == 0

def isPrime(n: Int): Boolean = Range(2, n-1).forall(!isDivisible)

Range(1, 20).filter(isPrime).takeRight(3)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment