This is machine translation

Translated by Microsoft
Mouse over text to see original. Click the button below to return to the English verison of the page.


Operate on prime numbers, check and prove primality

MuPAD Functions

isprime Primality test
ithprime I-th prime number
nextprime Next prime number
prevprime Next smaller prime
numlib::checkPrimalityCertificate Test the primality certificate
numlib::Omega Number of prime divisors (with multiplicity)
numlib::pi Number of primes up to a given bound
numlib::proveprime Primality proving using elliptic curves
numlib::primedivisors Prime factors of an integer


Primes and Factorizations

Prime numbers are positive integers larger than 1 that have only two positive integer divisors: 1 and the number itself.

Was this topic helpful?