相关论文: An arithmetic theorem and its demonstration

P. Flajolet and B. Salvy \cite{FS1998} prove the famous theorem that a nonlinear Euler sum $S_{i_1i_2\cdots i_r,q}$ reduces to a combination of sums of lower orders whenever the weight $i_1+i_2+\cdots+i_r+q$ and the order $r$ are of the…

Consider the operator $E$ on arithmetic functions such that $Ef$ is the multiplicative arithmetic function defined by $(Ef)(p^a) = f(a)$ for every prime power $p^a$. We investigate the behaviour of $E^m\tau_k$, where $\tau_k$ is a…

Geometrically, $\int_{a}^{b}\frac{1}{x}dx$ means the area under the curve $\frac{1}{x}$ from $a$ to $b$, where $0<a<b$, and this area gives a positive number. Using this area argument, in this expository note, we present some visual…

In this note, we provide refined estimates of the following sums involving the Euler totient function: $$\sum_{n\le x} \phi\left(\left[\frac{x}{n}\right]\right) \qquad \text{and} \qquad \sum_{n\le x} \frac{\phi([x/n])}{[x/n]}$$ where $[x]$…

In this short, we study sums of the shape $\sum_{n\leqslant x}{f([x/n])}/{[x/n]},$ where $f$ is Euler totient function $\varphi$, Dedekind function $\Psi$, sum-of-divisors function $\sigma$ or the alternating sum-of-divisors function…

In this paper we establish a new formula for the arithmetic functions that verify $ f(n) = \sum_{d|n} g(d)$ where $g$ is also an arithmetic function. We prove the following identity, $$\forall n \in \mathbb{N}^*, \ \ \ f(n) = \sum_{k=1}^n…

Let $n$ be a non-negative integer and put $p_{n}(x)=\prod_{i=0}^{n}(x+i)$. In the first part of the paper, for given $n$, we study the existence of integer solutions of the Diophantine equation $$ y^m=p_{n}(x)+\sum_{i=1}^{k}p_{a_{i}}(x), $$…

A generating function is given for the number, $E(l,k)$, of irreducible $k$-fold Euler sums, with all possible alternations of sign, and exponents summing to $l$. Its form is remarkably simple: $\sum_n E(k+2n,k) x^n = \sum_{d|k}\mu(d)…

We show how the formulas in paper Variae considerationes circa series hypergeometricas written by Euler imply the duplication formula for the Gamma-function. This paper can be seen as an Addendum to a previous paper by the author.

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

A detailed analysis of the remainder obtained by truncating the Euler series up to the $n$th-order term is presented. In particular, by using an approach recently proposed by Weniger, asymptotic expansions of the remainder, both in inverse…

This is an exposition of facts about Arithmetic with an approach via mathematical logic. In Section 1 we present Peano Arithmetic, PA, and the complete theory of $\mathbb{N}$, and we show that $\mathbb{N}$ is a prime model of the theory of…

In this work we present a matrix generalization of the Euler identity about exponential representation of a complex number. The concept of matrix exponential is used in a fundamental way. We define a notion of matrix imaginary unit which…

Theorem 1 Let F:N-->R stand for any function which a) $F$ monotonically weakly increases; b) $F$ tends to infinity; and c) such that $q/F(q)$ tends to infinity. Let Z_F(q) equal the number of divisors of q less than sqrt{F(q)} minus the…

Translation from the Latin original "Utrum hic numerus 1000009 sit primus necne inquiritur" (1778). E699 in the Enestrom index. The idea of this paper is that if some number is a sum of two squares in two ways, then some other smaller…

This note tries to show that a re-examination of a first course in analysis, using the more sophisticated tools and approaches obtained in later stages, can be a real fun for experts, advanced students, etc. We start by going to the…

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider…

We say that $d$ is an exponential unitary divisor of $n=p_1^{a_1}... p_r^{a_r}>1$ if $d=p_1^{b_1}... p_r^{b_r}$, where $b_i$ is a unitary divisor of $a_i$, i.e., $b_i\mid a_i$ and $(b_i,a_i/b_i)=1$ for every $i\in \{1,2,...,r\}$. We survey…

Euler states without proof statements about the form of prime divisors of numbers of the form aa+Nbb. See Ed Sandifer's How Euler Did It, ``Factors of Forms'', December 2005 at http://www.maa.org/news/howeulerdidit.html for a summary of the…

For integer $n\geqslant 1$ and real number $z\geqslant 1$, define $M(n,z):=\sum_{d|n,\,d\leqslant z}\mu(d)$ where $\mu$ denotes the M\"obius function. Put ${\cal L}(y):=\exp\left\{(\log y)^{3/5}/(\log_2y)^{1/5}\right\}$ $(y\geqslant 3)$. We…