Prime Functions Playground

by Elexron Development team
const pr = required('prime-functions');
pr.

(
);
true
  • ac_unitMain Functions
    • isPrime(number)
    • nthPrime(nth)
    • indexOfPrime(primeNumber)
    • nthPrimesSum(...nths)
    • nthPrimesTimes(...nths)
    • nextPrime(number)
    • prevPrime(number)
    • primeSmallerThan(number)
    • primeBiggerThan(number)
    • primeDivisors(number)
    • primeDivisorsSum(number)
    • primeDivisorsTimes(number)
    • isPrimeOrDivisors(number)
    • primesSmallerThan(number)
    • closestPrime(number)
    • randomPrime(minVal, maxVal)
    • randomPrimeDigits(number)
    • whatWillThisPrimeBe(number)
    • nextNPrimes(number, n)
    • prevNPrimes(number, n)
    • primesBetween(number1, number2)
    • firstNPrimes(n)
    • isEmirp(number)
    • nthEmirp(nth)
    • hasTwinPrime(primeNumber)
    • isTruncatable(primeNumber)
    • truncatableValues(primeNumber)
    • nthTruncatablePrime(nth)
    • isPandigitalPrime(number)
  • functionsTheoretical Functions
    • isMersennePrime(number)
    • nthMersennePrime(nth)
    • nthMersennePrimeExponents(nth)
    • wilsonsTheorem(n, returnWithExplanation=true)
    • phi(n)
    • totient(n)
  • gestureHelper Functions
    • digits(number)
    • sum(array)
    • times(array)
    • remainDividedBy(number, divisor)
    • printExecutionTime()
    • beautifyInteger(number)
    • integerToText(integer, language)
    • factorial(number)
    • integerToString(number)
    • integerToArray(number)
    • firstNDigits(number, n)
    • lastNDigits(number, n)
    • reverseNumber(number)
NPM Github