Fork: 0
wook / exercism-cpp
Download ZIP 30commits
Transfer to URL with SHA
exercism-cpp / nth-prime /
latest commit 7e883bb520
@Wook Song Wook Song authored on 15 Sep 2023
..
.exercism Medium: Add solution for "nth-prime", "sieve", and "simple-linked-list" 2 years ago
test Medium: Add solution for "nth-prime", "sieve", and "simple-linked-list" 2 years ago
CMakeLists.txt Medium: Add solution for "nth-prime", "sieve", and "simple-linked-list" 2 years ago
HELP.md Medium: Add solution for "nth-prime", "sieve", and "simple-linked-list" 2 years ago
README.md Medium: Add solution for "nth-prime", "sieve", and "simple-linked-list" 2 years ago
nth_prime.cpp Medium: Add solution for "nth-prime", "sieve", and "simple-linked-list" 2 years ago
nth_prime.h Medium: Add solution for "nth-prime", "sieve", and "simple-linked-list" 2 years ago
nth_prime_test.cpp Medium: Add solution for "nth-prime", "sieve", and "simple-linked-list" 2 years ago
README.md

Nth Prime

Welcome to Nth Prime on Exercism's C++ Track. If you need help running the tests or submitting your code, check out HELP.md.

Instructions

Given a number n, determine what the nth prime is.

By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.

If your language provides methods in the standard library to deal with prime numbers, pretend they don't exist and implement them yourself.

Source

Created by

  • @LegalizeAdulthood

Contributed to by

  • @cyborgsphinx
  • @elyashiv
  • @jackhughesweb
  • @KevinWMatthews
  • @kytrinyx
  • @patricksjackson

Based on

A variation on Problem 7 at Project Euler - http://projecteuler.net/problem=7