11
votes
1answer
417 views
Least prime in an arithmetic progression and the Selberg sieve
My question concerns a technical step in the proof of Linnik's theorem on the least prime in an arithmetic progression, as presented in Chapter 18 of Iwaniec-Kowalski: Analytic num …
5
votes
1answer
202 views
Large gaps between P2s
Gaps between consecutive primes are $O(n^{\theta+\varepsilon})$ for $\theta=0.525$ and any $\varepsilon>0.$ I was wondering if a better result is known for gaps between numbers wit …
16
votes
3answers
592 views
Are sets with similar asymptotic behavior as the primes necessarily finite additive bases?
The set of primes $\mathbb{P}$ has many interesting properties in additive number theory and some of the most famous open problems about $\mathbb{P}$ are the well-known Goldbach's …
7
votes
1answer
640 views
Best possible sieves for the jacobsthal problem, linear programming, and the prime 2
Background/Motivation
Gerhard Paseman asked a question about bounds on the Jacobsthal function a while ago, which made me curious about whether the known bounds are best possible. …
2
votes
1answer
209 views
10 factors for x^2 coefficient in quadratic sieve?
I wrote a quadratic sieve and I tried plugging in all the same parameters as the wikipedia article says msieve uses: http://en.wikipedia.org/wiki/Quadratic_sieve#Parameters_from_re …

