Goldenbach's conjecture states that any even number is the sum of two primes only. If we consider the theorem true, does this have any strong conjecture for the density of primes in a given partition? e.g. in a given interval/partition 2n-4n, how many primes must exist in the preceding partition/interval n-2n? ie there can't be zero primes in this interval?! Sorry about the lack of formal mathematical symbolism, but I lack any formal training and am still struggling with the formal propositions concerning the properties of simple integers- cheers!
2006-11-10 03:10:35 · 9 answers · asked by troothskr 4 in Science & Mathematics ➔ Mathematics
Because the number is even, say 2N, then there must be at least one prime between 1 and N and another prime between (N+1) and 2N because these are the 2 numbers that add together to give 2N. However, what if the number N is 2P for P a prime? Then, the two numbers that satisfy the Goldenbach conjecture are P and P.
So, either 2N = 2P for P a prime, therefore N is a prime
or 2N = P1 + P2 for P1
Therefore, we conclude that for any even number 2N, there must exist at least 1 prime on the interval [N, 2N)
2006-11-10 03:19:43 · answer #1 · answered by tbolling2 4 · 0⤊ 0⤋
you may properly be waiting to unravel a undertaking in differental equations, yet once you do no longer understand the form of life of the era which turn into being written approximately you may't resolve the undertaking. The era of the Roman Empire turn into very adverse in arithmetic. If some thing got here approximately in 3 days, they started with the help of counting the 1st day as at some point. they did no longer be conscious of a thank you to degree an area of elapsed time. They weren't very precise in recording the style of days or the cases the **** crowed. Is it significant?
2016-12-28 17:59:38 · answer #2 · answered by guillotte 3 · 0⤊ 0⤋
Sorry, I can't be of enormous help here, it is beyond my math skills. But I did find the following link on wiki. It appears that you were misspelling his name so maybe if you google Goldbach's conjecture you will be able to get a more rigorous answer.
Good luck
2006-11-10 03:21:48 · answer #3 · answered by Will 4 · 0⤊ 0⤋
Though not related to Goldbach comjecture you can refer to the link beow to kow density of prime number
2006-11-10 03:16:11 · answer #4 · answered by Mein Hoon Na 7 · 0⤊ 0⤋
There would be a minimum of 2. This is a very good conjecture that I had not seen before.
2006-11-10 03:20:09 · answer #5 · answered by Nelson_DeVon 7 · 0⤊ 1⤋
7 xx
2006-11-10 03:14:23 · answer #6 · answered by Anonymous · 0⤊ 2⤋
Frankly my dear I don't giver a damn.
2006-11-10 10:28:57 · answer #7 · answered by bo nidle 4 · 0⤊ 1⤋
Give me some of what you are on. LSD must have improved!
2006-11-10 03:15:52 · answer #8 · answered by Anonymous · 0⤊ 2⤋
who cares its poets day
2006-11-10 03:22:16 · answer #9 · answered by chunkie_monkee 2 · 0⤊ 3⤋