mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-18 09:23:55 +08:00

* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
30 lines
544 B
JavaScript
30 lines
544 B
JavaScript
import { PrimeCheck } from './PrimeCheck'
|
|
|
|
/**
|
|
* @function twinPrime
|
|
* Gets the 'twin prime' of a prime number.
|
|
*
|
|
* @param {Integer} n The number to find the twin prime of.
|
|
* @returns {Integer} Either the twin, or -1 if n or n + 2 is not prime.
|
|
*
|
|
* @see https://en.wikipedia.org/wiki/Twin_prime
|
|
*
|
|
* @example twinPrime(5) = 7
|
|
* @example twinPrime(4) = -1
|
|
*/
|
|
function twinPrime(n) {
|
|
const prime = PrimeCheck(n)
|
|
|
|
if (!prime) {
|
|
return -1
|
|
}
|
|
|
|
if (!PrimeCheck(n + 2)) {
|
|
return -1
|
|
}
|
|
|
|
return n + 2
|
|
}
|
|
|
|
export { twinPrime }
|