Related papers: The Newton integral and the Stirling formula

Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\Bbb Z/n\Bbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/(\log x)^{1/2}$, for the counting function of…

This paper investigates the Stirling numbers of the first and second kind associated with a delta series f (t). These numbers provide a robust framework that satisfies the orthogonality and inverse relations, often lacking in recent…

A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994). Realistic bounds for the error with…

We present a proof given by Euler in his paper {\it ``De serierum determinatione seu nova methodus inveniendi terminos generales serierum"} \cite{E189} (E189:``On the determination of series or a new method of finding the general terms of…

We show that the probability that two permutations of $n$ letters have the same number of cycles is \[\sim \frac{1}{2\sqrt{\pi\log{n}}}.\]

We introduce a gamma function $\Ga(x,z)$ in two complex variables which extends the classical gamma function $\Ga(z)$ in the sense that $\lim_{x\to 1}\Ga(x,z)=\Ga(z)$. We will show that many properties which $\Ga(z)$ enjoys extend in a…

For a positive integer $n$, we denote by $F(n)$ the distance from $n$ to the nearest prime number. We prove that every sufficiently large positive integer $N$ can be represented as the sum $N=n_1+n_2$, where $$ F(n_i) \geqslant (\log…

This paper shows that a finite discrete convolution involving Stirling numbers of both kinds and harmonic numbers can be expressed in terms of the Bernoulli numbers. As applications of this expression, the linear recurrence relation for the…

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…

Given the asymptotic expansion for the logarithmic integral $\int_0^n \frac{dt}{\ln(t)}$, obtained from repeated integration by parts until the expansion terms reach a minimum; approaching zero. Which determines a cut-off for the number of…

For any irreducible quadratic polynomial f(x) in Z[x] we obtain the estimate log l.c.m.(f(1),...,f(n))= n log n + Bn + o(n) where B is a constant depending on f.

Five series are evaluated in terms of zeta values. Three of the series involve harmonic numbers and one involves Stirling numbers of the first kind. The evaluation of these series is reduced to the evaluation of certain integrals, including…

Let $\lambda_1(n)$ denote the least invariant factor in the invariant factor decomposition of the multiplicative group $M_n = (\mathbb Z/n\mathbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/\sqrt{\log x}$, for the…

This work shows that, Newton's Proposition 1 in the {\it Principia}, is an {\it exact} graphical representation of a canonical transformation, a first-order symplectic integrator generated at a finite time-step by the Hamiltonian. A…

A new parametric integral is obtained as a consequence of the Riemann hypothesis. An asymptotic multiplicability is the main property of this integral.

We generalize the Stirling numbers of the first kind $s(a,k)$ to the case where $a$ may be an arbitrary real number. In particular, we study the case in which $a$ is an integer. There, we discover new combinatorial properties held by the…

A \emph{double extrema form} of the calculus of variations is put forward in which only the smallest one of the finite differences is physically meaningful to represent the variational derivatives defined on the discrete points. The most…

We find the asymptotics of the series $\sum_{n=1}^\infty (-1)^n n^{-1} \exp(-t/n)$ as $t\to+\infty$. The answer is an oscillating function of $t$ dominated by $\exp(-(2\pi t)^{1/2})$. The intermediate step is to find the asymptotics of the…

For positive integers m and n, denote S(m,n) as the associated Stirling number of the second kind and let z be a complex variable. In this paper, we introduce the Stirling functions S(m,n,z) which satisfy S(m,n,z) = S(m,n) for any z which…

Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…