(Not a Proof of) Goldbach's Conjecture

In summary, the conversation revolves around the Goldbach conjecture and the observation that every pair of primes is equidistant from half of the even number they sum to. The implications of this observation are discussed, including the possibility of using it to prove the conjecture and the question of whether it has been proven for all infinite subsets of even numbers. The conversation ends with the appreciation of the new discovery.
  • #1
middleCmusic
74
0
I was doing some thinking about good old Goldbach and noticed that every pair of primes was the same distance away from half of the even number.

For example,

3 + 5 = 8 and |4 - 3| = 1 = |4 - 5|
3 + 13 = 16 and |8 - 3| = 5 = |8 - 13|
7 + 17 = 24 and |12 - 7| = 5 = |12 - 17|
19 + 23 = 42 and |21 - 19| = 2 = |21 - 23|
23 + 41 = 64 and |32 - 23| = 9 = |32 - 41|

Now, this is not anything surprising. It's pretty obvious if you just think of the number, say 18 and divide it by two (9 + 9 = 18) and realize that to get other pairs that sum to 18, you simply subtract from the first and add to the second...

9, 9 --> 8, 10 --> 7, 11 (primes) --> 6, 12 --> 5, 13 (primes) --> 4, 14 --> 3, 15 --> 2, 16

Anyway, that's enough introduction. This is not a proof, but I wasn't sure if there was something novel about it or if I was simply fooling around with algebra:

Goldbach's conjecture supposes that for any even number 2n, there are two primes that sum to it ( 2n = p1 + p2 )

This implies that...

|n - p1| = |n - p2|
«» (n - p1)2 = (n - p2)2
«» -2np1 + p12 = -2np2 + p22
«» p12 - 2np1 + np2 - p22 = 0
«» p12 - 2(n(p1 - p2)) - p22 = 0
«» 0 = (p1 + p2)(p1 - p2) - 2n(p1 - p2)
«» 0 = (p1 + p2 - 2n)(p1 - p2)
«» p1 = p2 or 2n = p1 + p2

Does the fact that you get back the Conjecture mean anything or is it meaningless because a) it doesn't really prove the prime part of the argument or b) it was obtained by assuming the conjecture in the first place sort of... Perhaps there would be some way to use induction to our advantage here to actually prove it?

Sorry if this was a waste of your time - I'm new at this game.
 
Physics news on Phys.org
  • #2
It does not tell us anything about the validity of Goldbach's conjecture, because it does:
Any 2 even primes or 2 odd primes -> sum is an even number

While his conjecture is
Any even number >= 4 = sum of 2 primes

A implies B
is not equivalent to
B implies A

If a positive integer is a prime other than 2, then it is odd
is not equivalent to
If a positive integer is odd, then it is a prime other than 2

If/then -- implication
false -> false -- true
false -> true -- true
true -> false -- false
true -> true -- true

False can imply true, but true cannot imply false.
 
  • #3
Interesting... Does anybody know if the Goldbach conjecture was proven for any other infinite subset of even numbers, or it is still just the obvious 2*p? was it proved for 2*p with different combination, other than p + p? Thank you in advance.
 
  • #4
Wow, this is an interesting discovery. Certainly not a waste of my time. I will be doing some thinking, but I have nothing to contribute yet. Thanks for sharing.
 
  • #5
You may be able to use this to prove every number can be written as the arithmetic mean of primes, which would prove Goldbach's by inclusion.
 
  • #6
lpetrich said:
Any 2 even primes or 2 odd primes -> sum is an even number
Last time I checked there is only one even prime number... If a number is even and greater than 2 it cannot be prime. Though Petrich is right. Proving Sum -> Even is easy. Even -> Sum is not.
 
  • #7
That's right about even primes, though my statement is still correct. I will concede that its wording may have been misleading.
 

1. What is Goldbach's Conjecture?

Goldbach's Conjecture is a mathematical conjecture that states that every even number greater than 2 can be expressed as the sum of two prime numbers.

2. Is Goldbach's Conjecture proven?

No, Goldbach's Conjecture has not been proven. It remains an unproven conjecture since it was first proposed by German mathematician Christian Goldbach in 1742.

3. What progress has been made towards proving Goldbach's Conjecture?

Many mathematicians have attempted to prove Goldbach's Conjecture, and there have been partial results and proofs for specific subsets of even numbers. However, a complete proof for all even numbers remains elusive.

4. Are there any counterexamples to Goldbach's Conjecture?

No, there are no known counterexamples to Goldbach's Conjecture. Every even number that has been tested has been found to follow the conjecture, but this does not constitute a proof.

5. Why is Goldbach's Conjecture important?

Goldbach's Conjecture has been a long-standing and famous unsolved problem in mathematics, and its proof would have significant implications for the study of prime numbers and number theory. It has also inspired many other conjectures and theories in mathematics.

Similar threads

  • Programming and Computer Science
Replies
4
Views
826
  • Precalculus Mathematics Homework Help
Replies
4
Views
2K
  • Precalculus Mathematics Homework Help
Replies
6
Views
1K
  • Engineering and Comp Sci Homework Help
Replies
32
Views
3K
  • Linear and Abstract Algebra
Replies
6
Views
7K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • General Math
Replies
24
Views
2K
  • Linear and Abstract Algebra
Replies
6
Views
10K
  • Precalculus Mathematics Homework Help
Replies
14
Views
1K
  • MATLAB, Maple, Mathematica, LaTeX
Replies
4
Views
3K
Back
Top