Recent content by toddkuen

Not very. I am more interested in this concept as opposed to actual use. My interest is in the abstraction of making the twin primes the sieve. It goes along with the boxed prime idea I posted a while back. I make triples of three odds what is sieved in this case. But you could do it for...

I am interested in twin primes and have not been able to find a simple "sieve" type function to calculate them. I created my own. You can find it at this URL: http://www.just-got-lucky.com/math/TwinPrimeSieve_08102010_v01.pdf It calculates all the twins less than N. I also wrote a...

I was thinking of epsilon in terms of just enough primes (m) beyond Pn to complete the evens. k = (1/Pn+m) - (1/Pn)/(1/Pn), Pn * (1 + k) = Pm, epsilon >= k

Since you have to advance some integral number of primes past P to include all evens below 2P I don't see how arbitrarily small epsilons work. I calculate the missing evens below 109 (I guess its true for 6, 10, 14 and 26 as well but since those are easily checked by hand I forgot about them)...

Yes. Sorry about my notation. Given k represents 1.015 then it appears to me that k bounds the choices of p and q in an interesting way... I do not believe there are any other primes besides 19 and 109 that work where k = 1.

Yes - 3 (not 2) <= n <= P with p <= q <= P and p + q = 2n. (1) I have developed the following conjecture relative to this: There is a P2 such that for large values of P P <= P2 < 1.015P such that (1) generates all positive (thanks to Char Limit) evens less than or equal to 2*P.

For any given prime P double the prime, e.g., 17 * 2 = 34. Take all unique combinations of the primes from 3 to P, e.g., 3,5,7,11,13,17 and combine pairs in all possible ways, e.g., {3,3}, {3,5}, ..., {13,17}, {17,17}. Add the pairs to get the sums - this generates even numbers (excluding...

Not sure I follow. 31 is prime as is 29 - neither can express 56 in {3..31}...?

More specific than GC I think. While 34 is 17*2 no combination of primes from 3 to 17 can generate 32. The primes from 3 to 19 can generate all evens less than 19*2 = 38. Are there more besides 19 and 109?

Take a prime[n] and double it, i.e., e.g., Pn (n=7) so prime[7] is 17, doubled to 34. Take all unique arrangements of two primes from P2 (3) to P7 (17): {3,3}, {3,5}, {5,5}, ..., {13, 17}, {17,17} Add the pairs together, e.g., {3,3} = 3 + 3 = 6 Now eliminate duplicates, i.e., {5,5} and {3,7}...

To Office_Shredder - What my mistake does say is this: If the Goldbach Conjecture is false then it would be because the Bertrand prime would intersect on a column strike. The column strike always represents an odd multiple of a prime. So for primes p and q such that p + q = 2n we...

I had to run out yesterday but I gave your comment some thought. Yes - I thought about this and you are correct - its wrong in this regard. EDIT - I guess I am a little further because now I know there is a prime - I just can't prove it lines up... So the bottom line is this then - 1) there...

I believe it must because vertical columns under 3, for example, would not be covered for an intersection.

My name is Todd and I have a posted a proof of Goldbach's Conjecture. I have been looking around for a while to find a place to post it and this seems like a reasonable place to start. I have stopped by here before but never registered. The proof is...