Difference between revisions of "Semiprime"
Jump to navigation
Jump to search
m (cat) |
m (bold) |
||
| Line 1: | Line 1: | ||
| − | A semiprime is the product of two (possibly equal) [[prime number]]s. | + | A '''semiprime''' is the product of two (possibly equal) [[prime number]]s. |
Other names for a "semiprime" are biprime, 2-almost prime, and pq-number. | Other names for a "semiprime" are biprime, 2-almost prime, and pq-number. | ||
Revision as of 11:35, November 16, 2008
A semiprime is the product of two (possibly equal) prime numbers.
Other names for a "semiprime" are biprime, 2-almost prime, and pq-number.
Encryption algorithms, including RSA encryption, typically rely on special large semiprimes. A table of such semiprimes is listed at MathWorld semiprime.
External Links
- Semiprimes at the OEIS