1*1
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 two numbers composing a product in a row adds up to twice the square root of the perfect square contained in 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?
2006-08-09
07:42:07
·
3 answers
·
asked by
Ed S
1