{"request":{"endpoint":"https://exercism.org/api/v2/tracks/fsharp/exercises/nth-prime/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"9c33111ef072423395b14cb813535182","snippet":"module NthPrime let isDividedBy n1 n2 = n1 % n2 = 0 let isPrimeNumber n = let rec loop n1 n2 = if n1 = n2 then true else if isDividedBy n1 n2 then false else loop n1 (n2 + 1) ","num_views":0,"num_stars":0,"num_comments":1,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"AlexisGoument"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/AlexisGoument","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"5d576006788e4fe8a6c89ff0db94d8de","snippet":"module NthPrime let prime nth : int option = let sieve = let rec loop n = seq { yield n + 1 yield n + 5 yield! loop (n + 6) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":39,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-08-03T00:07:24.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"talkingaboutcode"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/talkingaboutcode","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"71e0d9e9d2cc4ec793f9a3deb704c821","snippet":"module NthPrime let prime (nth:int) : int option = let isPrime = function | x when x < 2 -> false | 2 -> true | num -> { 2 .. num - 1} |> Seq.forall (fun x -> num % x <> 0) Seq.initInfinite (fun x -> x + 1) |> Seq.filter isPrime ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-09-16T08:33:17.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"Marcin918"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/Marcin918","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"195f3b7f2e284d5d9077a6116a52f669","snippet":"module NthPrime let SIZE = 500 let primesA: int [] = Array.zeroCreate SIZE let initPrimes = Array.set primesA 0 2 Array.set primesA 1 3 let mutable n = 3 let mutable i = 1 while i+1 float |> sqrt |> int let foundPrimes' = if foundPrimes |> List.filter (fun p -> p <= maxFactor) |> List.exists (fun p -> curr % p = 0) then foundPrimes else ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-08-02T19:24:23.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"jitterist"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/jitterist","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"305d3f2cace34964980577797a04900f","snippet":"module NthPrime let isPrime num = match num with | 2 -> true | _ when num % 2 = 0 -> false | _ -> let max = int (ceil (sqrt (float num))) [3..2..max] |> Seq.forall (fun x -> num % x <> 0) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-07-24T07:21:39.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"PraiseThePun"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/PraiseThePun","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"1a070f7a02bd498a8dbe10ea9b66ba0b","snippet":"module NthPrime let isPrime n = { 2 .. (int (sqrt (float n))) } |> Seq.forall (fun i -> n % i <> 0) let primes = Seq.initInfinite ((+) 2) |> Seq.filter isPrime |> Seq.cache let prime nth = if nth < 1 then None else primes |> (Seq.item (nth-1) >> Some) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-12-27T23:39:39.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"maxmuen"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/maxmuen","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"01f353d1408c4f1498eb57a5b8151c4f","snippet":"module NthPrime let mutable primes = [2] let rec addNextPrime (primes: int list) num: int list = match Seq.exists (fun x -> num % x = 0) primes with | true -> addNextPrime primes (num + 1) | false -> primes @ [num] let rec getPrime primes = function ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-02-03T01:15:57.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"galilg"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/galilg","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"b9d9a832b9f84f6596393efc0b5b0a68","snippet":"module NthPrime let primes (limit: uint32) = let buf = BitArray(int limit + 1, true) let cull p = { p * p .. p .. limit } |> Seq.iter (fun c -> buf.[int c] <- false) { 2u .. uint32 (sqrt (double limit)) } |> Seq.iter (fun c -> if buf.[int c] then cull c) { 2u .. limit } |> Seq.map (fun i -> ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-10-19T21:54:15.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"tyauvil"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/tyauvil","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"1ea4cf7da9be456187f72db4d2e54ff3","snippet":"module NthPrime let isPrime n = let square = n |> float |> sqrt |> int [2..square] |> List.forall (fun x -> n % x <> 0) let primes = let rec primesAux n = seq { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-02-19T11:37:33.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"domasin"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/domasin","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"8508476eb05b423faf1be9a3e854924e","snippet":"module NthPrime let isPrime n = let sqrt' = n |> float |> sqrt |> int [2 .. sqrt'] |> List.forall (fun x -> n % x <> 0) let prime nth : int option = Seq.initInfinite((+) 1) |> Seq.skip 1 |> Seq.filter isPrime ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-08-26T11:26:48.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"milanmitric"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/milanmitric","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"c4a6e5b331e64e00afddd52e2fc08077","snippet":"module NthPrime let sqrtInt = float >> sqrt >> int let isPrime n = [ 2 .. sqrtInt n ] |> List.forall (fun x -> n % x <> 0) let allPrimes = let rec allPrimes' n = ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-07-28T15:34:19.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"folen"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/folen","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"6b416672435c411e81986e2c1534e68b","snippet":"module NthPrime let prime nth: int option = let isNotPrime primes i = primes |> List.exists (fun x -> i % x = 0) let nextPrime primes = let biggestPrimeSoFar = List.head primes Seq.initInfinite (fun i -> biggestPrimeSoFar + 2 + i * 2) |> Seq.skipWhile (isNotPrime primes) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-10-10T15:44:31.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"b47on"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/b47on","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"4975c7a34ff64bc98bfd7478a9c1ebfe","snippet":"module NthPrime let prime (nth: int): int option = let lni n = n |> float |> log let upperbound nth = match nth with | 1 -> 2 | 2 -> 5 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":32,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-11-11T21:15:47.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"rob-sessink"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/rob-sessink","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"e5aa19aafe0544dbbd2775ef14777945","snippet":"module NthPrime let upperBound n = if n < 100 then 25 else n |> float |> fun n -> n * (log n + log (log n)) |> int let maxFactor = float >> sqrt >> ceil >> int let primes nth = let bound = upperBound nth let array = BitArray((bound+1)/2, true) let limit = maxFactor bound ","num_views":0,"num_stars":0,"num_comments":1,"representation_num_published_solutions":1,"num_iterations":11,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-04-14T12:58:08.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"martinfreedman"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/martinfreedman","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"10e40873994f4298a9f164e322d8b67f","snippet":"module NthPrime let isPrime n = seq { 2 .. n |> float |> sqrt |> int } |> Seq.exists (fun x -> n % x = 0) |> not let prime nth : int option = if nth = 0 then None ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-06-01T20:08:50.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"TeaDrivenDev"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/TeaDrivenDev","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"959340d107904881b5e81806098c5a8b","snippet":"module NthPrime let isPrime n = seq { 2 .. n - 1 } |> Seq.forall (fun a -> n % a > 0) let rec primesStream current = seq { if isPrime current then yield current ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-03-26T21:47:13.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"jabarij"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/jabarij","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"7a32e06c58704822b0e78e0b0f77977c","snippet":"module NthPrime let isPrime (sieve:Dictionary<_, _>) x = match Seq.exists (fun d -> x % d = 0) sieve.Keys with | true -> None | false -> sieve.[x] <- x Some x ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-10-09T22:05:21.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"romanstetsenko"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/romanstetsenko","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"012b50cebfc44abf83d6f01049de5170","snippet":"module NthPrime let rec findNthPrime primesSoFar max number = if Seq.filter(fun prime -> prime*prime <= number) primesSoFar |> Seq.forall (fun prime -> number%prime <> 0) then let newPrimes = List.append primesSoFar [number] if newPrimes.Length= max then number else findNthPrime newPrimes max (number+1) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-08-07T15:28:08.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"mkgadde"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/mkgadde","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"12998f2c22d74447ba6038a9daaeffaa","snippet":"module NthPrime let isPr (n:int):bool = let sqr = int(sqrt (float n)) [2..sqr] |> Seq.forall (fun x -> n%x<>0) let prime (nth:int) : int option = if nth <1 then None else Seq.initInfinite(fun i ->i+1) |>Seq.filter isPr ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-02-18T14:16:14.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"HatemOrhoma"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/HatemOrhoma","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"e48b7912ba0641b4b4e8c44ac418149e","snippet":"module NthPrime let primes = let rec nextPrime n p primes = if Map.containsKey n primes then nextPrime (n + p) p primes else primes.Add(n, p) let rec prime n primes = ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-01-14T16:32:07.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"sillyotter"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/sillyotter","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"8b111e9c63e64efc92c490bb4e3b9b77","snippet":"module NthPrime let rec candidates n = seq {yield n-1 yield n+1 yield! candidates (n+6)} let primesL = let rec filterPrimes ns = let p = Seq.head ns ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":22,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2020-03-22T21:59:55.000Z","is_out_of_date":true,"language":"fsharp","author":{"handle":"alomew"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/alomew","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"2623fb8c2e1e435fa949294cbcb48e8b","snippet":"module NthPrime let sieve bound = let mutable (ps: int list) = [2] for i in [2..bound] do ignore <| if i % 2 = 1 && List.forall (fun elem -> i % elem <> 0) ps then ps <- List.append ps [i;] else () ps ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-03-06T20:01:33.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"eglyph"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/eglyph","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}},{"uuid":"62852ba9fe8747b493ee013adbad601a","snippet":"module NthPrime let isPrime n : bool = not (seq { 2..(n >>> 1) } |> Seq.exists (fun f -> n % f = 0)) let prime nth : int option = if nth < 1 then None else seq { 2..System.Int32.MaxValue } |> Seq.filter isPrime |> Seq.item (nth - 1) |> Some ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":8,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-11-05T10:11:37.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"atk"},"exercise":{"title":"Νιοστός πρώτος αριθμός","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/solutions/atk","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/nth-prime/iterations"}}],"meta":{"current_page":1,"total_count":134,"total_pages":6,"unscoped_total":134}}}}}

Γλώσσες προγραμματισμού

Μάθε προγραμματισμό με το Jiki

Το Ταξίδι σου

Τα Αγαπημένα σουΝέο

Προνόμια του Exercism

Βίντεο της Κοινότητας

Σειρά σύντομων εισαγωγών

Συνεντεύξεις και ιστορίες

Discord

Φόρουμ

Ξεκινώντας

Καθοδήγηση

Τεκμηρίωση

Συνεισφέροντες

ΜεταφραστέςΝέο

Κάνε δωρεά

Σχετικά με το Exercism

Ο αντίκτυπός μας

Συγχρονισμός GitHubΝέο

Insiders