Difference between revisions of "Semiprime"
Jump to navigation
Jump to search
m (cat) |
|||
| Line 7: | Line 7: | ||
==External Links== | ==External Links== | ||
*[http://www.research.att.com/~njas/sequences/A001358 Semiprimes] at the OEIS | *[http://www.research.att.com/~njas/sequences/A001358 Semiprimes] at the OEIS | ||
| − | + | ||
| − | [[Category: | + | [[Category:Number Theory]] |
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