History

Anthony C b5669c7628 Kotlin - Completed Allergies		2017-08-01 13:54:44 -04:00
..
.gradle	Fast-forward to later exercises - Saddle Point in progress	2017-07-20 20:26:53 -04:00
.idea	Kotlin - Completed Allergies	2017-08-01 13:54:44 -04:00
build/kotlin-build/caches	Fast-forward to later exercises - Saddle Point in progress	2017-07-20 20:26:53 -04:00
out	Fast-forward to later exercises - Saddle Point in progress	2017-07-20 20:26:53 -04:00
src	Fast-forward to later exercises - Saddle Point in progress	2017-07-20 20:26:53 -04:00
build.gradle	Fast-forward to later exercises - Saddle Point in progress	2017-07-20 20:26:53 -04:00
nth-prime.iml	Test commit?	2017-07-20 20:33:09 -04:00
README.md	Fast-forward to later exercises - Saddle Point in progress	2017-07-20 20:26:53 -04:00

Nth Prime

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

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

It's possible to submit an incomplete solution so you can see how others have completed the exercise.