Skip to main content

All Questions

Filter by
Sorted by
Tagged with
16 votes
1 answer
4k views

Order of magnitude of $\sum \frac{1}{\log{p}}$

Question: What is the order of magnitude of the following sum? $$ \sum_{\substack{p<n\\\text{$p$ prime}}} \frac{1}{\log{p}} $$ Additional information: Since $$ \sum_{\substack{p<n\\\text{...
Daniel Soltész's user avatar
11 votes
1 answer
1k views

The Bombieri Vinogradov Theorem restricted to moduli divisible by $k$

The Bombieri-Vinogradov Theorem states that given $A>0$, there exists $B>0$ such that for $Q=\sqrt{x}\left(\log x\right)^{-B},$ we have $$\sum_{q\leq Q}\max_{y\leq x}\max_{\begin{array}{c} a\...
Eric Naslund's user avatar
  • 11.4k
7 votes
1 answer
1k views

What would be the consequences of $\displaystyle{\lim\inf_{n\to\infty}p_{n+k}-p_{n}\sim k\log k}$?

The question is in the title: what would be the number theoretic consequences if we managed to establish the conjectured asymptotic equality $\displaystyle{\lim\inf_{n\to\infty}p_{n+k}-p_{n}\sim k\log ...
Sylvain JULIEN's user avatar
5 votes
1 answer
434 views

consecutive prime gaps and explicit bound

I am aware of the theorem that $p_{n+1}- p_n \leq n^{0.525}$ which is true for all sufficiently large numbers due to Baker, but if i want to make the implicit "for all sufficiently large numbers" ...
user avatar
8 votes
1 answer
811 views

Primes of the form $x^2 + y^2 + 1$

There are infinitely many primes of the form $x^2+y^2+1$, as proved by Bredihin. Motohashi improved the result by showing that there were $\gg x/\log^2 x$ such primes up to $x$. But we expect $\Theta(...
Charles's user avatar
  • 9,114
7 votes
0 answers
786 views

"Forthcoming paper" of Goldston-Graham-Pintz-Yıldırım

The above-named authors of [1] and its (significantly different) published version [2] write: In a forthcoming paper, we will show how the methods here can be extended to prove corresponding ...
Charles's user avatar
  • 9,114
7 votes
2 answers
1k views

Is there a von Koch-type theorem for the generalized Riemann hypothesis?

Helge von Koch proved in 1901 that the Riemann hypothesis is equivalent to the error term in the prime number theorem having the bound $$ \mid\pi(x)-\textrm{li}(x)\mid=O(\sqrt{x} \log x). $$ Q1: ...
user45947's user avatar
  • 965
6 votes
0 answers
149 views

Dickson's conjecture for Beatty sequences

A particular case of Dickson's Conjecture states that for $a_1,q_1,a_2,q_2$ with $(a_1,q_1)=(a_2,q_2)=1$, there are infinitely many $n$ for which $q_1 n + a_1$ and $q_2 n+a_2$ are both prime, provided ...
Joshua Stucky's user avatar
5 votes
2 answers
1k views

Error term in Mertens' third theorem

Mertens' third theorem states that: $$\prod_{\substack{ p \leq x \\ \text{p prime} }} \left( 1 - \dfrac{1}{p} \right) \sim \dfrac{e^{-\gamma}}{\log(x)}$$ Question: what is the best functions (...
Lagrida Yassine's user avatar
5 votes
1 answer
455 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 with at most two ...
Charles's user avatar
  • 9,114
5 votes
3 answers
809 views

Positive proportion of logarithmic gaps between consecutive primes

For $x, \lambda > 0$, define $$S_\lambda(x) := \#\{p_{n+1} \leq x : p_{n+1} - p_n \geq \lambda \log x\} ,$$ where $p_n$ is the $n$th prime number. It is known [1] that an uniform version of the ...
Kello's user avatar
  • 113
3 votes
1 answer
186 views

A sieve with two parameters

I am in need of a (relatively) general sieve with two parameters $y, z$. I am quite sure that on the literature there must be some result of the kind that I have in mind, probably a corollary of the ...
user avatar