Changes

[[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.

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.<ref>http://mathworld.wolfram.com/ChenPrime.html</ref>

==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:Number Theory]]

[[Category:Number Theory]]