goldbach'sconjecture

Goldbach's Conjecture

For every integer N, there exists at least one pair of primes, P and Q, s.t. P+Q=2N

Disproof:

Consider the n-1 consecutive integers:

n!-2, n!-3, n!-4, ...n!-n

These are all composite.

Let n->99999...

There are an infinite number of consecutive composite integers before n becomes infinite (1)

Suppose P+Q=2N

=>P=2N-Q

Therefore P is Q places before 2N on the numberline.

Let N->99999...

(1)=>P is composite

Copyright 1997 James Wanless