A *prime number* is a number that is only divisible by itself and $1$, i.e. it has exactly two divisors. An example of a prime number is $7=7\cdot 1$. On the other hand, $6$ is not a prime number, since it can be written as $6=2\cdot 3$. Since the number $1$ only has one divisor (itself), it is *not* a prime number. Large prime numbers are important for modern [[Encryption|encryption algorithms]] like the [[Rivest-Shamir-Adleman Algorithm|RSA algorithm]]. >[!read]- Further Reading >- [[Prime Factorization]] >- [[Encryption]] >- [[Rivest-Shamir-Adleman Algorithm|RSA]] >[!ref]- References