Changes

Jump to navigation Jump to search
311 bytes added ,  22:02, September 28, 2009
+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==
SkipCaptcha
710

edits

Navigation menu