Goldbach's Conjecture

Article View: sci.math.num-analysis

Article #1247

Back to sci.math.num-analysis Previous Next

#1247

From: Paul Bruckman
Date: Wed, 09 Sep 1998 00:00

10 lines
1556 bytes

It seems to me that the natural tool that might be used to prove
Goldbach's Conjecture is the square of the series of x^p, where the
powers are the odd primes.  This produces a series of terms A(n)* x^2n,
going from n=3 to inf. , and GC would then be equivalent to proving that
A(n) > 0 for all such n.  Of course, A(n) is odd iff n is prime,
corresponding to the representation 2n = n+n, which can only occur in
one way, whereas all other representations of 2n occur in pairs.  

Has anyone thought about this approach, and if so, does anyone see any
kind of revelation that might prove A(n)>0 for all n?  Paul Bruckman

Technical Details

Message-ID: <6t7spc$djv$1@news-2.news.gte.net>

Path: arc1-ca.pugleaf.net!unknown!not-for-mail

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 10d67e,def68332262ce117,start
X-Google-Attributes: gid10d67e,public
X-Google-Thread: 109d8a,def68332262ce117,start
X-Google-Attributes: gid109d8a,public
X-Google-Thread: 10d29f,def68332262ce117,start
X-Google-Attributes: gid10d29f,public
X-Google-Thread: 107079,def68332262ce117,start
X-Google-Attributes: gid107079,public
From: Paul Bruckman <aardwolf@gte.net>
Subject: Goldbach's Conjecture
Date: 1998/09/09
Message-ID: <6t7spc$djv$1@news-2.news.gte.net>
X-Deja-AN: 389768222
Content-Transfer-Encoding: 7bit
Approved: Daniel Grayson <dan@math.uiuc.edu>, moderator for sci.math.research
Organization: gte.net
X-Auth: D715C517078CC8824AD68491
Content-Type: text/plain; charset=us-ascii
Mime-Version: 1.0
Reply-To: aardwolf@gte.net
Newsgroups: sci.math.num-analysis,sci.math.research,sci.math,aus.mathematics
Originator: dan@orion.math.uiuc.edu