GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaScript/Project-Euler/Problem007.js at master · TheAlgorithms/JavaScript Expand file tree/ Copy pathProblem007.jsMore file actions 27 lines (25 loc) · 596 Bytes / Copy pathProblem007.jsFile metadata and controls27 lines (25 loc) · 596 Bytes 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 } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |