All Questions
Tagged with analytic-number-theory prime-numbers
690 questions
15
votes
3
answers
1k
views
Does there exist a meromorphic function all of whose Taylor coefficients are prime?
More precisely, does there exist an unbounded sequence $a_0, a_1, ... \in \mathbb{N}$ of primes such that the function
$\displaystyle O(z) = \sum_{n \ge 0} a_n z^n$
is meromorphic on $\mathbb{C}$?
...
- 118k
15
votes
1
answer
802
views
Does the sum $\sum_{n=1}^{\infty}\frac{1}{p_n(p_{n+1}-p_n)}$ converge?
Prove, if possible in an elementary way, that $\sum_{n=1}^{\infty}\frac{1}{p_n(p_{n+1}-p_n)}$ converges/diverges, where $p_n$ denotes the $n^{\textrm{th}}$ prime.
- 193
15
votes
1
answer
901
views
Does Littlewood's bound on $\zeta(1+it)$ extend to all the partial sums?
Littlewood established that $2e^{\gamma} \geq \limsup_{t \to \infty} |\zeta(1+it)| / \log{\log{t}} \geq e^{\gamma}$, the lower bound unconditionally and the upper bound on RH. It now seems to be ...
- 13.8k
15
votes
1
answer
1k
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 ...
- 26k
15
votes
0
answers
365
views
Do primes of the form $4k+1$ ever lead the greatest prime factor race?
Analogous to Chebyshev's race between primes, I examined the race between primes in the greatest prime factors, GPF, of natural numbers. Similar to the regular prime race, in the GPF race, the ...
- 5,470
14
votes
1
answer
1k
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
$$Q_a(...
- 26k
14
votes
2
answers
739
views
How many zeta zeros are needed to accurately calculate five digits for π(1000000), where π(x) is the prime counting function?
John Derbyshire in his book PRIME OBSESSION says on page 343:
"I’ll round off with a complete calculation of $\pi(1,000,000)$, the
number of primes up to one million, using Riemann’s formula -- ...
- 1,305
14
votes
0
answers
297
views
An 'onion-structure' for roots of a series associated to prime numbers?
The series $$\sum_{n=1}^\infty\frac{z^{p_n-n}}{n!}$$ associated to the
sequence $p_1=2,p_2=3,p_3=5,p_4=7,p_5=11,\ldots$ of prime numbers
defines a holomorphic function in the open disc of radius $e$.
...
- 17.9k
13
votes
4
answers
2k
views
Proving Mertens' theorem using the prime number theorem
Mertens' Theorem states that
$$\sum_{p \leq x}\frac{1}{p} = \log \log x + M + O(1/\log x).$$
This is weaker than the prime number theorem; in fact according to the Wikipedia page, the prime number ...
- 21.3k
13
votes
3
answers
1k
views
At what point would an elementary generalization of Bertrand's Postulate be interesting?
I know that in 1952 Jitsuro Nagura was able to show that there is always a prime between $k$ and $\frac{6k}{5}$ for $k > 24$.
At what point would an improvement on Nagura's result be interesting? ...
- 1,049
13
votes
1
answer
1k
views
About the number of primes which are the sum of 3 consecutive primes (OEIS A034962)
I made some numerical simulations about the number of primes which are the sum of 3 consecutive primes (OEIS A034962), that is for instance:
$$5+7+11=23$$
$$7+11+13=31$$
$$11+13+17=41$$
$$17+19+23=59$$...
- 1,008
13
votes
2
answers
2k
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 \...
- 5,470
13
votes
2
answers
1k
views
What is known about the prime number theorem for Beurling generalised primes
Background: Beurling's systems of numbers
Beurling considered a sequence of reals $1<x_1<x_2<\cdots <$ as "primes" and then the ordered sequence of all products of these "...
- 24.7k
13
votes
1
answer
899
views
Parity of the Prime Counting Function
I am interested in the distribution of the parity of $\pi(x)$, the prime counting function, over the natural numbers.
Let:
$\ \ E_n := \left\{ k \in \left\{1,\dots,n\right\} : \pi(k) \equiv 0 \mod 2 ...
- 3,699
13
votes
2
answers
1k
views
Existence of relative Dirichlet density of primes starting with 1
This question is a duplicate of an existing MO question, but that other MO question has an accepted answer that does not actually answer the question, and I'm not sure how to fix that other than by re-...
- 82.7k
13
votes
1
answer
777
views
Large sieve inequality for sparse trigonometric polynomials
Let $S(\alpha) = \sum_{n\leq N}f(n) e^{2\pi i \alpha n}$ for some arithmetic function $f$. Suppose $\alpha_1, \ldots, \alpha_R$ are real numbers that are $\delta$-spaced modulo $1$, for some $0 < \...
- 253
13
votes
3
answers
2k
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$. ...
- 26k
13
votes
1
answer
383
views
Numbers that don't start with (p-1) in base p for any p
Say that an integer $n$ is $p$-leading if its expansion in base $p$ starts with the digit $p-1$. My postdoc, Lifan Guan, asks: are there infinitely many positive integers $n$ that are not $p$-leading ...
- 20.2k
13
votes
0
answers
1k
views
Small primes attract large primes
I posted a version of this to stackexchange and got 12 up-votes and no answers in somewhat more than a day. Someone in a comment construed it as asking for a lot of novel research including figuring ...
12
votes
2
answers
1k
views
Prime differences and zero multiplicity
Concerning gaps between consecutive primes, Paul Erdős conjectured that:
$$\sum_{p_n < x} (p_n -p_{n-1})^2 = O(x \log x)$$
Let's call this hypothesis EH. Assuming the Riemann hypothesis (RH), ...
- 232
12
votes
2
answers
616
views
Are there any notion of 'almost primes' known to have small gaps?
A notorious question with prime numbers is estimating the gaps between consecutive primes. That is, if $(p_n)_{n \geq 1}$ is the canonical enumeration of the primes, then set $g_n = p_{n+1} - p_n$. It ...
- 26.9k
12
votes
1
answer
535
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 ...
- 37k
12
votes
1
answer
526
views
Equidistribution of $\{\alpha p\}$ for $p$ in an arithmetic progression
Let $\alpha$ be irrational. A famous theorem of Vinogradov says that $\{ \alpha p\}$ is equidistributed in $[0,1]$ as $p$ runs over all primes.
Let $a,q$ be natural numbers with $\gcd(a,q) = 1$. Then ...
- 21.3k
12
votes
1
answer
1k
views
Why do the Maynard-Tao weights work so well?
I am looking for an intuitive reason for why the Maynard-Tao weights work well to capture many primes of the form $n+h_1, \ldots , n+h_k$, where $(h_1, \ldots , h_k)$ is any admissible $k$-tuple.
For ...
- 2,283
12
votes
1
answer
1k
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 $p$...
- 26k
12
votes
3
answers
929
views
Mertens-like sum in arithmetic progressions
I find myself needing a good estimate for $\sum_{p\le x,\, p\equiv a\bmod q} 1/p$, perhaps something like
$$
\sum_{p\le x,\, p\equiv a\bmod q} \frac1p = \frac{\log\log x}{\phi(q)} + b(q,a) + O\big(\...
- 12.8k
12
votes
1
answer
1k
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 ...
- 303
12
votes
1
answer
1k
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 ...
- 385
12
votes
1
answer
869
views
Analytic lower bounds on the first sign change of pi(x) - li(x)?
There have been many results on the first sign change of $\pi(x)-{\mathrm{li}}(x)$: among others, Lehman, te Riele, Bays & Hudson, Demichael, Chao & Plymen, and most recently Saouter & ...
- 9,114
12
votes
0
answers
627
views
Sieve bound for prime $k$-tuples
Let $d_1<d_2<\dots<d_k$ be integers. Then the number of integers $n\leq x$, such that $n+d_1, n+d_2, \ldots, n+d_k$ are simultaneously prime, is bounded above by
$$
\mathfrak{S}(d_1, \ldots, ...
11
votes
2
answers
1k
views
Does the Prime Number Theorem have anything to do with Erdos-Kac law or vice versa?
The prime number theorem says on average we can find $\frac n{\log n}$ primes of magnitude $n$.
Erdos-Kac law state a typical number of magnitude $n$ has $\log\log n$ primes.
Somehow the fact $e^{\...
user94040
11
votes
2
answers
1k
views
Mertens-like theorem
Mertens' first theorem states that
$$
\sum_{p \leq n} \frac{\log p}{p} = \log n + O(1).
$$
I read in this paper that the following variant is "classical":
$$
\sum_{p \leq n} \frac{\log p}{p -...
11
votes
2
answers
1k
views
What is the significance of Friedlander-Iwaniec and related theorems?
On p.177 of Number Theory Revealed: A Masterclass by Andrew Granville, the author states that "One can ask for prime values of polynomials in two or more variables." (though he later ...
- 2,075
11
votes
2
answers
1k
views
Do consecutive integers have a big prime factor?
Let us say that three consecutive positive integers $(m-1,m,m+1)$ have a big prime factor if the largest prime factor $p$ of $N=(m-1)m(m+1)$ satisfies $e^p>N$.
I ckecked that it is true for all $m&...
11
votes
1
answer
700
views
Squarefree numbers $n$ such that $432n+1$ is also squarefree
This is a second attempt (see Primes $p$ such that $432 p +1$ is prime)
Is the set of squarefree numbers $n$ such that $n(432 n+1)$ is also squarefree known to be infinite?
Fact: the number of such ...
- 123
11
votes
1
answer
934
views
Riemann sum formula for definite integral using prime numbers
I had asked this question in MSE. It got lot of upvotes but no answer (except one which was too long to be posted as a comment) hence I am posting it in MO.
While answering another question in MSE I ...
- 5,470
11
votes
2
answers
1k
views
Update for 2015: least prime of form nq+1, with q prime?
I have received a complaint about my 2011 answer
least prime in a arithmetic progression
which, indeed, gives conflicting reports about this:
given a prime $q,$ what can we say about an upper ...
- 25.7k
11
votes
2
answers
3k
views
least prime in a arithmetic progression
Hello
Here I want to consider the simplest arithmetic progression $n\equiv 1\pmod{q}$ where $q$ is a prime. Is it true that we can find a prime $p\leq q^2$ in this arithmetic progression?
This ...
- 2,508
11
votes
1
answer
436
views
How many numbers $\le x$ can be factorized into three numbers which form the sides of a triangle?
Note: Posting in MO since it was unanswered in MSE
Definition: We say that a natural number $n$ has triangular divisors if it has at least one triplet of divisors $n = d_1d_2d_3, 1 \le d_1 \le d_2 \...
- 5,470
11
votes
1
answer
1k
views
What might the (normalized) pair correlation function of prime numbers look like?
Cross-posting from Math.Stackexchange.
You might have read about the fortuitous meeting between Montgomery and Dyson. The background is that the nontrivial zeros of the Riemann zeta function, when ...
- 441
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
11
votes
1
answer
324
views
Does the mean ratio of the largest prime factor in prime gaps to the lower bound of the gap converge?
Posting in MO since this questions has been unanswered in MSE for 3 months.
Let $p_n$ be the $n$-th prime and $q_n$ be largest among all the prime factors of the composite numbers between $p_n$ and $...
- 5,470
11
votes
1
answer
637
views
Primes such that a given number has very small order
The following came up in (a previous version of) this answer.
Question. Let $a > 1$ be a positive integer, and $f \in \mathbf Z[x]$ a polynomial with positive leading term. Does there always exist ...
- 28.7k
11
votes
0
answers
436
views
Can we rule out the possibility that $\sqrt[3]{2}$ is small modulo every prime?
Consider a prime $p$ such that the polynomial $X^3-2$ splits into linear factors over $\mathbb{F}_p$: $X^3-2 = (X-\alpha_p)(X-\beta_p)(X-\gamma_p)$. It seems reasonable to expect that (identifying $\...
- 1,914
10
votes
3
answers
3k
views
A number encoding all primes
This may be a soft question, but it's just something I thought of one night before sleeping. It's not my field at all, so I am just asking out of curiosity. Has anyone studied the number which is the ...
- 15.5k
10
votes
2
answers
3k
views
Can every integer be written as a sum of squares of primes?
This question is mainly inspired from a different problem I was working on.
Is there a value of $k$ such that, for each $n\in \mathbb N$, the equation
$$\sum_{i=1}^{k}x_i^2=n$$
is solvable in $x_1,\...
- 791
10
votes
1
answer
694
views
Set of prime numbers $q$ such that $\sum\limits_{p\leq\sqrt{q}}p=\pi(q)$, where $p$ are prime numbers
The question is: does the set of prime numbers $q$ such that $\sum\limits_{p\leq\sqrt{q}}p=\pi(q)$, where $p$ are prime numbers, contain infinitely many elements? You can find the first elements here (...
- 189
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
10
votes
1
answer
469
views
Asymptotic behavior of a certain sum of ratios of consecutives primes
I am looking for the asymptotic growth of the following sum
$$\sum_{k=1}^{n}\frac{p_{k+1}+p_k}{p_{k+1}-p_k}$$
where $p_k$ stands for the prime of index $k$.
Manual computations show, for small values ...
- 1,008
10
votes
2
answers
282
views
Non-trivial upper bound for a sum related to $p^{-1}z \pmod q$ and $q^{-1}z \pmod p$
Let $p, q$ be two distinct prime number. I'm trying to provide a non-trivial upper bound for the sum
$$S(p, q) = \sum_{1 \leq x < p} \sum_{1 \leq y < q} \frac{1}{\|x / p\| \, \|y / q\| \, \|x/p +...
- 65