Related papers: An arithmetic theorem and its demonstration

We solve the problem of the computation of the orbifold Euler characteristics of $\Mbar_{g,n}$. We take the works of Harer-Zagier \cite{hz} and Bini-Harer \cite{bh} as our starting point, and apply the formalisms developed in \cite{wz} and…

For a fixed positive integer $m$ and any partition $m = m_1 + m_2 + \cdots + m_e$ , there exists a sequence $\{n_{i}\}_{i=1}^{k}$ of positive integers such that $$m=\frac{1}{n_{1}}+\frac{1}{n_{2}}+\cdots+\frac{1}{n_{k}},$$ with the property…

We transformed the generalized exponential power series to another functional form suitable for further analysis. By applying the Cauchy-Euler differential operator in the form of an exponential operator, the series became a sum of…

In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler…

Many classical identities arise from nothing more mysterious than looking at the same object in two different ways. A number, a function, or a combinatorial object may admit several natural decompositions, and by disassembling it in one way…

In recent, H. Sun defined a new kind of refined Eulerian polynomials, namely, \begin{eqnarray*} A_n(p,q)=\sum_{\pi\in \mathfrak{S}_n}p^{{\rm odes}(\pi)}q^{{\rm edes}(\pi)} \end{eqnarray*} for $n\geq 1$, where ${odes}(\pi)$ and ${edes}(\pi)$…

We have proved in this paper that natural logarithm of consecutive number ratio, x/(x-1) approximates to 2/(2x - 1) where x is a real number except 1. Using this relation, we, then proved, x approximates to double the sum of odd harmonic…

This paper derives Touchard's theorem from Euler's form for odd perfect numbers. It also fine-tunes Euler's form.

Menon's identity states that for every positive integer $n$ one has $\sum (a-1,n) = \varphi(n) \tau(n)$, where $a$ runs through a reduced residue system (mod $n$), $(a-1,n)$ stands for the greatest common divisor of $a-1$ and $n$,…

We consider the $d$-dimensional incompressible Euler equations. We show strong illposedness of velocity in any $C^m$ spaces whenever $m\ge 1$ is an \emph{integer}. More precisely, we show for a set of initial data dense in the $C^m$…

The aim of this article is to present in a self-contained way identities arising in elementary number theory, among which the following one: $$ \sum_{d\mid n}\frac{\mu^2(d)}{\varphi(d)\,d^s}=\prod_{p\mid n}\left(1+\frac{1}{(p-1)p^s}\right).…

Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…

This paper is concerned with the study of the fractional finite sums theory. We present the classes of functions for which it is possible to characterize the constant related to the derivative of fractional sums (denominated by essence of a…

The numbers of even and odd permutations with a given ascent number are investigated using an operator that was previously introduced by the author. Their difference is called a signed Eulerian number. By means of the operator the…

In this paper we study restricted sum formulas involving alternating Euler sums which are defined by \zeta(s_1,...,s_{d};\epsilon_1,...,\epsilon_d)=\sum_{n_1>...>n_d\ge 1}\frac{\epsilon_1^{n_1}... \epsilon_{d}^{n_d}}{n_1^{s_1}...…

We extend the classical Euler-Maclaurin expansion to sums over multidimensional lattices that involve functions with algebraic singularities. This offers a tool for the precise quantification of the effect of microscopic discreteness on…

Determination of linear combination of exponential functions with unknown rate constants from its sampled values is a problem of considerable interest. Here we present a constructive and explicit solution to this problem. Moments of such…

Linear harmonic number sums had been studied by a variety of authors during the last centuries, but only few results are known about nonlinear Euler sums of quadratic or even higher degree. The first systematic study on nonlinear Euler sums…

In this paper we study mixed sums of primes and linear recurrences. We show that if m=2(mod 4) and m+1 is a prime then $(m^{2^n-1}-1)/(m-1)\not=m^n+p^a$ for any n=3,4,... and prime power p^a. We also prove that if a>1 is an integer, u_0=0,…

The {\em Liouville function} is defined by $\gl(n):=(-1)^{\Omega(n)}$ where $\Omega(n)$ is the number of prime divisors of $n$ counting multiplicity. Let $\z_m:=e^{2\pi i/m}$ be a primitive $m$--th root of unity. As a generalization of…