primes

Fast Functions for Prime Numbers

Last update: 9 January 2024

Copyright license: MIT license, File License

Software version identifier: 1.4.0, 0.1.0, 0.2.0, 1.0.0, 1.1.0, 1.5.0, 1.5.1, 1.5.2, 1.6.0

Description

Fast functions for dealing with prime numbers, such as testing whether a number is prime and generating a sequence prime numbers. Additional functions include finding prime factors and Ruth-Aaron pairs, finding next and previous prime numbers in the series, finding or estimating the nth prime, estimating the number of primes less than or equal to an arbitrary number, computing primorials, prime k-tuples (e.g., twin primes), finding the greatest common divisor and smallest (least) common multiple, testing whether two numbers are coprime, and computing Euler's totient function. Most functions are vectorized for speed and convenience.

This page was built for software: primes