For a better experience on MUBI, update your browser.

Prime Numbers

by Kim Packard
In number theory, a formula for primes is a formula generating the prime numbers, exactly and without exception. No such formula which is efficiently computable is known. A number of constraints are known, showing what such a “formula” can and cannot be. In computational number theory, a variety of algorithms make it possible to generate prime numbers efficiently. These are used in various applications, for example hashing, public-key cryptography, and search of prime factors in large numbers. Khamsa is an Arabic word that literally means “five”, but also “the five fingers of the hand.” It may also be taken as a reference to the primary… Read more

In number theory, a formula for primes is a formula generating the prime numbers, exactly and without exception. No such formula which is efficiently computable is known. A number of constraints are known, showing what such a “formula” can and cannot be.

In computational number theory, a variety of algorithms make it possible to generate prime numbers efficiently. These are used in various applications, for example hashing, public-key cryptography, and search of prime factors in large numbers.

Khamsa is an Arabic word that literally means “five”, but also “the five fingers of the hand.” It may also be taken as a reference to the primary number itself.

Read less