All Questions
Tagged with analytic-number-theory prime-numbers
117 questions
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
9
votes
0
answers
324
views
Semi-primes represented by quadratic polynomials
According to Lemke-Oliver, irreducible quadratic polynomials $G$ with positive leading coefficient and $\rho(2)<2$, (where $\rho(m)$ denotes the number of incongruent solutions to the congruence $G(...
- 195
8
votes
1
answer
937
views
On the connection between sums of prime numbers and distribution of prime numbers
As an amateur mathematician, I have always been fascinated by the magic of prime numbers, and their apparently random distribution. I was utterly amazed when I found the following connection between ...
- 189
8
votes
1
answer
838
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 ...
- 5,470
8
votes
2
answers
814
views
Estimates about prime numbers: a lemma in Bourgain's article
For $n\in \mathbb{N}$ with prime decomposition $n=p_1^{r_1}\cdots p_k^{r_k},p_i\neq p_j$, let $A=\{p_1,\cdots,p_k\}$; then the following holds:
\begin{equation}
|\{q\in \mathbb{N},q<Q: \text{all ...
- 351
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(...
- 9,114
8
votes
4
answers
1k
views
Prime numbers $p$ not of the form $ab + bc + ac$ $(0 < a < b < c )$ (and related questions)
If we ask which natural numbers n are not expressible as $n = ab + bc + ca$ ($0 < a < b < c$) then this is a well known open problem. Numbers not expressible in such form are called Euler'...
- 3,463
8
votes
1
answer
570
views
Asymptotic limit of truncated Legendre sieve
Consider the truncated sum
$$
S(x):=\sum_{\substack{{d\mid P(\sqrt{x})}\\{d\leq x}}}\mu(d)/d,
$$
where $P(z)$ is the product of all primes less than or equal to $z$, and $\mu(d)$ is the Möbius ...
- 965
8
votes
1
answer
605
views
lower and upper bound for $\sum_{k=1}^n \frac{(-1)^{\Omega(k)}}k$?
Are there known any lower and upper bounds for
$$
\sum_{k=1}^n \frac{(-1)^{\Omega(k)}}k,
$$
where $\Omega(n)$ is the number of prime factors counting multiplicities of $n$?
Or at least is it known ...
- 841
7
votes
2
answers
932
views
A stronger form of the Dirichlet Theorem on prime numbers in arithmetic sequences
Question 1. Let $a,b>1$ be two natural numbers. Is there a prime number $p\in 1+b\mathbb N$ such that $a+p\mathbb Z$ is a generator of the multiplicative group of the field $\mathbb Z/p\mathbb Z$?
...
- 41.8k
7
votes
2
answers
2k
views
Legendre's Constant
In a couple of web pages, I see that Legendre's constant is defined to be $\lim_{n \to \infty} (\pi(n) - (n/\log(n)))$ (for example, here and here).
Actually the first uses $\lim_{n \to \infty} (\log(...
- 595
7
votes
0
answers
179
views
When does the function $F(x)=\frac{\operatorname{li}(x^{1/2})}{\operatorname{li}(x)-\pi(x)}$ reach $F(x) > 8$?
We know from Ramanujan and Riemann that,
$$\pi(x) = \operatorname{li}(x) -\tfrac12\operatorname{li}(x^{1/2})-\tfrac13\operatorname{li}(x^{1/3})-\tfrac15\operatorname{li}(x^{1/5}) +\dots$$
with prime ...
- 12.6k
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
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
6
votes
4
answers
845
views
Uniform upper bound for the sum over primes $\sum_{p \leq x} p^{-1+\varepsilon}$
I am reading the article D. M. Gordon and C. Pomerance, The distribution of Lucas and elliptic pseudoprime, Math. Comp. (1991) (click).
In equation (27) the authors, apparently, used the following ...
user40023
6
votes
2
answers
575
views
Average value of the prime omega function $\Omega$ on predecessors of prime powers
For a positive integer $n$, the prime omega function value $\Omega(n):=\sum_{p\mid n}{\nu_p(n)}$ counts the number of prime divisors of $n$ with multiplicities. A result of Hardy and Wright, [1, ...
- 492
6
votes
6
answers
2k
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.
I....
- 5,470
6
votes
1
answer
382
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 < r_{\varphi(m)}...
- 19.6k
6
votes
1
answer
903
views
How to explain this prime gap bias around last digits?
My question is related to this article by Oliver and Soundararajan (article about a bias in the distribution of the last digits of consecutive prime numbers).
After trying some python experimental ...
6
votes
1
answer
233
views
Is there a connection between the average 'compositeness' of a rational number and $\phi$ (golden ratio)?
Let $n\in N$, where $n = p_{1}^{k_{1}}p_{2}^{k_{2}}...p_{m}^{k_{m}}$ for $p_{i}$ prime.
Define the 'density' of $n$ as:
$d(n) = \frac{(p_{1}+1)^{k_{1}}(p_{2}+1)^{k_{2}}...(p_{m}+1)^{k_{m}}}{n}$
...
- 375
6
votes
1
answer
826
views
Going beyond the Sylvester and Schur theorem with regard to $x,x+1,\dots,x+n-1$
I was recent reading through Paul Erdos's classic elementary proof of Sylvester-Schur. It occurred me that there is a simple argument that when $x$ is sufficiently large and if $p_i$ represents the $...
- 1,049
6
votes
2
answers
319
views
Evolution of partial sum of a sequence of induced Dirichlet characters
Let's consider the Dirichlet Character $\chi_3(n)$ modulo 3 given by $\chi_3(1)=1$, $\chi_3(2)=-1$ and $\chi_3(3)=\chi_3(0)=0$.
Lets consider the sequence of induced characters $\chi^{P_N} $ obtained ...
- 1,199
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 ...
- 1,990
6
votes
1
answer
665
views
On the distribution of roots modulo primes of an integral polynomial
For motivation and related questions, see below.
Rough sketch of the question.
View $\bigsqcup_{p \text{ prime}} (\mathbb{Z}/p\mathbb{Z})$ as a ‘subset’ of the unit circle, via $a\pmod{p} \mapsto e^{...
- 83
6
votes
3
answers
2k
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 ...
- 13k
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 (...
- 521
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
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 ...
- 113
5
votes
0
answers
614
views
is there a link with the probabilistic model for prime numbers?
Let $x \in \mathbb{R}_+$ and $k \in \mathbb{N}^{*}$.
Let :
$$\mathcal{A}(x)=\#\{(a_1, a_2, \ldots, a_k) \in \mathbb{P}^k \mid (a_1, a_2, \ldots, a_k \text{ verifying some properties}) \, , a_k \...
- 521
5
votes
1
answer
1k
views
Does the Euler product for $L(s,\chi_4)$ also converge in the right half of the critical strip?
This question expands on this one from MSE.
In the literature about Dirichlet $L$-series, I found that their Euler products:
$$L(s, \chi) =\prod_p \bigg(\frac {1}{1-\frac{\chi(p)}{p^s}} \bigg)$$
...
- 4,169
4
votes
1
answer
2k
views
Bounds for prime counting function
The prime counting function $\pi(x)$ is defined as
\begin{equation}
\pi(x)=\sum_{p\leq x}1
\end{equation}
where $p$ runs over primes.
I have seen many bounds for $\pi(x)$ such as
\begin{equation}
\...
- 45
4
votes
1
answer
295
views
"On the distribution of reduced residues" by Montgomery and Vaughan – missing careful argument wanted
In their paper, On the distribution of reduced residues, Montgomery and Vaughan state early on that
With a more careful argument from (2) it is easily seen that
$$\tag{*}
qhP - qhPQ + O(qhP^2) \leq ...
- 965
4
votes
2
answers
1k
views
Calculating the infinite product from the Hardy-Littlewood Conjecture F
The Hardy-Littlewood Conjecture F [1] involves the infinite product
$$\prod\left(1-\frac{1}{\varpi-1}\left(\frac D\varpi\right)\right)$$
where $\varpi$ ranges over the odd primes and $\left(\frac D\...
- 9,114
4
votes
1
answer
531
views
Do prime gaps that are a power of "h" have the same density?
Send me back to Mathematics Stack Exchange if this question is not research level.
At Terence Tao's blog post there is the expression:
$$\sum\limits_{n \leq X} \Lambda(n)\Lambda(n+h) \ \ \ \ \ \ \ \ \ ...
- 1,183
4
votes
1
answer
419
views
The values of $n$ which satisfy an inequality about prime numbers
For which values of $n$ does the following inequality hold for?
$$2(n-2) < Ap_n\prod_{i=3}^n \left(\frac{p_i-1}{p_i}\right)$$
$p$ are prime numbers and the notation $p_i$ indicates the $i$-th ...
- 161
4
votes
1
answer
708
views
Calculating the constant in the Bateman-Horn-Stemmler conjecture
Bateman & Horn [1], building on Bateman & Stemmler [2], give a conjectured formula for the density of numbers that produce simultaneous primes in a number of fixed polynomials.
The constant ...
- 9,114
4
votes
0
answers
324
views
Asymptotic estimate for a random model of primes
Question
Let
$$
\pi_{rm_c}(x) = \sum_{ \substack{ {n\leq x}\\{(n+a,P(\sqrt{n}))=1}}} 1-1,
$$
where $P(x)$ is the product of all primes less or equal to $x$ and $a$ is a random integer constrained to ...
- 965
3
votes
2
answers
795
views
Estimate about primes
Can anyone give an estimate (upper bound or lower bound) for the number of divisors $d\mid P_r$ such that $\frac{\sqrt{P_r}}{2}< d < \sqrt{P_r}$, where $P_r$ is the product of the $r$ smallest ...
- 499
3
votes
2
answers
481
views
Two equivalent statements about primes
Regarding to our hypothesis in https://math.stackexchange.com/questions/1918406/a-hypothesis-about-the-conjecture-every-even-number-is-the-difference-of-two-p , we guess that the following statements ...
- 995
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 ...
user40023
3
votes
1
answer
795
views
On partial sum of non-primitive Dirichlet characters
Consider a Dirichlet character, $\chi(n)$, and the partial sum :
$$S(\chi,x)=\bigg |\sum_{n=1}^{x} \chi(n)\bigg|$$
There are many works to bound this sum when $\chi$ is a primitive character, but ...
- 1,199
3
votes
1
answer
359
views
Primes in simultaneous arithmetic progressions
Suppose we're given four positive integers $a$, $b$, $c$, $d$ such that $a$ and $b$ are coprime, and $c$ and $d$ are coprime. Is there a non-negative integer $k$ such that both $ak+b$ and $ck+d$ are ...
- 483
3
votes
0
answers
1k
views
Formula for $\pi$ involving exponents of Mersenne primes
Can someone provide a proof for the following claim?
$$\pi=\dfrac{S_0S_2}{M_3M_5} \cdot\left(\displaystyle\prod_{p \equiv 1 \pmod{4} } \frac{p}{p-1}\right) \cdot \left(\displaystyle\prod_{p \equiv 3 \...
- 2,661
3
votes
1
answer
730
views
what would be the consequences on the distribution of primes of $\Lambda=\infty$?
It is widely believed that the quantity $\Lambda:=\lim\sup\dfrac{t_{n+1}-t_{n}}{2\pi/\log t_{n}}$, where $t_{n}$ is the imaginary part of the $n$-th non-trivial zero on the critical line of the ...
- 6,984
3
votes
1
answer
747
views
Is $1 = \sum_{n=1}^{\infty} \frac{\pi(p_n^2)-n+2}{p_n^3-p_n}$ , where $\pi$ denotes the prime counting function and $p_n$ denotes the $n$-th prime?
Is
$$1 = \sum_{n=1}^{\infty} \frac{\pi(p_n^2)-n+2}{p_n^3-p_n},$$
where $\pi$ denotes the prime counting function and $p_n$ denotes the $n$-th prime?
Context:
This question came out as a result in ...
- 3,064
3
votes
1
answer
860
views
Lower bounds on the error term of the prime number theorem
Are there any lower bounds on the error term for the prime number theorem, or in other words, is there a nontrivial $f$ s.t.
$$f(x)\ll |\psi(x) - x|$$
where $\psi$ is the Chebyshev function.
- 1,890
3
votes
0
answers
319
views
Isometry group of an integer
This is a cross post from MSE, as it seems the partial answer I got then was deleted, so I ask it again here.
Let $\prod_{i\in I}p_{i}^{a_{i}}$ be the prime factorization of a positive integer $n$ ...
- 6,984
3
votes
0
answers
673
views
Prime numbers and sieving with $2,3,\cdots,q(x)= (1+o(1)) \log(x)$
Let $x \in \mathbb{R}_{+}$.
For $q \in \mathbb{P}$, let : $\mathcal{B}_q = \{b \in \mathbb{N}^{*} \, | \, \gcd(b, \displaystyle{\small \prod_{\substack{p \leq q \\ \text{p prime}}} {\normalsize p}})=...
- 521
2
votes
1
answer
283
views
Explicit bounds on number of primes of given size
How many prime numbers of $b$ bits are there?
Beyond the prime number theorem, one can give explicit bounds on the number of primes below some integer $n$, or in a given interval. For instance, Rosser ...
- 456
2
votes
1
answer
163
views
Prime divisors of $\prod(a_i-a_j)$
For a prime $p$, let $\varphi_p\colon\mathbb Z\to\mathbb Z/p\mathbb Z$ denote the canonical homomorphism from the integers onto the group of order $p$.
Given an integer $n\ge 3$, what is the smallest ...
- 23k