English
Related papers

Related papers: Euler's Limit -- Revisited

200 papers

Asymptotic expansions are given for large values of $n$ of the generalized Bernoulli polynomials $B_n^\mu(z)$ and Euler polynomials $E_n^\mu(z)$. In a previous paper L\'opez and Temme (1999) these polynomials have been considered for large…

Classical Analysis and ODEs · Mathematics 2009-09-18 Jose Luis Lopez , Nico M. Temme

Let $p,p_1,\ldots,p_m$ be positive integers with $p_1\leq p_2\leq\cdots\leq p_m$ and $x\in [-1,1)$, define the so-called Euler type sums ${S_{{p_1}{p_2} \cdots {p_m},p}}\left( x \right)$, which are the infinite sums whose general term is a…

Number Theory · Mathematics 2017-04-21 Ce Xu

For an (irreducible) recurrence equation with coefficients from $\mathbb Z[n]$ and its two linearly independent rational solutions $u_n,v_n$, the limit of $u_n/v_n$ as $n\to\infty$, when exists, is called the Ap\'ery limit. We give a…

Number Theory · Mathematics 2022-09-09 Christoph Koutschan , Wadim Zudilin

We prove that many sequences of positive numbers $(a_n)$ defined by finite linear difference equations $a_{n+k}=c_{k-1}a_{n+k-1}+...+c_0a_n$ with suitable non negative reals coefficients $c_i$ satisfy Bendford's Law on the first digit in…

Dynamical Systems · Mathematics 2010-08-18 Hugues Deligny , Paul Jolissaint

We call positive integer n a near-perfect number, if it is sum of all its proper divisors, except of one of them ("redundant divisor"). We prove an Euclid-like theorem for near-perfect numbers and obtain some other results for them.

Number Theory · Mathematics 2012-02-20 Vladimir Shevelev

We obtain an asymptotic series $\sum_{j=0}^\infty\frac{I_j}{n^j}$ for the integral $\int_0^1[x^n+(1-x)^n]^{\frac1{n}}dx$ as $n\to\infty$, and compute $I_j$ in terms of alternating (or "colored") multiple zeta value. We also show that $I_j$…

Number Theory · Mathematics 2018-03-13 Michael E. Hoffman , Markus Kuba , Moti Levy , Guy Louchard

Let $f$ be an arithmetic function satisfying some simple conditions. The aim of this paper is to establish an asymptotical formula for the quantity \[ S_f(x):=\sum_{n\leq x}\frac{f([x/n])}{[x/n]} \] as $x\rightarrow\infty$, where $[t]$ is…

Number Theory · Mathematics 2023-03-02 Jing Ma , Ronghui Wu

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : \Omega(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$\pi_k(x):=\ \mid\{n\leq x :…

Number Theory · Mathematics 2014-01-14 Martin Belton

Let $X=\{X_n: n\in\mathbb{N}\}$ be a long memory linear process in which the coefficients are regularly varying and innovations are independent and identically distributed and belong to the domain of attraction of an $\alpha$-stable law…

Probability · Mathematics 2023-09-22 Hui Liu , Yudan Xiong , Fangjun Xu

We complete the study of the asymptotic behavior, as $p\rightarrow +\infty$, of the positive solutions to \[ \left\{\begin{array}{lr}-\Delta u= u^p & \mbox{in}\Omega\\ u=0 &\mbox{on}\partial \Omega \end{array}\right. \] when $\Omega$ is any…

Analysis of PDEs · Mathematics 2018-02-13 Francesca De Marchis , Massimo Grossi , Isabella Ianni , Filomena Pacella

Consider any Dirichlet series sum a_n/n^z with nonnegative coefficients a_n and finite sum function f(z)=f(x+iy) when x is greater than 1. Denoting the partial sum a_1+...+a_N by s_N, the paper gives the following necessary and sufficient…

Number Theory · Mathematics 2008-07-04 Jacob Korevaar

For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ in the form $p_1+p_2+m^n=N$, where $p_1$, $p_2$ $-$ prime numbers, $m$ $-$ natural number satisfying the…

Number Theory · Mathematics 2025-10-08 Firuz Rakhmonov

Let the random variable $Z_{n,k}$ denote the number of increasing subsequences of length $k$ in a random permutation from $S_n$, the symmetric group of permutations of $\{1,...,n\}$. We show that $Var(Z_{n,k_n})=o((EZ_{n,k_n})^2)$ as $…

Probability · Mathematics 2007-05-23 Ross Pinsky

In this note, we extend a simple criteria for uniform tightness in $C(0,1)$, the class of real continuous functions defined on $(0,1)$, given in Theorem 8.3 of Billingsley to the asymptotic tightness in $\ell^{+\infty}([a,b])$, the class of…

Probability · Mathematics 2016-10-11 Gane Samb Lo

Let $\mathbb{N}$ be the set of all nonnegative integers. For any positive integer $k$ and any subset $A$ of nonnegative integers, let $r_{1,k}(A,n)$ be the number of solutions $(a_1,a_2)$ to the equation $n=a_1+ka_2$. In 2016, Qu proved…

Number Theory · Mathematics 2023-09-12 Shi--Qiang Chen , Yuchen Ding , Xiaodong Lü , Yuhan Zhang

For relatively prime positive integers $u_0$ and $r$, we consider the least common multiple $L_n:=\mathrm{lcm}(u_0,u_1,\ldots, u_n)$ of the finite arithmetic progression $\{u_k:=u_0+kr\}_{k=0}^n$. We derive new lower bounds on $L_n$ which…

Number Theory · Mathematics 2014-07-03 Daniel M. Kane , Scott D. Kominers

Exact and asymptotic formulae are displayed for the coefficients $\lambda_n$ used in Li's criterion for the Riemann Hypothesis. For $n \to \infty$ we obtain that if (and only if) the Hypothesis is true, $\lambda_n \sim n(A \log n +B)$ (with…

Number Theory · Mathematics 2015-06-23 André Voros

Let $ k,l \geq 2$ be natural numbers, and let $d_k,d_l$ denote the $k$-fold and $l$-fold divisor functions, respectively. We analyse the asymptotic behavior of the sum $\sum_{x<n\leq x+H_1}d_k(n)d_l(n+h)$. More precisely, let…

Number Theory · Mathematics 2025-03-06 Javier Pliego , Yu-Chen Sun , Mengdi Wang

An arithmetic formula is an expression involving only the constant $1$, and the binary operations of addition and multiplication, with multiplication by $1$ not allowed. We obtain an asymptotic formula for the number of arithmetic formulas…

Combinatorics · Mathematics 2014-06-09 Edinah K. Gnang , Maksym Radziwill , Carlo Sanna

A representation for the Riemann zeta function valid for arbitrary complex $s=\sigma+it$ is $\zeta(s)=\sum_{n=0}^\infty A(n,s)$, where \[A(n,s)=\frac{2^{-n-1}}{1-2^{1-s}} \sum_{k=0}^n \left(\!\begin{array}{c}n\\k\end{array}\!\right)…

Classical Analysis and ODEs · Mathematics 2021-06-04 R B Paris