Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
1 answer
177 views

Mellin transform at $0$

Let $f$ be a smooth complex valued function with support on $[0,2]$ and with Mellin transform $\tilde{f}$. Recall that the Mellin transform is defined as $$\tilde{f}(w)=\int_0^{\infty}f(x)x^{w-1}dx.$$ ...
user avatar
4 votes
1 answer
213 views

Asymptotic behavior of weighted sums involving the fractional part function

Currently, I am studying the asymptotic behavior of sums of the form \begin{equation}\label{eq1}\tag{1} \sum_{k=1}^{n-1} f(n-k) \left\{ \frac{n}{k} \right\} \end{equation} In this context, based on ...
 Babar's user avatar
  • 611
6 votes
1 answer
431 views

Asymptotic behavior of partial sums of Dirichlet series

Consider the Dirichlet series: $$\sum_{n \geq 1} \frac{a_n}{n^s} = \frac{\zeta(s+1/3)}{\zeta(s)}$$ where $\zeta(s)$ is the Riemann zeta function. Question: Assuming the Riemann Hypothesis (RH), how ...
 Babar's user avatar
  • 611
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}{...
Max's user avatar
  • 11
2 votes
1 answer
191 views

Sums of multiplicative functions over residue classes

It was stated in this Shiu, P. work, page 169, Theorem 2, that $$\sum_{\substack{n\le x\\ n\equiv a\pmod k}}d_r^{\ell}(n)\ll\frac{x}{k}\left(\frac{\phi(k)}{k}\log x\right)^{r^{\ell}-1}.$$ Here, $d_r(n)...
user avatar
5 votes
1 answer
750 views

Sum of reciprocals of rough numbers

Let $x$ and $y$ be given real numbers. We may suppose that $2\leqslant x \leqslant y$ and that $u:= \log(y)/\log(x)$ remains bounded in a compact set away from $1$ as $x,y\to\infty$. An integer $n$ is ...
Krishnarjun's user avatar
2 votes
1 answer
110 views

Asymptotic behavior in a modular color-cycling problem

Consider the following problem: We have $k$ rooms, each equipped with a light that cycles through three colors – red, green, and blue – in a cyclic order. Initially, all lights are set to red. Each of ...
PianothShaveck's user avatar
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 ...
user avatar
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 ...
Bear's user avatar
  • 31
5 votes
1 answer
426 views

Lindelöf hypotheses for derivatives of zeta

The Lindelöf hypothesis says that if we have: $$\zeta(\sigma+iT)=\mathcal O(T^a)$$ Then if one considers $\sigma=1/2$ then $\inf a=0$. Further, from convexity and the functional equation this implies ...
psubodiosa's user avatar
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 ...
Maximilian Janisch's user avatar
7 votes
2 answers
720 views

On the asymptotic behaviour of the series $\sum_{n=1}^{\infty} \left ( \frac{\zeta(ns)}{n}+\frac{s}{1-ns}\right )$ near $s=0$

I am interested in determining the behaviour of the the series/function $$f(s)=\sum_{n=1}^{\infty} \left ( \frac{\zeta(ns)}{n}+\frac{s}{1-ns}\right )$$ near $s=0$. It is clear that $f(0)$ is undefined....
Tian Vlašić's user avatar
2 votes
0 answers
252 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 ...
Juan Moreno's user avatar
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 ...
stillconfused's user avatar
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 $...
Nilotpal Kanti Sinha's user avatar
2 votes
1 answer
198 views

Series with the smallest number whose square is divisible by $n$

I was looking into this sequence. And I'm particularly interested in the asymptotic behavior of the following series (which is stated on the site) $$\sum_{k=1}^n \frac{1}{a(k)} \sim \frac{3(\log n)^2}...
Denys Lohvynov's user avatar
2 votes
1 answer
740 views

Does the Riemann hypothesis predict a bound for this prime-counting function?

Does the Riemann hypothesis predict an upper bound for $$\left|f(x)-\left(\operatorname{li}(x)-\frac{x}{\log x} \right)\right|,\quad x\ge 2\tag{1}$$ where $$f(x)=\sum\limits_{n=2}^x \frac{\Lambda(n)}{\...
Steven Clark's user avatar
  • 1,126
6 votes
2 answers
815 views

Probability of large gcd

Is the following statement true? Let $N$ be sufficiently large, and choose $t$ uniformly randomly in $\{1,2,\ldots,N\}$. Then $$\Pr[\gcd(t, N)>N^{3/4}] < N^{-1/16}.$$ This is the "dual"...
Alek Westover's user avatar
4 votes
0 answers
262 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 ...
Daniel Weber's user avatar
  • 3,319
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 -...
Charles Bouillaguet's user avatar
4 votes
1 answer
423 views

Is there a "convolution" of asymptotic growth?

Suppose that I have two asymptotic counts given by $$ \#\{x \in [0,H] \cap \mathbb Z: f(x) \leq H\} \sim F(H) $$ and also $$ \#\{x \in [0,H] \cap \mathbb Z: g(x) \leq H\} \sim G(H). $$ From these two ...
user avatar
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$ ...
KAK's user avatar
  • 613
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 ...
user142929's user avatar
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 ...
user142929's user avatar
3 votes
1 answer
348 views

On conjectures about the arithmetic function that counts the number of Sophie Germain primes

I've edited this post two years ago on Mathematics Stack Exchange, with identifier 3590406 and same title On conjectures about the arithmetic function that counts the number of Sophie Germain primes, ...
user142929's user avatar
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 ...
user142929's user avatar
1 vote
1 answer
96 views

On the behaviour for the quotient involving Fermat numbers of $\frac{\psi(F_m)}{F_m}$ where $\psi(x)$ denotes the Dedekind psi function

In this post we denote the Dedekind psi function as $\psi(m)$ for integers $m\geq 1$. This is an important arithmetic fuction in several subjects of mathematics. As reference I add the Wikipedia ...
user142929's user avatar
4 votes
1 answer
235 views

Relation between $\pi$, area and the sides of Pythagorean triangles whose hypotenuse is a prime number

Consider all Pythagorean triangles $a^2 + b^2 = p^2$ in which the hypotenuse $p$ is a prime number. Let $h(x) = \sum_{p \le x}p^2$, $a(x) = \sum_{p \le x}ab$ and $r(x) = \sum_{p \le x}(a+b)^2$. Is it ...
Nilotpal Kanti Sinha's user avatar
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,...
Erik4's user avatar
  • 121
1 vote
1 answer
310 views

Asymptotic lower bound for the number of square free with at least two prime factors

In one of Soundararajan's papers, he claims without proof that it is a standard exercise to show that the number $N(X)$ of positive square-free integers $d \equiv 1 \; \bmod \; 8$ less than $X$, with ...
Melanka's user avatar
  • 577
5 votes
1 answer
369 views

A bound for the number of integer solutions to a simple inequality

I am interested in proving an upper bound (expressed as a power of $N$, with $N\rightarrow\infty$ ) for the number of elements of the set $$ A_N=\{(k,l,m,n)\in([N,2N]\cap\mathbb{Z})^4: |k^2+l^2-m^2-n^...
Tony419's user avatar
  • 421
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 ...
user142929's user avatar
6 votes
1 answer
369 views

Asymptotic estimate for an integral involving the squared modulus of the Riemann zeta function

For any fixed $\frac{1}{2} < \sigma < 1$, let $$\int_0^T \frac{|\zeta(\sigma+it)|^2}{\sqrt{1+t^2}} \ dt = O(T^\theta), \qquad T \uparrow \infty. $$ It is clear that $\theta > 0$, since we ...
nickkatzfl's user avatar
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 ...
Vincent Granville's user avatar
2 votes
2 answers
385 views

What is the growth rate of the sum of powers of distinct primes closest to a given a integer?

Let $n$ be a positive integer, and $$2 = p_1 < p_2 < \dots < p_m \le n$$ be the sequence of all primes less than or equal to $n$. For each index $j$ let $p_j^{e_j}$ be the largest power of $...
Naysh's user avatar
  • 557
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. ...
user142929's user avatar
0 votes
1 answer
204 views

On $(\prod_{\substack{1\leq s\leq X\\s\text{ semiprime}}}s)(\sum_{\substack{1\leq s\leq X\\s\text{ semiprime}}}\frac{1}{s})$ as $X\to\infty$

Few weeks ago an user from Mathematics Stack Exchange answered my question On an inequality that involves products and sums related to the sequence of semiprimes (asked May 26). It seems that for ...
user142929's user avatar
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} \...
Brian's user avatar
  • 1,549
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 ...
user142929's user avatar
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 ...
user142929's user avatar
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 ...
user142929's user avatar
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 ...
user142929's user avatar
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 ...
user142929's user avatar
3 votes
2 answers
546 views

Approximation of $\sum_{\rho}\frac{1}{|\rho|^2}$, over the non-trivial zeros of the Ramanujan's zeta function

I would like to know if it in the literature an approximation for $$\sum_{\rho}\frac{1}{|\rho|^2}\tag{1}$$ where the sum is over all of the non-trivial zeros of the Ramanujan's zeta function (also ...
user142929's user avatar
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])....
user142929's user avatar
3 votes
2 answers
218 views

The graph and sign of $p_n-\operatorname{ali}(n)$, where $p_n$ is the $n$-th prime and $\operatorname{ali}(n)$ the inverse of the logarithmic integral

I'm inspired in [1] to ask the following question. My problem is that I have not an implementation of the inverse of the logarithmic integral $\operatorname{Li}(x)=\int_2^x\frac{dt}{\log t}$, that ...
user142929's user avatar
4 votes
1 answer
291 views

A similar lemma to a lemma due to Lagarias, for the partial sums of reciprocal of primes

I was inspired in Lemma 3.1 of [1] and in the Theorem 4.12 of [2] to ask about a similar statement that shows Lagarias in his paper as Lemma 3.1. The Lemma from Lagarias's paper is that if $H(n)=\...
user142929's user avatar
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\...
user142929's user avatar
4 votes
2 answers
472 views

Sharp estimates for Meissel-Mertens constant

I wondered if it is possible to get a similar inequality like $(1.1)$ of Michael D. Hirschhorn, Approximating Euler's Constant, The Fibonacci Quarterly, Volume 49, Number 3 (August 2011) for the ...
user142929's user avatar
1 vote
1 answer
196 views

A question about a sum that involves gaps between twin primes, on assumption of the First Hardy–Littlewood conjecture

I wondered, inspired in a result mentioned from [1] (page 45), what should be the asymptotic behaviour of the sequence on assumption of the First Hardy–Littlewood conjecture $$\sum_{\substack{\text{...
user142929's user avatar