Difference between revisions of "Semiprime"
Jump to navigation
Jump to search
m (link to de-orphan) |
(+goldbach analog) |
||
| Line 4: | Line 4: | ||
[[Encryption]] algorithms, including [[RSA]] [[encryption]], typically rely on special large semiprimes. A table of such semiprimes is listed at [http://mathworld.wolfram.com/Semiprime.html MathWorld semiprime]. | [[Encryption]] algorithms, including [[RSA]] [[encryption]], typically rely on special large semiprimes. A table of such semiprimes is listed at [http://mathworld.wolfram.com/Semiprime.html MathWorld semiprime]. | ||
| + | |||
| + | Interestingly, though the [[Goldbach conjecture]] in its full form remains intractable to current techniques, a related related result for semiprimes has been known since the 1970s. The work of Chen Jingrun showed that every even number is either the sum of two primes, or the sum of a prime and a semiprime. | ||
==External Links== | ==External Links== | ||
Revision as of 22:02, September 28, 2009
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.
Interestingly, though the Goldbach conjecture in its full form remains intractable to current techniques, a related related result for semiprimes has been known since the 1970s. The work of Chen Jingrun showed that every even number is either the sum of two primes, or the sum of a prime and a semiprime.
External Links
- Semiprimes at the OEIS