DIEDC and Prime number: Difference between pages
From ACT Wiki
(Difference between pages)
imported>Doug Williamson (Add link.) |
imported>Doug Williamson (Layout.) |
||
| Line 1: | Line 1: | ||
''Maths - encryption''. | |||
A prime number is a positive whole number that is divisible only by itself and 1. | |||
==See also== | 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. | ||
== See also == | |||
* [[Encryption]] | |||
* [[Factors]] | |||
* [[RSA encryption]] | |||
[[Category:The_business_context]] | |||
[[Category:Manage_risks]] | |||
[[Category:Technology]] | |||
Revision as of 15:54, 18 December 2019
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.
