Chen's theorem was first stated by Chinese mathematician Chen Jing Run in 1966[1], with further details of the proof in 1973[2]. His original proof was much simplified by P. M. Ross[3]. The theorem states that every sufficiently large even number can be written as the sum of either two primes, or a prime and a semiprime (the product of two primes). Chen's theorem is a giant step towards the Goldbach conjecture, and a remarkable result of the sieve methods. 1966 (MCMLXVI) was a common year starting on Saturday (the link is to a full 1966 calendar). ... In mathematics, a proof is a demonstration that, assuming certain axioms, some statement is necessarily true. ... 1973 (MCMLXXIII) was a common year starting on Monday (the link is to a full 1973 calendar). ... In mathematics, Goldbachs conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. ... Sieve theory is a set of general techniques in number theory, designed to count, or more realistically to estimate the size of, sifted sets of integers. ...
↑ J. R. Chen, On the representation of a large even integer as the sum of a prime and the product of at most two primes, Kexue Tongbao 17 (1966), 385-386.
↑ J. R. Chen, On the representation of a larger even integer as the sum of a prime and the product of at most two primes, Sci. Sinica 16 (1973), 157-176.
↑ P. M. Ross, On Chen's theorem that each large even number has the form (p1+p2) or (p1+p2p3), J. London Math. Soc. (2) 10 (1975), no. 4, 500--506.
In 1966, Chen Jing-run showed that every sufficiently large even number can be written as the sum of prime and a number with at most two prime factors.
Chens result is not identical to Goldbachs conjecture, not even for every number> some unknown number n.
And both Chen and Wang are the most common surnames, with millions of people sharing them.
Feeds |
Contact