1*1(adsbygoogle = window.adsbygoogle || []).push({});

1*3 2*2 3*1

1*5 2*4 3*3 4*2 5*1

1*7 2*6 3*5 4*4 5*3 6*2 7*1

*

*

*

etc.

If we go on constructing the pattern of numbers above, will each row contain atleast 1 product of two odd prime numbers? If the answer to this can be proven to be yes, then would this prove also Goldbach’s conjecture considering the fact that the sum of any numbers in a row adds up to twice the square root of the perfect square of that row, and that all even numbers greater then 4 are accounted for in the matrix?

For example, in the row that contains the perfect square 2*2, we have 3+1 = 4, with 3 and 1 odd prime numbers. In the row containing the perfect square 3*3 we have 5+1 = 6, with 5 and 1 odd prime numbers…etc.

Might this be related to Goldbach’s conjecture?

Inquisitively,

Edwin G. Schasteen

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Question Regarding Goldbach's Conjecture

Loading...

Similar Threads for Question Regarding Goldbach's | Date |
---|---|

A Question regarding root of Bring quintic not expressible with radicals | Dec 2, 2016 |

Interesting question regarding Lie algebras | Sep 29, 2013 |

Quick question regarding isomorphic groups? | Sep 2, 2013 |

Question regarding Kronecker Delta | Aug 29, 2013 |

Question regarding cross products and determinants | Sep 11, 2012 |

**Physics Forums - The Fusion of Science and Community**