mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-05 08:16:50 +08:00
feat: remove twinPrime
(#1641)
* tests: add missing test of `twinPrime` * feat: remove `twinPrime`
This commit is contained in:
@ -1,29 +0,0 @@
|
|||||||
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 }
|
|
@ -1,10 +0,0 @@
|
|||||||
import { twinPrime } from '../TwinPrime.js'
|
|
||||||
|
|
||||||
describe('Twin Primes', () => {
|
|
||||||
it('Should be valid twin primes', () => {
|
|
||||||
expect(twinPrime(3)).toBe(5)
|
|
||||||
expect(twinPrime(5)).toBe(7)
|
|
||||||
expect(twinPrime(4)).toBe(-1)
|
|
||||||
expect(twinPrime(17)).toBe(19)
|
|
||||||
})
|
|
||||||
})
|
|
Reference in New Issue
Block a user