|
|
Re: Goldbach conjecture
Posted:
Nov 2, 1997 1:19 PM
|
|
In article <01bce59f$34786f00$e70cbece@goldbach.idcnet.com>,
goldbach <goldbach@idcnet.com> wrote:
>
>It is not all that obvious. E.g, assuming the conjecture true, take
>any prime p, no matter how large, then there is an even number E
>such that for E=p + q , q prime and p<=q, p will be the least prime
>in all the pairs of primes whose sum is E.
How do you prove that?
Greetings,
ÃÂÃÂrjan.
--
(ÃÂÃÂÃÂæ ÃÂùÃÂïÃÂõ ÃÂãÃÂáÃÂî ÃÂòÃÂÃÂ¥ÃÂáÃÂä ÃÂôÃÂèÃÂéÃÂóÃÂì ÃÂùÃÂïÃÂõ ÃÂáÃÂòÃÂÃÂ¥ ÃÂîÃÂïÃÂô ÃÂÃÂ¥ÃÂéÃÂçÃÂèÃÂô ÃÂâÃÂéÃÂô ÃÂãÃÂìÃÂÃÂ¥ÃÂáÃÂîÃÂî)
Finally, I propose that Cyberpromo and Agis be destroyed.
<URL:http://www.cyberpass.net/~fekete/>
|
|
