Skip to content

Instantly share code, notes, and snippets.

@dungpa

dungpa/primes1.fs

Created June 5, 2012 14:05
Show Gist options
  • Save dungpa/2875216 to your computer and use it in GitHub Desktop.
Save dungpa/2875216 to your computer and use it in GitHub Desktop.
Download ZIP
A sequence of prime under n
Raw
primes1.fs
let rec primesUnder = function
| n when n<=2 -> [||]
| 3 -> [|2|]
| n -> let ns = n |> float |> sqrt |> ceil |> int
let smallers = primesUnder ns
Array.append smallers (filterRange (indivisible smallers) (ns, n-1))
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment