All Questions
Tagged with analytic-number-theory asymptotics
46 questions with no upvoted or accepted answers
5
votes
0
answers
206
views
Number of solutions of linear congruence with bounded variables
Fix some nonzero integers $a_1, \dots, a_k$, with $k \geq 2$, and some real numbers $c_1, \dots, c_k \in (0,1)$.
For every positive integer $m$, let $N(m)$ be the number of $k$-tuple of integers $(x_1,...
5
votes
0
answers
233
views
What is known about the mode of the number of divisors $\le x$?
Let $d(x)$ be the divisor function. Let $M(x)$ ($x$ a positive integer) be the most frequent value of $d(y)$ for $1 \le y \le x$. Is an asymptotic known for $M(x)$, and failing that, can $M(x)$ at ...
5
votes
0
answers
355
views
What is the sum of the binomial coefficients ${n\choose p}$ over prime numbers?
What is known about the asymptotics, lower and upper bound of the sum of the binomial coefficients
$$
S_n = {n\choose 2} + {n\choose 3} + {n\choose 5} + \cdots + {n\choose p}
$$
where the sum runs ...
4
votes
0
answers
263
views
Asymptotic number of "modular primes"
We can say that a number $p$ is prime modulo $N$ if for any two numbers $1<a,b<p$, $ab \not\equiv p \pmod N$. We will define $p(n)$ to be the number of primes mod $n$. I'm wondering about the ...
4
votes
0
answers
412
views
Effective prime number theorem
The prime number theorem implies that for every $ϵ>0$, there is $n_\epsilon$ such that for all $n≥n_\epsilon$ the number of primes in $[n,cn]$ is at least $\frac{(c−1−\epsilon)n}{\log n}$ and at ...
4
votes
0
answers
306
views
Effective version of the Bombieri-Vinogradov theorem
Is there an effective version of the Bombieri-Vinogradov Theorem, in that have bounds on the implied constant been found?
3
votes
0
answers
167
views
A sharper estimate for a generalization of the sum-of-divisors function
I am interested in the function $f_n(m)$ which can be defined by the Dirichlet generating function $$\zeta(s)\zeta(s - 1) \cdots\zeta(s - n + 1) = \sum\limits_{m = 1}^\infty \frac{f_n(m)}{m^s} $$
This ...
3
votes
0
answers
105
views
Error function of the second moment of the divisor function
It is easy to show that the second moment of the divisor function has asymptotics:
$$\sum_{n\leq x} d_0(n)^2 = xP(\log(x))+E_2(x)$$
Where $P$ is some polynomial and that:
$$E_2 = o(x)$$
Previously, ...
3
votes
0
answers
151
views
On an inequality for the arithmetic function counting the number of primes $\lfloor n^c\rfloor$ in the spirit of Ramanujan's prime counting inequality
In page 3 of [1] (please see if you need it the book by Berndt) Axler refers an inequality that involves the prime-counting function $\pi(x)$ and that was deduced by Ramanujan. I'm curious to know if ...
3
votes
0
answers
106
views
Friedlander-Iwaniec Flipping moduli
I am reading section 12 (Flipping Moduli) of the paper "The polynomial $X^2+Y^4$ captures its primes" by Friedlander and Iwaniec.
At page 997, just below equation (12.7) we start estimating the ...
3
votes
0
answers
320
views
On sets of coprime numbers
We know that from prime number theorem that the number of primes below $n$ and above $\frac n2$ (denoted by $\pi_{n,\frac n2}$ is approximately $$\pi_{n,\frac n2}\approx\frac{n}{2\ln n}.$$
Denote by $...
2
votes
0
answers
179
views
A Brun-Titchmarsh type result for divisor sums; asymptotic/improved bound
In Shiu's work ('A Brun-Titchmarsh theorem for multiplicative functions') he proved that if $r\le x$ is a natural number, we have $$\sum_{r<n\le x}d(n)d(n-r)\ll x\log^2x\sum_{d|r}\frac{1}{d}.$$
I ...
2
votes
0
answers
195
views
Asymptotics of $\vartheta(x+y)-\vartheta(x)$, where $\vartheta$ is the Chebyshev function, when $y\in[x^\alpha, x]$ for some $\alpha\in(0,1)$
Introduction
Consider $\vartheta$ to be the Chebyshev function, that is, $\vartheta(x)$ denotes, for $x\in\mathbb N$, the sum $\sum_{p\le x,\ p\text{ prime}} \ln p$.
I am interested in asymptotics for ...
2
votes
0
answers
253
views
Asymptotic behaviour of a sum involving Möbius function
(This is a cross-posted simplification of this question posted in MSE which did not have a complete answer.)
I am trying to get the asymptotic behaviour when $n$ grows to infinity of a partial sum of ...
2
votes
0
answers
422
views
Sequences with high densities of primes: how to boost them to get even more and larger primes
I propose a methodology to help find large prime numbers with a much higher probability than picking up random numbers and testing them for primality. This would help speed up prime number generators ...
2
votes
0
answers
203
views
Asymptotics on a double sum over primes
I am attemping to find asymptotics of
$$\sum_{p \leq n}\ln p \left( \sum_{k=1}^\infty \left(\left\{\frac{n}{p^k} \right\} - \left\{\frac{n-1}{(p-1)p^k} \right\} \right) - \left\{\frac{n-1}{p-1} \...
2
votes
0
answers
110
views
On variations of a claim due to Kaneko in terms of Lehmer means
This post is cross posted from Mathematics Stack Exchange, due that there was a mistake from my part (see the excellent partial answer and my thread of edits of my question on MSE) this post on ...
2
votes
0
answers
167
views
What about series involving strong primes?
I know about the importance in analytic number theory of the sutdy of series involving prime numbers or constellations of prime numbers, for example, if I am not wrong, major theorems are Mertens' ...
2
votes
0
answers
163
views
Generalization of regularly varying functions
A continuous function $L :\mathbb{R}_+ \to \mathbb{R}_+$ is called regularly varying (at infinity) if for all $a > 0$,
$$
\lim_{x\to \infty} \frac{L(ax)}{L(x)}= g(a)
$$
for some function $g(a)&...
2
votes
0
answers
210
views
A sum with integer parts
Let $ \mathcal{A} $ be a set of reals such that $ \sum_{a \in \mathcal{A} } \frac{1}{a} = \infty $ and $ \sum_{a \in \mathcal{A} } \frac{1}{a^2} < \infty $. For instance, $ \mathcal{A} = \mathbb{N}^...
2
votes
0
answers
571
views
Integrating a product of integrals involving Bessel functions
I have asked similar questions on Math Stack Exchange, but not been able to receive many helpful responses. Therefore, I am posting this problem here, and any input would be extremely valuable.
I ...
2
votes
0
answers
110
views
Bounds on the number of zeros of a quadratic form
Let $Q(x_1, \dots, x_n)$ be a non-degenerate indefinite quadratic form with integer coefficients. Let $N(Q,T)$ be the set of vectors $x=(x_1, \dots, x_n) \in {\mathbb Z}^n$ such that $|x|<T$ and $Q(...
1
vote
0
answers
113
views
Are there any known statistics on the sign of the Stieltjes Constants?
The Stieltjes Constants $\gamma_n$ arise from considering the laurent series of the Riemann Zeta function at $s=1$
$$ \zeta(s) = \frac{1}{s-1} + \sum_{n=0}^{\infty} (-1)^n \frac{\gamma_n}{n!} (s-1)^n $...
1
vote
0
answers
128
views
On Zudilin's linear forms in $1,\zeta(5)$ and $\zeta(7)$
I am reading an article "Well-poised hypergeometric service for diophantine problems of zeta values" by W. Zudilin.
Consider the quantities defined here in pg. $617$
$$\tilde{F_n}:= \frac{1}{...
1
vote
0
answers
172
views
Asymptotics of $\sum \frac{d(n)}{n}$ with generating functions
We can determine the asymptotics of partial sums involving the divisor function accurately by means of, for example, the hyperbola method: $$\sum_{n\leq N}\frac{d(n)}{n}=\frac{1}{2}(\log(N))^{2}+2\...
1
vote
0
answers
86
views
Asymptotic behaviour of $\sum_{k=1}^{n}\frac{R_{k+1}+R_k}{R_{k+1}-R_k}$, where $R_k$ are the Ramanujan primes
I was inspired in the following post from this Math Overflow that was asked yerterday Asymptotic behavior of a certain sum of ratios of consecutives primes to ask about a similar question for ratios ...
1
vote
0
answers
133
views
On a continuous function as a substitute of the prime-counting function in the second Hardy–Littlewood conjecture satisfying certain asymptotics
It it well-known that the prime-counting function $\pi(x)$ satisfies the prime number theorem and that were in the literature two related conjectures to this arithmetic function, these are: the ...
1
vote
0
answers
315
views
From an inequality for the Euler's totient function to a combination of Firoozbakht's conjecture and Nicolas' criterion for the Riemann hypothesis
In this post we ask about the veracity of an inequality deduced from a combination of Firoozbakht's conjecture (see [1] or [2]) and Nicolas' criterion for the Riemann hypothesis (see for instance [3])....
1
vote
0
answers
129
views
Asymptotic of $\sum_{1\leq n\leq x}a_n$ where $\exp(\sum_{n=1}^\infty\alpha\operatorname{rad}(n)n^{-s})=\sum_{n=1}^\infty\frac{a_n}{n^s}$
Yesterday I tried to study the article [1] in wich were showed incredible expressions related to Dirichlet series. In the same way I wondered about next question.
We denote for integers $m>1$ the ...
1
vote
0
answers
28
views
Asymptotic size for the number of terms not exceeding $n$ in the class $r$ for a classification of the type Erdös-Selfridge for square-free integers
It is possible to define a classification similar than the Erdös-Selfridge classification of primes for different sequences. Please ee [1], section A18 and the references cited in this book. Because ...
1
vote
0
answers
101
views
Size of a set defined by divisor function
After some computations, I guessed the following conjecture.
How can I prove or disprove it? thanks!
Let
$$
A(k)=\#\left\{\left(t,\frac{k+t+a}{4t-1}\right):1\leq t\leq k,\ 1\leq a\leq k+t,\ a\mid(k+...
1
vote
0
answers
195
views
Asymptotics for certain sum involving the divisor function, Ramanujan sum
Let $c_q(n)$ be the Ramanujan sum, and let $\tau(n)$ be the divisor function. Is there an asymptotic formula for $$\sum_{n\le x}\tau(n)c_q(n)$$ with error terms that do not depend on $q$?
1
vote
0
answers
78
views
Related to derivative of Modified Bessel I function wrt the order
I recently met some problems related to the modified Bessel I funtions. Let $I(\nu,x):=I_\nu(x)$, and $I'_\nu(\nu,x):=\dfrac{\partial}{\partial \nu}I(\nu,x)$.
Using maple, it seems that $Re(\dfrac{I'...
0
votes
0
answers
79
views
Is there an asymptotic expansion for the reciprocal of the classical Euler beta function?
The classical Euler beta function can be defined by
$$
B(p,q)=\int_0^1t^{p-1}(1-t)^{q-1}\operatorname{d\!}t
$$
for $\Re(p),\Re(q)>0$.
The beta function and the classical Euler gamma function $\...
0
votes
0
answers
44
views
Asymptotic counts for imaginary quadratic discriminants with fixed splitting conditions
Let $p$ be prime and $r$ be a positive integer. I am interested in asymptotics for the number of imaginary quadratic discriminants $d$ such that
$p$ does not divide the conductor of $d$,
$p$ splits ...
0
votes
0
answers
132
views
Asymptotic bound of some number theoretic function
I asked this in stack exchange but did not get anything so I am posting it here.
I am self-studying asymptotic behavior of some number theoretic function and the following question comes up.
Let $n$ ...
0
votes
0
answers
68
views
Around similar inequalities than an inequality due to Nicolas, that involve products of consecutive Ramanujan primes
This is cross-posted (and this post is a version to ask just around the veracity of Conjecture 1) as the post with identifier 3594907 and same title), that I've edited on Mathematics Stack Exchange ...
0
votes
0
answers
80
views
Relevance of the deduction of similar theorems than Maier's theorem for other prime constellations
A year ago I asked this question on Mathematics Stack Exchange with identifier 4245823 and same title Relevance of the deduction of similar theorems than Maier's theorem for other constellations of ...
0
votes
0
answers
89
views
A similar inequality for the Dedekind psi function, than an inequality stated by Schinzel
I would like to ask about the next question that seems to me interesting. I know an article that was written by Andrzej Schinzel in which he stated Lemma 2. In this post we denote the Dedekind psi ...
0
votes
0
answers
157
views
Does it make sense to express upper bounds on arithmetic sequences with Dirichlet generating functions?
In order to see what happens when taking the functional equation in this form:
$$\xi(s) := \pi^{-s/2}\ \Gamma\left(\frac{s}{2}\right)\ \zeta(s) $$
$$\xi(s) = \xi(1 - s)$$
$$\pi^{-s/2}\ \Gamma\left(\...
0
votes
0
answers
51
views
On $\sum_{\substack{1\leq d\leq x\\(d,r)=1}}\frac{\mu(d)}{d}W(\frac{x}{d})$, with $\mu(n)$ the Möbius function and $W(x)$ the Lambert $W$ function
I wondered if it is possible to posed a similar question than Question 2 by Olivier Ramaré from [1] (page 231), although the computational evidence that I have for my conjecture is very small.
...
0
votes
0
answers
154
views
On the equation that involves the Dedekind psi function $\psi(x)=n$ with unique solution $x$, for a fixed integer $n\geq 1$
The Dedekind psi function is defined for a positive integer $m>1$ as
$$\psi(m)=m\prod_{\substack{p\mid m\\p\text{ prime}}}\left(1+\frac{1}{p}\right)\tag{1}$$
with the definition $\psi(1)=1$. See ...
0
votes
0
answers
35
views
Bound for $\left|\sum_{\substack{1\leq d\leq x\\(d,r)=1}}\frac{G_d}{d^{1+\varepsilon}}\right|$, where $G_d$ denote the Gregory coefficients
In this post we denote the Gregory coefficients, or reciprocal logarithmic numbers, this Wikipedia Gregory coefficients as $G_k$, for integers $k\geq 1$. I would like to know if it is possible to get ...
0
votes
0
answers
158
views
Similar problems for the Dedekind psi function than those that are in the literature for the Euler's totient function: reference request or proposals
I know the linked articles from Wikipedia for the Euler's totient function and the Dedekind psi function. I know that are in the literature famous, interesting and difficult problems involving the ...
0
votes
0
answers
89
views
Partial sums involving Gregory coefficients that cannot be an integer
For integers $n\geq 1$ let $G_n$ be the Gregory coefficients or reciprocal logarithmic numbers, see the Wikipedia [Gregory coefficients.]
(https://en.wikipedia.org/wiki/Gregory_coefficients)
$${z\...
0
votes
0
answers
93
views
Estimating asymptotically a sum (proof check)
I hope this question is appropriate for MathOverflow, if not please remove it.
I have the following problem which is taken from the paper "Sharp Conditional Bound for Moments of the Riemann Zeta ...