Related papers: Asymptotic expansions of the prime counting functi…

We established and estimate the full asymptotic expansion in integer powers of 1 N of the [ $\sqrt$ N ] first marginals of N-body evolutions lying in a general paradigm containing Kac models and non-relativistic quantum evolution. We prove…

Let $p_n$ denote the $n$-th prime. In 2000, Panaitopol established the inequality $p_1 \cdots p_n > p_{n+1}^{n - \pi(n)}$ for all $n \geq 2$, where $\pi(x)$ is the prime counting function. In 2021, Yang and Liao refined this by introducing…

The problem of reconstructing functions from their asymptotic expansions in powers of a small variable is addressed by deriving a novel type of approximants. The derivation is based on the self-similar approximation theory, which presents…

We consider the asymptotic expansion of the functional series \[S_{\mu,\gamma}(a;\lambda)=\sum_{n=1}^\infty \frac{n^\gamma e^{-\lambda n^2/a^2}}{(n^2+a^2)^\mu}\] for real values of the parameters $\gamma$, $\lambda>0$ and $\mu\geq0$ as…

We examine convergent representations for the sum of a decaying exponential and a Bessel function in the form \[\sum_{n=1}^\infty \frac{e^{-an}}{(\frac{1}{2} bn)^\nu}\,J_\nu(bn),\] where $J_\nu(x)$ is the Bessel function of the first kind…

Usually when solving differential or difference equations via series solutions one encounters divergent series in which the coefficients grow like a factorial. Surprisingly, in the $q$-world the $n$th coefficient is often of the size…

We introduce the sequence $(a_n) \subset (0,1]$ and prove that the asymptotic behaviour of $\sum_{k=1}^n a_k$ is the same than $\pi(n)$, the prime-counting function. We also obtain that $\pi(n) \sim n a_n$ and we estimate…

All the known approximations of the number of primes pi(n) not exceeding any given integer n are derived from real-valued functions that are asymptotic to pi(x), such as x/log x, Li(x) and Riemann's function R(x). The degree of…

We present a sufficient condition of existence of asymptotic expansion in negative power series for a function defined by Taylor series and unitary formulas for coefficients of this expansion. An example of computing scheme for arctangent…

We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. The model considered in the paper is very general as we do not impose any…

Let $\pi$ be a unitary automorphic cuspidal representation of $GL_2(\mathbb{Q}_\mathbb{A})$ with Fourier coefficients $\lambda_\pi(n)$. Asymptotic expansions of certain sums of $\lambda_\pi(n)$ are proved using known functorial liftings…

In this paper, under certain restrictions on linear factors of the denominator of a rational function of two variables, the leading term of the asymptotic expansion of the coefficients is found.

The classical orthogonal polynomials (Hermite, Laguerre and Jacobi) are involved in a vast number of applications in physics and engineering. When large degrees $n$ are needed, the use of recursion to compute the polynomials is not a good…

Using a differential equation approach asymptotic expansions are rigorously obtained for Lommel, Weber, Anger-Weber and Struve functions, as well as Neumann polynomials, each of which is a solution of an inhomogeneous Bessel equation. The…

The paper considers asymptotics of summation functions of additive and multiplicative arithmetic functions. We also study asymptotics of summation functions of natural and prime arguments. Several assertions on this subject are proved and…

We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…

Let f(m,n) denote the number of relatively prime subsets of {m+1,m+2,...,n}, and let Phi(m,n) denote the number of subsets A of {m+1,m+2,...,n} such that gcd(A) is relatively prime to n. Let f_k(m,n) and Phi_k(m,n) be the analogous counting…

A sharp asymptotic formula for the sum of reciprocals of $\pi(n)$ is derived, where $\pi(x)$ is the number of primes not exceeding $x$. This result improves the previous results of De Koninck--Ivi\'c and L. Panaitopol.

We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and grows at least linearly. We prove that conversely, every…

We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression.…