New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Nth-prime exercise #175

Closed

Krymore opened this issue Dec 3, 2019 · 0 comments

Krymore commented Dec 3, 2019

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.

SaschaMann added Code-in labels

github-actions bot removed Code-in labels

SaschaMann closed this as completed

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