# Tagged Questions

**1**

vote

**0**answers

127 views

### Arguments for the second Hardy–Littlewood conjecture being false?

Assume that $x,y > 2$, and that $x<y$. Then the second Hardy–Littlewood conjecture states that
$$\pi(x + y) - \pi(y) \leq \pi(x).$$
We can easily justify this heuristically, since
$$
...

**17**

votes

**1**answer

597 views

### The conjecture of Montgomery and Soundararajan on primes in short intervals: Empirical inconsistencies?

Assume that $y/ \log x \rightarrow \infty$ and that $y/x \rightarrow 0$. Then, from a conjecture by Montgomery and Soundararajan, we expect the number of primes in the interval $[x,x+y]$ to be ...

**0**

votes

**0**answers

252 views

### Arithmetic progression and average of two prime numbers

Let $A=(a_n : n \in \mathbb{N})$ be the sequence given by:
$$
\ a_n = a_1 + (n - 1)d,\quad a_1,\ d,\ n \in \mathbb N,\quad d\gt a_1,\quad \gcd(a_1,\ d)=1.
$$
For all terms of $A$ greater than $\ ...

**4**

votes

**1**answer

144 views

### Log weight removal in general (weaker) prime number theorem

Let $a_n$ be a sequence of non-negative numbers.
Assume that $$\limsup _{X\to \infty}\frac{\sum_{p\leq X} a_p\log p}{X}\leq 1.$$
Can we prove that $$\limsup _{X\to \infty}\frac{\sum_{p\leq X} ...

**4**

votes

**1**answer

187 views

### Uniformity of the distribution of the prime numbers on the prime residue classes (mod $m$)

Given positive integers $m$, $r$ and $n$, let $\pi(m,r,n)$ denote the number
of prime numbers $p \leq n$ in the residue class $r$ (mod $m$).
Further let $1 = r_1 < r_2 < \dots < ...

**2**

votes

**0**answers

199 views

### Relation between Maier's theorem and a conjecture of Montgomery and Soundararajan

Let us consider the number of primes in the interval $[N,N+h]$, with $h\leq N$. According to the answer given by Lucia to a previous question on the distribution of primes, it is natural to consider ...

**1**

vote

**0**answers

93 views

### Prime counting function with a form of finite product using perron's formula

There's a form of complex integral what Riemann obtained to finding $\pi (x)$,
$$ \pi^{*}(x)=\int_{L}\frac{\log \zeta (s)}{s}x^{s}ds, (1)$$
we already know that it lead us to the Prime Number ...

**7**

votes

**1**answer

391 views

### Major arcs in the proof that every odd number is the sum of at most 5 primes

In his proof that all odd numbers greater than 1 are the sum of at most 5 primes, Terence Tao uses one large major arc around 0 rather than small ones around the rationals, which I am more accustomed ...

**3**

votes

**1**answer

145 views

### Wiener-Ikehara tauberian theorem and order of pole at s=1

In the introduction to Akshay Venkatesh's thesis "Limiting Forms of the Trace Formula" we have the following statement :
"For, in summing over primes, the limit
...

**7**

votes

**1**answer

330 views

### Prime races à la Mertens

I have just read the nice survey by Granville and Martin about prime races.
I wonder what happens if one changes the rules for the prime races as follows.
Fix $q$ a modulus (an integer $>1$). For ...

**11**

votes

**1**answer

383 views

### Roots of unity near 1 in Z / p Z

Let $r \ge 3$ be a fixed integer. I'm interested in primes p such that no integer in the interval $(-\sqrt{p}, \sqrt{p})$, except $1$ (and $-1$ if $r$ is even), is an r-th root of unity modulo p.
The ...

**6**

votes

**0**answers

193 views

### Does the Maynard-Tao Theorem apply to general tuples of linear forms?

In the paper http://arxiv.org/pdf/1311.5319v1.pdf the author states the following theorem, which he attributes to Maynard and Tao.
For any integer $m > 2$, there exists an integer
$k = k(m)$ such ...

**3**

votes

**1**answer

403 views

### When does Merten's product theorem accurately estimate the number of coprimes in an interval?

Assume an arbitrary $x$ and let $z$ be smaller than $y$, where $y$ is the length of the interval $[x,x+y]$. What I would like to know is:
Let $W(z)=\prod_{p\leq z}\left(1-\frac{1}{p}\right)$. For ...

**4**

votes

**1**answer

423 views

### Lines in image; are they significant to prime numbers if so how?

Amateur math question. I was playing around generating some 2D images, and wondered what it would look like if placed $P_{i}$ dots on a circle with diameter of $i$ for increasing values of $i$, where ...

**10**

votes

**1**answer

448 views

### Chebotarev density theorem for $k$-almost primes

Consider a finite Galois extension $L$ of $\mathbb Q$, of Galois group $G$. Let $k \geq 1$ be a fixed integer. Let $D$ be a subset of $G^k$ invariant by conjugation and by the natural action of the ...

**4**

votes

**0**answers

299 views

### About sign changes of Li(x)-π(x)

Given a constant $C$, which are the best known upper bounds for the number of sign changes
of the function
$$
f: \mathbb{N} \rightarrow \mathbb{R}, \ \ x \mapsto {\rm Li}(x)-\pi(x)
$$
in the range ...

**0**

votes

**0**answers

99 views

### In this prime counting identity, can this limit of a sum be expressed as integrals?

Here's the identity I'm working with.
$E_{0}(n,b) = 1$
$E_{k}(n,b) = \displaystyle\sum_{j=2}^{\lfloor n \rfloor}E_{k-1}(\frac{n}{j},b)-b \sum_{j=1}^{\lfloor \frac{n}{b} \rfloor}E_{k-1}(\frac{n}{j ...

**6**

votes

**1**answer

435 views

### Can the Brun-Titchmarsh theorem be improved when the modulus is smooth?

For $q,a$ relatively prime, let $\pi(x,q,a)$ denote the number of primes less than $x$ which are congruent to $a$ modulo $q$. The Brun-Titchmarsh theorem states that $$\pi(x,q,a)\leq ...

**21**

votes

**2**answers

1k views

### What is the crucial difference the Maynard/Tao approach and Goldston-Pintz-Yildirim that extends to prime k-tuples with $k>2$

Suppose $m$ is a positive integer. A quantity of interest is
$$
H_m = \liminf_{n\to\infty} \left(p_{n+m} - p_n \right)
$$
The twin prime conjecture, is, of course $H_1 = 2$, the the prime k-tuples ...

**5**

votes

**1**answer

454 views

### Other implications of Zhang's method

I have been reading a bit about Zhang's proof and the associated Polymath8 project.
Though Tao's high level summary
...

**7**

votes

**1**answer

440 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}
...

**8**

votes

**1**answer

345 views

### Least prime $p$ such that an irreducible polynomial of degree $n$ has no root modulo $p$?

This question is inspired by an old question of Greg Kuperberg, about how small is the first prime $p$ which makes a given monic polynomial $P$ with integral coefficient have a (simple) root modulo ...

**16**

votes

**1**answer

746 views

### Infinitely many primes, and Mobius randomness in sparse sets

Problem 1: Find a (not extremely artificial) set A of integers so that for every $n$, $|A\cap [n]| \le n^{0.499}$, ($[n]=\{1,2,...,n\}$,) where you can prove that $A$ contains infinitely many primes.
...

**8**

votes

**1**answer

530 views

### Density of prime pairs whose gap is less than the average gap

By the prime number theorem we know that the "average gap" between the first $n$ primes is $\ln p_n$. I would like to know the density of consecutive prime pairs whose gap is less than the average gap ...

**1**

vote

**1**answer

153 views

### Behavior of a quantity related to Fermat's 4n + 1 Theorem

One of Fermat's theorems states that if $p = 4n + 1$ for some integer $n$, then $p$ can be expressed uniquely as a sum of two squares, $p = a^2 + b^2$. I am working on a problem and I would like to ...

**3**

votes

**1**answer

358 views

### Heuristic for Montgomery's conjecture

This is my third question on this site regarding Montgomery's conjecture -- and I apologize
if this is too much -- but I am still not understanding well why this conjecture is believed to be true.
...

**62**

votes

**6**answers

6k views

### Does Zhang's theorem generalize to $3$ or more primes in an interval of fixed length?

Let $p_n$ be the $n$-th prime number, as usual:
$p_1 = 2$, $p_2 = 3$, $p_3 = 5$, $p_4 = 7$, etc.
For $k=1,2,3,\ldots$, define
$$
g_k = \liminf_{n \rightarrow \infty} (p_{n+k} - p_n).
$$
Thus the twin ...

**16**

votes

**1**answer

4k views

### Tightening Zhang's bound

Inspired by a blogpost by Scott Morrison and ongoing discussion there I decided to create this community wiki to track progress on the original bound of Yitan Zhang.
The original bound was ...

**4**

votes

**1**answer

218 views

### Estimate on the prime-counting function $\psi(x)$.

There is an elementary statement that I believe I have read somewhere, but I can't remember where. I'd like to know if the statement is correct (in which case it is surely standard) and if so, where I ...

**6**

votes

**6**answers

792 views

### Sequences equidistributed modulo 1

Let $\alpha$ be any positive irrational and $\beta$ be any positive real. We have the following results.
H. Weyl (1909): The fractional part of the sequence $\alpha n$ is equidistributed modulo 1.
...

**3**

votes

**1**answer

267 views

### Least non primitive root

There is an abundant literature, and even here on MO no shortage of questions, on the question of the smallest prime primitivee root modulo $q$ (where $q$ is a prime, or more generally
an odd prime ...

**4**

votes

**3**answers

268 views

### A divergent series related to the number of divisors of of p-1

Let $d(n)$ denote the number of divisors of $n$. Is it known that the series
$$\sum_{p \text{ prime}} \frac{1}{d(p-1)}$$
diverges?
This would follow immediately from the Sophie Germain Conjecture. ...

**1**

vote

**1**answer

182 views

### What are the best known lower and upper bounds for the second Chebyshev function $\psi(x)$

I was reading through Jitsuro Nagura's proof that there is always a prime between $x$ and $\frac{6x}{5}$ when $x \ge 25$.
In the paper, he uses the following bounds for the second Chebyshev function ...

**7**

votes

**0**answers

264 views

### Montgomery's conjecture and lower bound on certain Fourier transform.

Recently I have come across the following question, while meditating about Matt Young's answer to this question of mine, explaining the heuristic (or at least, one possible heuristic) behind ...

**27**

votes

**1**answer

896 views

### Prime Number Races in 2 Dimensions

Is the mapping $$f: \ \mathbb{N} \rightarrow \mathbb{Z}[i], \ \ \ n \ \mapsto
\sum_{2 < p \leq n \ {\rm prime}} e^{\frac{p-1}{4} \pi i}$$ surjective?
In 1999, when I was an undergraduate student, ...

**7**

votes

**1**answer

557 views

### Least prime primitive root

For $p$ a prime number, let $G(p)$ be the least prime $q$ such that $q$ is a primitive root mod $p$, that is $q$ generates the multiplicative group $(\mathbb Z/p\mathbb Z$)* .
Is it known that ...

**2**

votes

**1**answer

379 views

### The tightest prime zipper

Define a prime zipper as an increasing function $f(n)$ mapping $\mathbb{N}$ into $\mathbb{N}$
with the property that, for every $n \ge 1$, there is at least one prime within the
inclusive interval $[ ...

**5**

votes

**2**answers

313 views

### Density of integers $n$ whose totient $\varphi(n)$ is larger than $\alpha n$

Fix $0 < \alpha < 1$ a real. Let $S_\alpha$ the set of integers $n \geq 1$ such that be $\phi(n)>\alpha n$. For $x>0$, let $S_\alpha(x)$ be the number of positive integers $n$ less han $x$ ...

**9**

votes

**1**answer

540 views

### Prime Power Gaps

In 2000, Baker, Harman and Pintz proved that there is always a prime in
the interval $(n-n^{0.525}, n)$. There are also conditional results
implying smaller intervals. Nevertheless, I could not find ...

**13**

votes

**1**answer

810 views

### Small primes in arithmetic sequences

Fix an integer $a>1$. For $n \geq 1$ an integer, let $\pi_{n,1}(an)$ the number of primes
$p \leq an$ such that $p \equiv 1 \pmod{n}$, and $\pi(an)$ the number of all primes $p \leq an$. Let
...

**5**

votes

**1**answer

224 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 ...

**5**

votes

**3**answers

620 views

### Better error bounds for partial sums of reciprocals of primes?

One of Mertens' theorems gives that
$$\sum_{ p \text{ prime,} p \leq k } 1/p - \log{\log{k}} = B + E(k)$$
where $B$ is a constant near $0.26$ in value and $E(k)$ is an error
term whose size is ...

**6**

votes

**2**answers

513 views

### On a sum involving prime numbers

I find myself needing the asymtotics of the following summation for my work. Let $a$ be a positive real number and $p_n$ be the $n$-th prime.
$$
\sum_{k=1}^{n} [k^a - (k-1)^a]p_k
$$
At $a=1$, this ...

**6**

votes

**1**answer

552 views

### Asymptotics of the n-th prime using the gamma function

In the paper http://rgmia.org/papers/v8n2/eepnt.pdf, the author proves that proves an explicit inequality on prime numbers using the gamma function and as a corollary, he showed that.
$$
p_n = n ...

**4**

votes

**1**answer

457 views

### Progress on Bouniakowsky's Conjecture

Has there been any progress on the Bouniakowsky conjecture? In particular, has anyone been able to prove something for a particular polynomial - or for a class of them?
(I can't seem to find ...

**2**

votes

**1**answer

556 views

### Generalization of Mertens' theorem

One classical Mertens' theorem tells us that $$\prod_{p \leq n} (1-\frac{1}{p})^{-1} = e^\gamma \log n + \mathcal{O}(1).$$
It is now very natural to ask, whether we have some good estimate to ...

**12**

votes

**3**answers

853 views

### Density of a set of integers

EDIT: this question of mine has received little attention, perhaps in part because it was stated in a too general and complicated way. So let me give it a second chance:
Fix an integer $r \geq 0$. ...

**18**

votes

**3**answers

877 views

### Finite sums of prime numbers $\geq x$

Let $S_x$ be the set of finite sums of prime numbers $\geq x$. In other words, let $S_x$ be the submonoid of $(\mathbf{Z}_{\geq 0},+)$ generated by the set $\mathcal{P}_{\geq x}$ of prime numbers ...

**4**

votes

**2**answers

337 views

### Distribution of primes in small intervals

Let $\pi(x)$ be the number of primes smaller than $x$. Do there exist unconditionally universal constants $c > d$ such that
$$
\lim_{x \rightarrow \infty} \frac{\pi(x + \log^c x) - ...

**0**

votes

**2**answers

380 views

### Dirichlet's theorem on prime density [closed]

Does anyone knows where I could find the proof of Dirichlet's theorem on the analytic density of primes congruent to a certain integer $m$, which turns out to be $\frac{1}{\varphi(m)}$?
Thanks a lot.
...