Semiprime

From Conservapedia
This is an old revision of this page, as edited by CSGuy (Talk | contribs) at 16:54, October 18, 2009. It may differ significantly from current revision.

Jump to: navigation, search

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. It has also been shown that there exist infinitely many primes p such that p+2 is either a prime or a semiprime. Primes that have this property are known as Chen primes.[1]

References

  1. http://mathworld.wolfram.com/ChenPrime.html

External Links