Talk:Chen Jingrun

= Alledged greatness =

Untitled
The article claims Chen is one of the greats of the 20th century, but no citation is given. This claim sounds dubious to me. Someone removed the same claim from Grothendieck's article.Aliotra (talk) 15:25, 11 December 2010 (UTC)
 * There is nothing to be gained from a discussion of the relative greatness of mathematicians. This is so, with and without citations. — Preceding unsigned comment added by 81.95.123.216 (talk) 07:19, 19 May 2014 (UTC)

Goldbach guess any greater than 2 even, can be expressed as the sum of two prime numbers
"When all the integer]]$N>3$, is bound to the existence of $X$,
 * $N+X $ and $N-X $ are the prime - Goldbach's conjecture.

because even 2N= (N+X) + (N-X).
 * undefined"

Framework
In 300 BC in ancient Greece, Ella Torsten Ni created a sieve method, can produce all the prime numbers within an arbitrary large number of: to get all theprime numbers less than a natural number $$n$$, as long as in multiples of  $$2-n$$     will not be more than$$\sqrt{n}$$ primes can be all off.. The sieve method can be summarized as

1, if n is a composite number, then it is a factor of D satisfying 1<d≤$$\sqrt{n}$$.

2, if the natural number n cannot be less than$$\sqrt{n}$$ for any prime numberdivisible, then$$n$$ is a prime number.

The 2 Chinese characters into English letters indicate the equivalence of content $$n=p_{1}m_{1}+a_{1}=p_{2}m_{2}+a_{2}=\dots=p_{k}m_{k}+a_{k}.$$....(1)

The  .$$p_{1},p_{2},\dots,p_{k}$$ ,order prime 2，3，5，..... $$a$$≠0. If $$n<P^{2}_{k+1}$$,  then n is a prime number.

We can think of (1) content and equivalent transformation of congruence grouprepresentation： $$n \equiv a_1 \pmod{p_1}, n \equiv a_2 \pmod{p_2}, \dots, n \equiv a_k \pmod{p_k}$$. ...（2） Because of (2)$$p_{1}$$,$$p_{2}$$,...,$$p_{k}$$. two two coprime, based on the Chinese Remainder Theorem (Chinese remainder theorem) that, for a given$$a_{1}$$,$$a_{2}$$,...,$$a_{k}$$， (2) has a unique solution in the range of$$p_{1}$$$$p_{2}$$...$$p_{k}$$.

Example
For example: k=1,$$n=2m_{1}+1$$ ， solutionn=3 ，5，7， The （3，$$3^{2}$$） all prime number interval..

K=2,，$$n=2m_{1}+1=3m_{2}+1$$， solution, n=7 13, 19；

$$n=2m_{1}+1=3m_{2}+2$$，Solution n=5, 11, 17， 23.

The（5，$$5^{2}$$） all prime number interval. |} The （7，$$7^{2}$$）all prime number interval. Copy this be all prime numbers within a not leak to the given number.. For all the possible $$a_{1}, a_{2} \cdot, a_{k}$$，(1)and(2)In the$$p_{1}$$$$p_{2}$$...$$p_{k}$$Within the scope of，

（$$p_{1}-1$$）（$$p_{2}-1$$）($$p_{3}-1$$)...（$$p_{k}-1$$） Solution.

Reasonable framework of Goldbach conjecture
How to make the two natural number addition and subtraction are primes, N+X become the prime, N-X is also a prime number. According to the division theorem:"given a positive integer a and b, b ≠ 0, has a unique integer q and r (0 ≤ r < b),the a=bq+r". Then according to the congruence theorem: "every integer exactly with the 0,1,2,3,..., m-1 congruence (mod m)". So, given a natural number N(N>4), can only be said:

$$N=p_{1}m_{1}+e_{1}=p_{2}m_{2}+e_{2}=\dots=p_{k}m_{k}+e_{k}.$$(3)

The  .$$p_{1},p_{2},\dots,p_{k}$$order prime $$e_{i}=0,1,2,...,P_{i}-1$$.

$$\frac{p^{2}_{k}}{2}$$ < N < $$\frac{p^{2}_{k+1}}{2}$$

Now is the time to ask, whether there is X

$$X=p_{1}h_{1}+f_{1}=p_{2}h_{2}+f_{2}=\dots=p_{k}h_{k}+f_{k}.$$（4）

$$f_{i}$$≠$$e_{i}$$，

$$f_{i}$$≠$$p_{i}-e_{i}$$.

If X<N-2,， then N+X and N-X are prime, because they correspond to (1) (2) type.

Example
Let N=20，$$20=2m_{1}+0=3m_{2}+2=5m_{5}+0$$；

$$\frac{5^{2}}{2}$$ < 20 < $$\frac{7^{2}}{2}$$

$$e_{1}=0$$,$$e_{2}=2$$,$$e_{3}=0$$. The four solutions are：21，27，3，9. Less than N-2 X， 3 and 9. , we learn that, 20+3 and 20-3 is a pair of prime numbers; 20+9 and 20-9 is a pair of prime numbers. This is the use of primality test: minimum residual is not zero. And$$N+X<P^{2}_{k+1}$$, N+X and N-X is a pair of prime numbers. Because (N+X) +(N-X) =2N. This is the famous Goldbach conjecture conjecture,The problem is transferred to the elementary number range.

External links modified
Hello fellow Wikipedians,

I have just modified 3 one external links on Chen Jingrun. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20070715052529/http://www.numbertheory.org:80/obituaries/OTHERS/chen/ to http://www.numbertheory.org/obituaries/OTHERS/chen/
 * Added archive https://web.archive.org/web/20040401112756/http://www.math.ac.cn:80/Chinese/B/Chenjr/Chenjr.htm to http://www.math.ac.cn/Chinese/B/Chenjr/Chenjr.htm
 * Added archive https://web.archive.org/web/20040401122341/http://www.math.ac.cn:80/English/2/History.htm to http://www.math.ac.cn/English/2/History.htm

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at ).

Cheers.— InternetArchiveBot  (Report bug) 04:59, 21 November 2016 (UTC)

RupiahIsnotidisnotid (talk) 16:43, 21 February 2017 (UTC)