Prime number: Difference between revisions
From ACT Wiki
Jump to navigationJump to search
imported>Doug Williamson (Remove surplus link.) |
imported>Doug Williamson m (Add link.) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 3: | Line 3: | ||
A prime number is a positive whole number that is divisible only by itself and 1. | A prime number is a positive whole number that is divisible only by itself and 1. | ||
Some encryption systems make use of very large prime numbers, for example RSA encryption. | |||
Examples of small prime numbers include 2, 3, 5, 7 and 11. | |||
| Line 14: | Line 12: | ||
* [[Encryption]] | * [[Encryption]] | ||
* [[Factors]] | * [[Factors]] | ||
* [[Prime]] | |||
* [[RSA encryption]] | * [[RSA encryption]] | ||
Latest revision as of 14:18, 31 March 2020
Maths - encryption.
A prime number is a positive whole number that is divisible only by itself and 1.
Some encryption systems make use of very large prime numbers, for example RSA encryption.
Examples of small prime numbers include 2, 3, 5, 7 and 11.
