English
Related papers

Related papers: A higher order Levin-Feinleib theorem

200 papers

We analyze the sequence of polynomials defined by the differential-difference equation $P_{n+1}(x)=P_{n}^{\prime}(x)+x(n+1)P_{n}(x)$ asymptotically as $n\to\infty$. The polynomials $P_{n}(x)$ arise in the computation of higher derivatives…

Classical Analysis and ODEs · Mathematics 2008-11-17 Diego Dominici , Charles Knessl

We prove an asymptotic for the sum of $\zeta^{(n)} (\rho)X^{\rho}$ where $\zeta^{(n)} (s)$ denotes the $n$th derivative of the Riemann zeta function, $X$ is a positive real and $\rho$ denotes a non-trivial zero of the Riemann zeta function.…

Number Theory · Mathematics 2021-11-05 Andrew Pearce-Crump

Let $\mathbb{F}_{q}$ be a finite field with $q$ elements and $\mathbb{F}_{q}[x]$ the ring of polynomials over $\mathbb{F}_{q}$. Let $l(x), k(x)$ be coprime polynomials in $\mathbb{F}_{q}[x]$ and $\Phi(k)$ the Euler function in…

Combinatorics · Mathematics 2020-02-21 Zhang Zihan , Han Dongchun

Let $R(N)$ be the number of representations of $N$ as a sum of a prime and a square-full number weighted with logarithmic function. In $2024$, the author and Y. Suzuki obtained an asymptotic formula for the sum of $R(N)$ over positive…

Number Theory · Mathematics 2025-06-06 Fumi Ogihara

We review the closed-forms of the partial Fourier sums associated with $HP_k(n)$ and create an asymptotic expression for $HP(n)$ as a way to obtain formulae for the full Fourier series (if $b$ is such that $|b|<1$, we get a surprising…

Number Theory · Mathematics 2021-04-02 Jose Risomar Sousa

We will study the asymptotic behavior of summation functions of a natural argument, including the asymptotic behavior of summation functions of a prime argument in the paper. A general formula is obtained for determining the asymptotic…

General Mathematics · Mathematics 2020-07-01 Victor Volfson

We provide examples of multiplicative functions $f$ supported on the squarefree integers, such that on primes $f(p)=\pm1$ and such that $M_f(x):=\sum_{n\leq x} f(n)=o(\sqrt{x})$. Further, by assuming the Riemann hypothesis (RH) we can go…

Number Theory · Mathematics 2019-11-22 Marco Aymone

The Mertens' first theorem gives us the following asymptotic formula \begin{equation*} \sum_{\substack{p\leq x\\ p~prime}}\frac{lnp}{p}=lnx+O(1), \end{equation*} and the Mertens' second theorem indicates that there exists a constant…

Number Theory · Mathematics 2021-06-15 Tianfang Qi , Su Hu

We obtain an asymptotic formula for the number of primes $p\leq x_1$, $p\leq x_2$ such that $p_1(p_2+a)\equiv l \pmod q$ with $(a,q)=(l,q)=1$, $q\leq x^{\kappa_0}$, $x_1\geq x^{1-\alpha}$, $x_2\geq x^{\alpha}$, $$…

Number Theory · Mathematics 2025-04-29 Zarullo Rakhmonov

Given an integer $n \ge 2$, its prime factorization is expressed as $n= \prod_{i=1}^s p_i^{a_i}$. We define the function $f(n)$ as the smallest positive integer such that $f(n)!$ is divisible by $n$. The main objective of this paper is to…

Number Theory · Mathematics 2026-03-05 Mihoub Bouderbala

We show that the number of positive integers $n\leq N$ such that $\mathbb{Z}/(n^2+n+1)\mathbb{Z}$ contains a perfect difference set is asymptotically $N/\log{N}$.

Number Theory · Mathematics 2023-01-09 Sarah Peluse

Let $p_n$ denote the $n$-th prime number, and let $d_n=p_{n+1}-p_{n}$. Under the Hardy--Littlewood prime-pair conjecture, we prove \begin{align*} \sum_{n\le X}\frac{\log^{\alpha}d_n}{d_n} \sim\begin{cases} \frac{X\log\log\log X}{\log…

Number Theory · Mathematics 2018-08-28 Nian Hong Zhou

This paper is part of a series of papers in which the asymptotic theory and appropriate symbolic computer code are developed to compute the asymptotic expansion of the solution of an n-th order ordinary differential equation. The paper…

Spectral Theory · Mathematics 2025-10-20 B. M. Brown , M. S. P. Eastham , D. K. R. McCormack

Let $p$ be a sufficiently large prime number, $r$ be any given positive integer. Suppose that $a_1,\,\dots,\,a_r$ are pairwise distinct and not zero modulo $p$. Let $N(a_1,\,\dots,\,a_r;\,p)$ denote the number of…

Number Theory · Mathematics 2020-11-11 Chaohua Jia

Let $\Omega(n)$ denote the number of prime factors of a positive integer $n$ counted with multiplicities. We show that for any bounded functions $a,b\colon\mathbb{N}\to\mathbb{C}$, $$\frac{1}{\log{N}}\sum_{n=1}^N…

Number Theory · Mathematics 2025-02-19 Dimitrios Charamaras , Florian K. Richter

We extend the Matom\"{a}ki-Radziwi\l\l{} theorem to a large collection of unbounded multiplicative functions that are uniformly bounded, but not necessarily bounded by 1, on the primes. Our result allows us to estimate averages of such a…

Number Theory · Mathematics 2021-11-15 Alexander P. Mangerel

For various arithmetic functions $f:\mathbb{N} \to \mathbb{R}$, the behavior of $f(n!)$ and that of $\sum_{n\le N} f(n!)$ can be intriguing. For instance, for some functions $f$, we have ${f(n!)=\sum_{k\le n}f(k)}$, for others, we have…

Number Theory · Mathematics 2024-05-30 Jean-Marie De Koninck , William Verreault

Let $H_k$ be the set of all normalized primitive holomorphic cusp forms of even integral weight $k\geq 2$ for the full modular group $SL(2, \mathbb{Z})$, and let $j\geq 3$ be any fixed integer. For $f\in H_k$, we write $\lambda_{{\rm{sym}^j…

Number Theory · Mathematics 2024-07-29 Kampamolla Venkatasubbareddy Ayyadurai Sankaranarayanan

Let $\lambda$ denote the Liouville function. We show that as $X \rightarrow \infty$, $$ \int_{X}^{2X} \sup_{\alpha} \left | \sum_{x < n \leq x + H} \lambda(n) e(-\alpha n) \right | dx = o ( X H) $$ for all $H \geq X^{\theta}$ with $\theta >…

Number Theory · Mathematics 2018-12-05 Kaisa Matomäki , Maksym Radziwiłł , Terence Tao

Let $\mathcal{P}$ be the set of the primes. We consider a class of random multiplicative functions $f$ supported on the squarefree integers, such that $\{f(p)\}_{p\in\mathcal{P}}$ form a sequence of $\pm1$ valued independent random…

Number Theory · Mathematics 2019-11-22 Marco Aymone , Vladas Sidoravicius