Browse Definitions :
Definition

# prime number

A prime number is a whole number greater than 1 whose only factors are 1 and itself. A factor is a whole number that can be divided evenly into another number. The first few prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23 and 29. Numbers that have more than two factors are called composite numbers. The number 1 is neither prime nor composite.

Prime numbers can be used for a number of reasons. For example, some types of cryptography will use prime numbers.

For every prime number, for example "p," there exists a prime number that is greater than p, called p'. This mathematical proof, which was demonstrated in ancient times by the Greek mathematician Euclid, validates the concept that there is no "largest" prime number. As the set of natural numbers N = {1, 2, 3, ...} proceeds, prime numbers do generally become less frequent and are more difficult to find in a reasonable amount of time.

### How to determine if a number is prime

A computer can be used to test extremely large numbers to see if they are prime. But, because there is no limit to how large a natural number can be, there is always a point where testing in this manner becomes too great a task -- even for the most powerful supercomputers. As an example, the largest known prime number in December of 2018 was 24,862,048 digits.

Various algorithms have been formulated in an attempt to generate ever-larger prime numbers. For example, suppose "n" is a whole number, and it is not yet known if n is prime or composite. First, take the square root -- or the 1/2 power -- of n; then round this number up to the next highest whole number and call the result m. Then find all of the following quotients:

qm = n / m
q(m-1) = n / (m-1)
q(m-2) = n / (m-2)
q(m-3) = n / (m-3)
. . .
q3 = n / 3
q2 = n / 2

The number n is prime if -- and only if -- none of the q's, as derived above, are whole numbers.

### Mersenne and Fermat primes

A Mersenne prime is a number that must be reducible to the form 2 n - 1, where n is a prime number. The first few known values of n that produce Mersenne primes are where n = 2, n = 3, n = 5, n = 7, n = 13, n = 17, n = 19, n = 31, n = 61, and n = 89.

A Fermat prime is a Fermat number that is also prime. A Fermat number F n is of the form 2 m + 1, where m signifies the power of 2 -- that is, m = 2 n, and where n is an integer.

### Prime numbers and cryptography

Encryption always follows a fundamental rule: the algorithm -- or the actual procedure being used -- doesn't need to be kept secret, but the key does. Prime numbers can be very useful for creating keys. For example, the strength of public/private key encryption lies in the fact that it's easy to calculate the product of two randomly chosen prime numbers. However, it can be very difficult and time-consuming to determine which two prime numbers were used to create an extremely large product, when only the product is known.

In RSA (Rivest-Shamir-Adleman), a well-known example of public key cryptography, prime numbers are always supposed to be unique. The primes used by the Diffie-Hellman key exchange and the Digital Signature Standard (DSS) cryptography schemes, however, are frequently standardized and used by a large number of applications.

This was last updated in December 2020

• ISO 31000 Risk Management

The ISO 31000 Risk Management framework is an international standard that provides businesses with guidelines and principles for ...

• pure risk

Pure risk refers to risks that are beyond human control and result in a loss or no loss with no possibility of financial gain.

• risk reporting

Risk reporting is a method of identifying risks tied to or potentially impacting an organization's business processes.

• Pretty Good Privacy (PGP)

Pretty Good Privacy or PGP was a popular program used to encrypt and decrypt email over the internet, as well as authenticate ...

• email security

Email security is the process of ensuring the availability, integrity and authenticity of email communications by protecting ...

• Blowfish

Blowfish is a variable-length, symmetric, 64-bit block cipher.

• What is risk mitigation?

Risk mitigation is a strategy to prepare for and lessen the effects of threats faced by a business.

• fault-tolerant

Fault-tolerant technology is a capability of a computer system, electronic system or network to deliver uninterrupted service, ...

• synchronous replication

Synchronous replication is the process of copying data over a storage area network, local area network or wide area network so ...

• direct access

In computer storage, direct access is the process of reading and writing data on a storage device by going directly to where the ...

• kibi, mebi, gibi, tebi, pebi and exbi

Kibi, mebi, gibi, tebi, pebi and exbi are binary prefix multipliers that, in 1998, were approved as a standard by the ...

• holographic storage (holostorage)

Holographic storage is computer storage that uses laser beams to store computer-generated data in three dimensions.

Close