{"request":{"endpoint":"https://exercism.org/api/v2/tracks/gleam/exercises/nth-prime/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"7e2f18c11feb46bbbcbccde78dbec6ee","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { use <- bool.guard(when: number < 1, return: Error(Nil)) use <- bool.guard(when: number == 1, return: Ok(2)) use <- bool.guard(when: number == 2, return: Ok(3)) use <- bool.guard(when: number == 3, return: Ok(5)) nth_prime(7, [2, 3, 5], number) } fn nth_prime(number: Int, primes: List(Int), n: Int) -> Result(Int, Nil) { ","num_views":0,"num_stars":2,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-06-17T12:01:26.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"rado-h"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/rado-h","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"319c8fa1604e4eafb4cd3e5e1c742fdf","snippet":"fn is_prime(candidate: Int, primes: List(Int)) -> Bool { list.all(primes, fn(divisor) { candidate % divisor != 0 }) } pub fn prime(number: Int) -> Result(Int, Nil) { use <- bool.guard(number < 1, Error(Nil)) iterator.single(2) |> iterator.append(iterator.iterate(3, fn(i) { i + 2 })) |> iterator.fold_until([], fn(primes, candidate) { ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"errored","published_at":"2024-03-21T03:35:24.000Z","is_out_of_date":true,"language":"gleam","author":{"handle":"pf981"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/pf981","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"706d8b4ca82140b5be2da7f2ee7848b1","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { use <- bool.guard(when: number < 1, return: Error(Nil)) iterator.single(2) |> iterator.append(iterator.iterate(3, fn(n) { n + 2 })) |> iterator.filter(is_prime) |> iterator.at(number - 1) } fn is_prime(number: Int) -> Bool { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"errored","published_at":"2024-06-24T20:02:38.000Z","is_out_of_date":true,"language":"gleam","author":{"handle":"mtsknn"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/mtsknn","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"1a606632dc4746f983a25557018c671a","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { case number { 0 -> Error(Nil) 1 -> Ok(2) _ -> Ok(get_nth(number, 2, 3)) } } fn get_nth(nth: Int, counter: Int, current: Int) -> Int { case counter == nth, is_prime(current, 3) { ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-09-24T10:32:40.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"okrischer"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/okrischer","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"e1323765558547d38edf8343acca7921","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { case number { n if n <= 0 -> Error(Nil) n -> { let assert Ok(nth_prime) = find_nth_prime(n) Ok(nth_prime) } } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":47,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-11-07T13:45:39.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"david82"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/david82","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"30e0268a0b8d4897908869fe16736c7f","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { case number { n if n <= 0 -> Error(Nil) 1 -> Ok(2) _ -> prime_loop(number, [2], 3) |> Ok } } fn prime_loop(nth: Int, primes: List(Int), next: Int) -> Int { case primes |> list.length { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-01-02T20:30:37.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"darrior"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/darrior","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"dc8e750feac24e5595211b12a4fa9555","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { case number { n if n < 1 -> Error(Nil) 1 -> Ok(2) n -> Ok(do_prime(n, 3, [2])) } } fn do_prime(counter: Int, cur: Int, acc: List(Int)) -> Int { case counter { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":27,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-10-23T05:45:23.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"lummish"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/lummish","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"e8cf56e068f14e209dd7ea47c33cdae7","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { use <- bool.guard(when: number <= 0, return: Error(Nil)) use <- bool.guard(when: number == 1, return: Ok(2)) let primes = [2, 3, 5, 7, 11, 13] let number = number - 1 use <- bool.guard(when: number < 6, return: list.at(primes, number)) iterator.iterate(from: 17, with: fn(n) { n + 1 }) |> iterator.fold_until(from: #(6, primes), with: fn(acc, n) { use <- bool.guard(when: list.any(in: acc.1, satisfying: fn(p) { n % p == 0 }), return: Continue(acc)) ","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":"errored","published_at":"2024-04-25T19:23:12.000Z","is_out_of_date":true,"language":"gleam","author":{"handle":"ignad-vandersnatch"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/ignad-vandersnatch","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"10cdd0038214438d99488243cc67fc50","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { case number { n if n > 0 -> Ok(prime_(number, 2)) _ -> Error(Nil) } } fn prime_(nth: Int, index: Int) -> Int { case nth { 0 -> index - 1 ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":28,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-04-07T03:55:23.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"mahdi-hm"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/mahdi-hm","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"8095fc8aeba34321ab6a84092e48bb0a","snippet":"fn prime_check(value: Int, limit: Int, cur: Int) -> Bool { use <- bool.guard(cur > limit, True) case value % cur == 0 { True -> False False -> prime_check(value, limit, cur + 1) } } fn is_prime(value: Int) -> Bool { use <- bool.guard(value == 2, True) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":37,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-01-22T11:57:29.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"sotolf2"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/sotolf2","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"05cf45c8e1794998b5d978842f812c0e","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { case number > 0 { True -> Ok(prime_loop(number, 2)) False -> Error(Nil) } } fn prime_loop(number: Int, prime: Int) -> Int { case number { 1 -> prime ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-06-13T01:55:25.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"jinwoo"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/jinwoo","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"b10b1ab93c8a469f8572dcae20d670ac","snippet":"fn primes_in_list(list: List(Int), primes: List(Int)) -> List(Int) { case list |> list.first { Ok(num) -> primes_in_list(list |> list.filter(fn(n) { n % num != 0 }), [num, ..primes]) Error(Nil) -> primes } } fn ln(x: Float) -> Float { x |> float.logarithm |> result.unwrap(0.) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":31,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-06-17T18:40:23.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"yehorkhod"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/yehorkhod","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"1eab68f3af7a41368eeeea7fd4e772b6","snippet":"pub fn main() { prime(3) |> io.debug } pub fn prime(number: Int) -> Result(Int, Nil) { case number { 1 -> Ok(2) _ -> iterator.unfold(#([2], 3), fn(pair) { iterator.Next(element: pair.1, accumulator: #( ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"errored","published_at":"2025-01-31T06:34:29.000Z","is_out_of_date":true,"language":"gleam","author":{"handle":"AleryBerry"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/AleryBerry","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"e31325662bad48ba8fb18ba1a5462b33","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { case number { 0 -> Error(Nil) 1 -> Ok(2) 2 -> Ok(3) _ -> { case nth_prime(number, 2, 1) { prime -> Ok(prime) _ -> Error(Nil) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":40,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-05-02T00:43:23.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"evanlua"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/evanlua","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"72e37cd78a704f818510129a1bd758fe","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { use <- bool.guard(number <= 0, Error(Nil)) let primes = sieve(iterator.iterate(2, fn(x) { x + 1 })) iterator.at(primes, number - 1) } fn sieve(numbers) { let assert iterator.Next(x, rest) = iterator.step(numbers) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"errored","published_at":"2025-04-17T07:59:21.000Z","is_out_of_date":true,"language":"gleam","author":{"handle":"itsniiyama"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/itsniiyama","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"3de820dca24245ada468b281b38b8911","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { prime_rec([], 2, 0, number) } fn prime_rec(acc, n, count, max_count) { case count == max_count { True -> list.first(acc) False -> case acc |> list.all(fn(prev_prime) { n % prev_prime != 0 }) { False -> prime_rec(acc, n + 1, count, max_count) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-04-21T00:25:13.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"jeffwindsor"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/jeffwindsor","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"90922fa3b52844d886066c76753455e5","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { case number > 0 { True -> Ok(prime_loop(number, 0, 2)) False -> Error(Nil) } } fn prime_loop(number: Int, count: Int, candidate: Int) -> Int { let assert Ok(candidate_sqrt) = int.square_root(candidate) |> result.map(float.truncate) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-03-10T22:55:30.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"gpillow"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/gpillow","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"3295c03d335642a880e20da9e1aaffb0","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { use <- bool.guard(number < 1, Error(Nil)) do_prime(2, number - 1) |> Ok } fn do_prime(candidate: Int, remaining: Int) { use <- bool.guard(remaining == 0, candidate) do_prime(next_prime_greater_or_equal(candidate + 1), remaining - 1) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-07-07T21:16:42.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"maxwell-k"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/maxwell-k","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"c57bffe24ce145ffb125402f4d8a3c51","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { case number { n if n < 1 -> Error(Nil) 1 -> Ok(2) _ -> Ok(prime_do(number, 3, 2)) } } fn prime_do(number: Int, candidate: Int, index: Int) -> Int { case is_prime(candidate) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":36,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-09-06T13:49:13.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"rafalglowacz"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/rafalglowacz","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"12115b7057164102add5694b57c07c00","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { case number { 1 -> Ok(2) 2 -> Ok(3) _ if number > 1 -> Ok(find_nth_prime(3, number - 2)) _ -> Error(Nil) } } fn find_nth_prime(current: Int, missing: Int) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":29,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-09-09T13:08:41.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"D4n13le"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/D4n13le","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"d2ee3502f0d34332be49f8d273230a9c","snippet":"pub fn prime(number: Int) -> Result(Int, Nil) { find_nth_prime(number, 2, []) } fn find_nth_prime(number, candidate, lst) -> Result(Int, Nil) { case list.length(lst) == number { True -> list.first(lst) _ -> case is_prime(candidate) { True -> find_nth_prime(number, candidate + 1, [candidate, ..lst]) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":41,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-09-12T04:37:35.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"Zuwa"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/Zuwa","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"912c14ea96d046ba9dccedd60097f8f1","snippet":"fn prime_rec(number: Int, candidate: Int, primes: List(Int)) -> Result(Int, Nil) { case number, list.any(primes, fn(n) { candidate % n == 0 }) { 2, _ -> list.last(primes) _, True -> prime_rec(number, candidate + 2, primes) _, _ -> prime_rec(number - 1, candidate + 2, list.append(primes, [candidate])) } } pub fn prime(number: Int) -> Result(Int, Nil) { case number { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-08-14T11:07:16.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"kawarimidoll"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/kawarimidoll","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"7599a4865b4147d2b40bac983e603fb8","snippet":"pub fn prime(n: Int) -> Result(Int, Nil) { case n { n if n <= 0 -> Error(Nil) 1 -> Ok(2) 2 -> Ok(3) _ -> { iterator.iterate(3, fn(x) { x + 2 }) |> iterator.filter(is_prime) |> iterator.at({ n - 1 } - 2) |> result.map_error(fn(_) { Nil }) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"errored","published_at":"2024-07-22T15:55:36.000Z","is_out_of_date":true,"language":"gleam","author":{"handle":"hagenek"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/hagenek","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}},{"uuid":"58265234ffa8412a816e682f526beb84","snippet":"fn is_prime(primes: List(Int), current_num: Int) -> Bool { list.all(primes, fn(prime: Int) -> Bool { current_num % prime != 0 }) } fn sieve_iter(acc: #(List(Int), Int)) -> iterator.Step(Int, #(List(Int), Int)) { case is_prime(acc.0, acc.1) { True -> iterator.Next(element: acc.1, accumulator: #( list.sort([acc.1, ..acc.0], by: int.compare), acc.1 + 1, ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":7,"num_loc":27,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"errored","published_at":"2024-10-06T19:25:10.000Z","is_out_of_date":true,"language":"gleam","author":{"handle":"inyutin"},"exercise":{"title":"العدد الأولي رقم `n`","icon_url":"https://assets.exercism.org/exercises/nth-prime.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/solutions/inyutin","private_iterations_url":"https://exercism.org/ar/tracks/gleam/exercises/nth-prime/iterations"}}],"meta":{"current_page":1,"total_count":105,"total_pages":5,"unscoped_total":105}}}}}

مسارات اللغات

تعلّم البرمجة مع Jiki

رحلتك

مفضلاتكجديد

مزايا Exercism

فيديوهات المجتمع

سلسلة المقدمات الموجزة

مقابلات وقصص

Discord

المنتدى

البدء

الإرشاد

الوثائق

المساهمون

المترجمونجديد

تبرّع

عن Exercism

أثرنا

مزامن GitHubجديد

Insiders