I think my original logic is valid. Let me address your points in sequence:
“Successive iterations of this procedure show that for each increase in N to the next higher odd number, the minimum number of twin primes between 3 and (N squared – 2) increases by more than 1.”
The minimum number...
Thanks, I'll check out the websites you suggested. I'm still attempting to confirm the relationship between the length of a set of odd numbers and the minimum number of twin primes within that set.
Thanks, I should have stated how the division proceeds and what is done with each result.
Let N equal 7, so N^2-2 equals 47. The initial set of odd numbers is 3,5,7 . . . 47. So the initial set of “candidate twin primes” consists of 3-5, 5-7, 7-9 . . . 45-47. This is a total of 22 “candidate...
I’ve encountered a relationship that, if true, could show that there are an infinite number of twin primes. It involves the minimum number of twin primes to be found between 3 and any higher odd number squared. However, I don’t know if this relationship holds true in all cases.
We start with...