Related papers: On Euler's example of a completely multiplicative …

Assuming the Generalized Riemann Hypothesis, we provide uniform upper bounds with explicit main terms for moduli of $\left(\cL'/\cL\right)(s)$ and $\log{\cL(s)}$ for $1/2+\delta\leq\sigma<1$, fixed $\delta\in(0,1/2)$ and for functions in…

The partial fraction expansion of coth($\pi$z), due to Euler, is generalized to power series having for coefficients the Riemann zeta function evaluated at certain arithmetic sequences. A further generalization using arbitrary Dirichlet…

Let $\omega$ be a non-negative function on $\mathbb{R}$. We are looking for a non-zero $f$ from a given space of entire functions $X$ satisfying $$(a) \quad|f|\leq \omega\text{\quad or\quad(b)}\quad |f|\asymp\omega.$$ The classical…

The $k$-dimensional generalized Euler function $\varphi_k(n)$ is defined to be the number of ordered $k$-tuples $(a_1,a_2,\ldots, a_k) \in \mathbb{N}^k$ with $1\leq a_1,a_2,\ldots, a_k \leq n$ such that both the product $a_1a_2\cdots a_k$…

In this paper, Euler gives the general trionomial coefficient as a sum of the binomial coefficients, the general quadrinomial coefficient as a sum of the binomial and trinomial coefficients, the general quintonomial coefficient as a sum of…

Let $x\geq 1$ be a large integer, and let $a_0<a_1<\cdots<a_{k-1}$ be a small fixed integer $k$-tuple, and let $\mu(n)\in\{-1,0,1\}$ be the periodic Mobius function. This note shows that discrete Fourier transform analysis produces a simple…

Let $m$ be a positive integer and let $\rho(m,n)$ be the proportion of permutations of the symmetric group ${\rm Sym}(n)$ whose order is coprime to $m$. In 2002, Pouyanne proved that $\rho(n,m)n^{1-\frac{\phi(m)}{m}}\sim \kappa_m$ where…

The hyperharmonic numbers h_{n}^{(r)} are defined by means of the classical harmonic numbers. We show that the Euler-type sums with hyperharmonic numbers: {\sigma}(r,m)=\sum_{n=1}^{\infty}((h_{n}^{(r)})/(n^{m})) can be expressed in terms of…

Let $\phi(n)$ be the Euler totient function and $\sigma(n)$ denote the sum of divisors of $n$. In this note, we obtain explicit upper bounds on the number of positive integers $n\leq x$ such that $\phi(\sigma(n)) > cn$ for any $c>0$. This…

{\em The Liouville number}, denoted $l$, is defined by $$l:=0.100101011101101111100...,$$ where the $n$th bit is given by ${1/2}(1+\gl(n))$; here $\gl$ is the Liouville function for the parity of prime divisors of $n$. Presumably the…

The generalized Euler number E_{n|k} counts the number of permutations of {1,2,...,n} which have a descent in position m if and only if m is divisible by k. The classical Euler numbers are the special case when k=2. In this paper, we study…

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

We extend the circle of ideas from a previous paper on hypersurfaces to functions $f \colon (\mathbb C^n, 0) \to (\mathbb C^k, 0)$ with an isolated singularity in a stratified sense on an arbitrary, but fixed complex analytic germ $(X, 0)$.…

Let $X$ be a set of positive integers, and let $\mathbb Z_K$ be the ring of integers of a number field $K$ of degree $n$. Denote by $N(I)$ the absolute norm of an ideal $I$ of $\mathbb Z_K$, and by $\mathcal A$ the set of principal ideals…

The Dickman function F(alpha) gives the asymptotic probability that a large integer N has no prime divisor exceeding N^alpha. It is given by a finite sum of generalized polylogarithms defined by the exquisite recursion L_k(alpha)=-…

We present results for some infinite series appearing in Feynman diagram calculations, many of which are similar to the Euler series. These include both one-dimensional and two-dimensional series. Most of these series can be expressed in…

This paper discusses a few main topics in Number Theory, such as the M\"{o}bius function and its generalization, leading up to the derivation of neat power series for the prime counting function, $\pi(x)$, and the prime-power counting…

We give a simple recursive formula to obtain the general sum of the first $N$ natural numbers to the $r$th power. Our method allows one to obtain the general formula for the $(r+1)$th power once one knows the general formula for the $r$th…

The Chowla conjecture asserts that the values of the Liouville function form a normal sequence of plus and minus ones. Reinterpreted in the language of ergodic theory it asserts that the Liouville function is generic for the Bernoulli…

The generalized group of units of the ring modulo $n$ was first introduced by El-Kassar and Chehade, written as $U^k(Z_n)$. This allows us to formulate a new generalization to the Euler phi function $\varphi(n)$, that represents the order…