daniel
Reputation
5,027
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
2 12 43
Newest
Impact
~128k people reached

• 29 helpful flags
• 1,940 votes cast

# 1,466 Actions

 Feb 26 asked Do all primes occur as a factor of $p_{k}-2$ for some k? Feb 26 answered Can you provide us an understandable and detailed explanation of the relationship between prime numbers and equidistibution theory? Feb 24 comment Finding a number of twin primes less than a certain number Zhang's theorem is also worth mentioning but I think (4) is far enough afield. Feb 24 revised Finding a number of twin primes less than a certain number added 375 characters in body Feb 24 revised Finding a number of twin primes less than a certain number added 2 characters in body Feb 24 comment Twin-prime sieve Won't edit this again but maybe the sieve works fine and it n just cannot be proven to increase as as $p_k$ increases w/o bound. Would still be interested in an answer that discusses the difficulties involved. Feb 24 revised Finding a number of twin primes less than a certain number added 47 characters in body Feb 24 answered Finding a number of twin primes less than a certain number Feb 22 revised Twin-prime sieve added 11 characters in body Feb 22 revised Twin-prime sieve added 20 characters in body Feb 22 revised Twin-prime sieve added 142 characters in body Feb 20 comment Is $a\pi(x) \ge \pi(ax)$ where $a$ is a positive integer Will try to fix this up soon. These are really modest bounds. Feb 20 answered Is $a\pi(x) \ge \pi(ax)$ where $a$ is a positive integer Feb 20 accepted Numbers $n$ with $n,n+2$ coprime to $p_k\#$ on $[1, p_k\#]$ Feb 20 revised Twin-prime sieve edited title Feb 20 asked Twin-prime sieve Feb 20 comment How does sieve that Chen used to prove Chen's theorem work? Haberstam and Richert's Sieve Methods (Dover) contains a relatively accessible version of Chen's theorem in the last chapter (it appeared as they were going to press). If you can get through the first 60 pages of preparatory material you will be in a good position to understand Chen's argument. Feb 19 asked Numbers $n$ with $n,n+2$ coprime to $p_k\#$ on $[1, p_k\#]$ Feb 11 comment Why are very large prime numbers important in cryptography? If you have a question the site functions best if you post it as a question rather than an answer. Feb 7 comment Using the Brun Sieve to show very weak approximation to twin prime conjecture Halberstam and Richert in Sieve Methods (Dover, 2011) prove using Brun's sieve that there are infinitely many p such that p+2 has at most 8 prime factors. Including some introductory material the exposition takes 67 pages. The key is their definition of the characteristic function on p. 58. The basic idea is simple enough but doesn't look like it lends itself to anything one could describe as a "straightforward exercise."