View Single Post
Old 2021-03-01, 18:22   #1
Dec 2020

7 Posts
Default Twin prime bounds

Upper and lower bounds on the number of twin primes in arbitrary intervals were conjectured with an efficient method of verification (computational complexity ~ log log d). The bounds were verified up to p2 of the first 1000 primes.

It would be interesting to: 1) verify the bounds independently; and 2) to still higher intervals.
Note: the method iterates over all possible positions and so may not be suitable for searches of very large twins.
Please feel free to pm for more information.
gnostique is offline   Reply With Quote