Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
27 lines (25 loc) · 596 Bytes

File metadata and controls

27 lines (25 loc) · 596 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
import { PrimeCheck } from '../Maths/PrimeCheck.js'
/**
* Find nth Prime Number
*
* P.S.(Project Euler - 007):
* By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
* What is the 10001st prime number?
*
* @param {Number} n
* @returns {Number} returns the nth prime number
*/
export const nthPrime = (n) => {
if (n < 1) {
throw new Error('Invalid Input')
}
let count = 0
let candidateValue = 1
while (count < n) {
candidateValue++
if (PrimeCheck(candidateValue)) {
count++
}
}
return candidateValue
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.