20190225, 22:32  #1 
Feb 2019
3 Posts 
I found a sieve to search all pairs of twin primes
Through the use of some sequences that make up a useful sieve to calculate all the pairs of first twins it proves that they are endless.
Sieve_for_Oeis_A077800_Twin_prime_conjec.pdf 
20190225, 23:25  #2  
"Serge"
Mar 2008
Phi(3,3^1118781+1)/3
5·1,811 Posts 
Will the colors in this PDF make my eyes bleed?
Quote:


20190309, 06:14  #3  
Feb 2019
11101_{2} Posts 
Quote:


20190309, 14:09  #4 
Feb 2017
Nowhere
2×23×71 Posts 
This may already be known, but a cursory search failed to turn it up. I did find a lot of larger pairs of twin primes, though, so a least pair greater than 10^1000 certainly exists.
Judging from, e.g. Twin Prime Statistics, they could be found as follows: 1) Sieve a "suitably" long interval (10^1000, 10^1000 + N) to eliminate all numbers with "small" factors. 2) Subject any remaining pairs differing by 2, starting with the smallest, to a pseudoprime test. 3) If you're really ambitious, subject any twin pseudoprimes you find to a rigorous primality test until you get a pair of proven primes. With numbers of this size, this might take a while. Based on asymptotic estimates and my own sloppy estimates, you'd probably have to take N on the order of 10^7 or 10^8 to stand a decent chance of success. I have no idea what a good sieving limit for "small" factors would be. Last fiddled with by Dr Sardonicus on 20190309 at 14:15 Reason: Clarification 
20190309, 14:40  #5 
"Dana Jacobsen"
Feb 2011
Bangkok, TH
2·11·41 Posts 
Sigh, I now realize this was a test for the OP to show how well his method works. Well, ok um you can use the rest of this as a comparison I guess.
10^1000 + 9705091 is the smaller of the pair. I'm sure it's online somewhere. It took about 2 minutes for my Macbook to find it. They are ES BPSW, and then I let Pari/GP prove them, a little over 1 minute each. The software I used have chosen 80000 * log_{2}(high) as the depth, purely because empirically that seemed to work well at a variety of sizes. Each candidate that passes this sieve is subjected to MR base 2 for both low and high, then ES Lucas for both low and high. It took 2.5 seconds for a width of 1e5, 13s for 1e6, 124s for 1e7 where it found one (I just ran it multiple times with a bigger window, redoing the previous part). Last fiddled with by danaj on 20190309 at 14:48 
20190416, 22:11  #6 
Feb 2019
3 Posts 
(Start)
A100319+1 (Even numbers m such that at least one of m1 and m+1 is composite) can be obtained as the union of: 3*A005818; 5*A038179 without 2; 7*A007310 without 1; A038511 A025584 without 2, 3. (End)  The sequence A038511 can be obtained by multiplying each term of A008364 , except {1}, by itself and by all subsequent terms. Rewrite the terms in ascending order.  (Start) To obtain A025584 (Primes p such that p2 is not a prime): Write all terms of the form 2k + 7 and delete all terms of the form (6k + (1) ^ k + 13)/2 [without A121764] and all terms of A092256 Finally, add 2 and 3. (End) To calculate A121764 (Single, or isolated or nontwin primes of form 6n + 1) consider all term of A092256(n) + 2 except those in common with: A038511, 5*A038179, and 7*A007310. A092256 (Nonprimes of form 6k+5) is the union of: numbers of the form 5*(6k + 1) , numbers of the form 7*(6k + 5), and terms of A038511 of the form 3*k+2  Last fiddled with by Pietro Maiorana on 20190416 at 22:15 
20190926, 21:03  #7 
Feb 2019
3_{16} Posts 
Each pair of odd twin primes (Oeis A077800) has an even median value.
The nonmedian even values (complementary to Oeis A014574) are found in the sequence Oeis A100319 (Even numbers m such that at least one of m1 and m+1 is composite) According to my theory, A100319+1 can be divided into 5 infinite subsequences a) 3*A005818; b) 5*A038179 without 2; c) 7*A007310 without 1; d) A038511; e) A025584 without 2, 3. The first three subsequences can be rewritten respectively as: a) 9+6*(n1) b) 5*(floor((41/21  (3 mod n))^(3*n+5)) + 3*n  4) c) 7/2*(6*k+(1)^k+9) The sequence d) A038511 can be obtained by multiplying each term of A008364, except {1}, by itself and by all subsequent terms. Rewrite the terms in ascending order. where A008364 is equal to a(n) = 35n/8 + O(1).  Charles R Greathouse IV, Sep 14 2015 (see Oeis) e) To obtain A025584 (Primes p such that p2 is not a prime): Write all terms of the form 2k + 7 and delete: all terms of A092256 and all terms of the form (6k + (1) ^ k + 13)/2 [without A121764] (Start) A092256 (Nonprimes of form 6k+5) is the union of: numbers of the form 5*(6k + 1), numbers of the form 7*(6k + 5), and terms of A038511 of the form 3*k+2 (End) (Start) To calculate A121764 (Single, or isolated or nontwin primes of form 6n + 1) consider all term of A092256+2 except those in common with: d) A038511, b) 5*(floor((41/21  (3 mod n))^(3*n+5)) + 3*n  4), c) 7/2*(6*k+(1)^k+9); (End) QUESTION: Why did I calculate A100319 + 1 and not A100319? ANSWER: Because some subsequences used in A100319 + 1 as it was possible to see in the reasoning have been reused in the construction for a subsequence in A025584 (exactly Oeis A121764 Single, or isolated or nontwin primes in the form 6n + 1)  SECOND METHOD  Consider only the sequence A025584 (Primes p such that p2 is not a prime): To obtain A025584 (without 2, 3) Write all terms of the form 2k + 7 and delete: all terms of A092256 and all terms of the form (6k + (1) ^ k + 13)/2 [without A121764] (Start) A092256 (Nonprimes of form 6k+5) is the union of: numbers of the form 5*(6k + 1), numbers of the form 7*(6k + 5), and terms of A038511 of the form 3*k+2 (End) (Start) To calculate A121764 (Single, or isolated or nontwin primes of form 6n + 1) consider all term of A092256+2 except those in common with: a) A038511, b) 5*(floor((41/21  (3 mod n))^(3*n+5)) + 3*n  4), c) 7/2*(6*k+(1)^k+9); (End) While A038511 can be obtained by multiplying each term of 35n/8 + O(1) , except {1}, by itself and by all subsequent terms. Rewrite the terms in ascending order. Well, if you remove from the infinite list of prime numbers, the values of A025584 can be obtained A006512 "Greater of twin primes" 
20190926, 22:55  #8 
Jun 2015
Vallejo, CA/.
2^{2}×239 Posts 
......
Last fiddled with by rudy235 on 20190926 at 23:08 Reason: duplicate 
20190926, 23:07  #9  
Jun 2015
Vallejo, CA/.
956_{10} Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
find very easy twin prime in the infamy twin primes  hal1se  Miscellaneous Math  13  20181105 16:34 
Search for all amicable pairs up to 2^64  Sergei Chernykh  Aliquot Sequences  37  20180127 19:23 
Top 3 twin found!  MooMoo2  Twin Prime Search  4  20150713 23:30 
Twin: new sieve  JohnFullspeed  Twin Prime Search  6  20110604 06:07 
Twin prime search?  MooooMoo  Twin Prime Search  115  20100829 17:38 