All Questions
66 questions
4
votes
2
answers
840
views
Upper bound for the first Hardy-Littlewood conjecture
About the Hardy-Littlewood conjecture by Terence Tao:
Conjecture 2 (Prime tuples conjecture, quantitative form) Let ${k_0 \geq 1}$ be a fixed natural number, and let ${{\mathcal H}}$ be a fixed ...
- 2,576
4
votes
1
answer
647
views
Did Erdős prove there are two primes $4a+1, 4b+3$ between between $n$ and $2n$?
http://mathworld.wolfram.com/ChoquetTheory.html
Is the claim in the link true? Here's the reference given there:
https://www.renyi.hu/~p_erdos/1934-01.pdf
Erdős proved that there exist at least one ...
- 193
10
votes
3
answers
1k
views
Quantitative and elementary proofs of the Prime Number Theorem
I would like to know two things: one, whether the best quantative bounds in the Prime Number Theorem are still basically those given by the Vinogradov-Korobov zero-free region? and two, whether there ...
- 1,687
1
vote
1
answer
600
views
reference on Dirichlet theorem on primes in arithmetic progression
I appreciate if you could help me to find a reference (and a proof).
Combining Dirichlet theorem on primes in arithmetic progression with Chebotarev densitiy theorem, we know that given two positive ...
- 934
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 ...
- 9,114
4
votes
0
answers
117
views
Best constant for Maier's theorem?
Maier proved that, for fixed $\lambda>1,$
$$
\limsup_{x\to\infty}\frac{\pi(x+\log^\lambda x)-\pi(x)}{\log^{\lambda-1}x}>1
$$
and in particular
$$
\limsup_{x\to\infty}\frac{\pi(x+\log^\lambda x)-\...
- 9,114
4
votes
1
answer
456
views
References to proofs of upper and lower bounds on the number of coprimes in an interval?
On the first page of the article "When the sieve works", the authors present upper and lower bounds for $S(T,T+x;\mathcal{E})$; the number of integers in the interval $(T,T+x]$ that are coprime to all ...
- 965
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 ...
- 6,974
6
votes
1
answer
367
views
Bounds re Asymptotic Formula for the Sum of Largest Prime Factors
I have a reference request related to the result :
$\sum_{n=2}^{x} P(n)$ ~ $\frac{\pi^2}{12}\frac{x^{2}}{log(x)}$ as $x \rightarrow \infty$
where $P(n)$ is the largest prime factor of the positive ...
- 71
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: ...
- 965
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{...
- 3,004
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\...
- 11.4k
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 ...
- 9,114
4
votes
1
answer
928
views
Primes and Ackermann's function
If $A(m,n)$ is Ackermann's function, and $c$ is a fixed integer, are there any heuristics/conjectures/obvious things that can be said about primes of the form $A(m,n)+c$, $m \geq 4$,at all?
EDIT:
I ...
- 1,075
2
votes
0
answers
318
views
Pierpont primes
A Pierpont prime is a prime $p$ that can be written as $$p=2^u 3^v + 1.$$
What is known about Pierpont primes? I'm not a number theorist, and the best I can find is
http://en.wikipedia.org/wiki/...
- 21
7
votes
4
answers
1k
views
Reference for the expected number of prime factors of n larger than n^alpha is -log alpha
Let $0 < \alpha < 1$ be a constant. The expected number of prime factors of a "random" integer near $n$ which are greater than $n^\alpha$ is $-\log \alpha$.
It's my understanding that (...
- 14k