Related papers: A recursion formula for the generalized Euler func…

In this paper, we give a short elementary proof of the well known Euler's recurrence formula for the Riemann zeta function at positive even integers and integral representations of the Riemann zeta function at positive integers and at…

Motivated by the classical Eulerian number, descent and excedance numbers in the hyperoctahedral groups, an triangular array from staircase tableaux and so on, we study a triangular array $[\mathcal {T}_{n,k}]_{n,k\ge 0}$ satisfying the…

We generalize the derivation of the Wallis formula for $\pi$ from a variational computation of the spectrum of the Hydrogen atom. We obtain infinite product formulas for certain combinations of gamma functions, which include irrational…

In this work, the authors provide closed forms and recurrence expressions for computing the $k$th power of the formal power series, some of them in terms of a determinant of some matrices. As a consequence, we obtain the reciprocal of the…

The Euler-MacLaurin summation formula relates a sum of a function to a corresponding integral, with a remainder term. The remainder term has an asymptotic expansion, and for a typical analytic function, it is a divergent (Gevrey-1) series.…

We present an algorithm to invert the Euler function $\phi(m)$. The algorithm, for a given $n \geq 1$, in polynomial time ``on average'', finds the set $\Psi(n)$ of all solutions $m$ to $\phi(m) = n$. In fact, in the worst case, $\Psi(n)$…

We define the generalized-Euler-constant function $\gamma(z)=\sum_{n=1}^{\infty} z^{n-1} (\frac{1}{n}-\log \frac{n+1}{n})$ when $|z|\leq 1$. Its values include both Euler's constant $\gamma=\gamma(1)$ and the "alternating Euler constant"…

In this paper, we investigate the Euler-type integral representations for the generalized hypergeometric matrix function and develop some transformations in terms of hypergeometric matrix functions. Furthermore, unit and half arguments have…

We study the structure of analytic continuation of solutions of an even rank system of linear ordinary differential equations of Okubo normal form (ONF). We develop an adjustment of the method by using the Euler integral for evaluating the…

The main result is a generalization of Keller's recursion equation for finding a prime number given the previous primes. We also examine the convergence of the limit in Keller's equation and the convergence of the limit in the general…

In this short note, we introduce an Euler analogue of Wilson's theorem; $a_1a_2... a_{\phi(n)}\equiv (-1)^{\phi(n)+1}~({\rm mod}~n)$ say, where ${\rm gcd}(a_i,n)=1$.

Let $H_k = 1 + 1/2 + 1/3 + \cdots + 1/k$ denote the $k$th harmonic number. We present an easy-to-implement algorithm for the computation of explicit closed-form evaluations, in terms of the digamma and polygamma functions, for Euler sums of…

Euler's totient function, $\varphi(n)$, which counts how many of $0,1,\dots,n-1$ are coprime to $n$, has an explicit asymptotic lower bound of $n/\log \log n$, modulo some constant. In this note, we generalise $\varphi$; given an…

For a given real number $a$ we define the sequence $\{E_{n,a}\}$ by $E_{0,a}=1$ and $E_{n,a}=-a\sum_{k=1}^{[n/2]} \binom n{2k}E_{n-2k,a}$ $(n\ge 1)$, where $[x]$ is the greatest integer not exceeding $x$. Since $E_{n,1}=E_n$ is the n-th…

The Euler-Maclaurin formula which relates a discrete sum with an integral, is generalised to the setting of Riemann-Stieltjes sums and integrals on stochastic processes whose paths are a.s. rectifiable, namely, continuous and with bounded…

We propose a generic algorithm for computing the inverses of a multiplicative function under the assumption that the set of inverses is finite. More generally, our algorithm can compute certain functions of the inverses, such as their power…

In this paper, we find a new recurrence formula fo the Euler zeta functions.

Summation formulas, such as the Euler-Maclaurin expansion or Gregory's quadrature, have found many applications in mathematics, ranging from accelerating series, to evaluating fractional sums and analyzing asymptotics, among others. We show…

Let us denote by $\tau(n)$ and $\si(n)$ the number and the sum of the divisors of $n$ and by $\vfi$ Euler's function. We give effective upper bounds for $\frac{n}{\vfi(n)}$ in terms of $\vfi(n)$, and for $\frac{\si(n)}{n}$ in terms of…

The aim of this note is to provide an upper bound of the number of positive integers $\le x$ which can be written as $\varphi(n)$ for some positive integer $n$, where $\varphi$ stands for the Euler's function. The order of magnitude of this…