相关论文: An arithmetic theorem and its demonstration

In chapter VIII of Introductio in analysin infinitorum, Euler derives a series for sine, cosine, and the formula $e^{iv}=\cos v+i\sin v$ His arguments employ infinitesimal and infinitely large numbers and some strange equalities. We…

Translation of the Latin original "Speculationes circa quasdam insignes proprietates numerorum" (1784). E564 in the Enestrom index. In this paper Euler talks about Farey sequences and proves some results about the phi function, the number…

We prove new upper bounds for the number of representations of an arbitrary rational number as a sum of three unit fractions. In particular, for fixed $m$ there are at most $\mathcal{O}_{\epsilon}(n^{3/5+\epsilon})$ solutions of…

Translated from the Latin original "Facillima methodus plurimos numeros primos praemagnos inveniendi" (1778). E718 in the Enestrom index. If m is a number of the form 4k+1 and is a sum of two relatively prime squares, then it is prime if…

This is a translation of an article presented by Leonhard Euler on 18 March 1776 (Opera Omnia I-XVIII, pp. 265-290) and of summaries for it by Sim\'eon Denis Poisson in 1820 and by Heinrich Burkhardt in 1916. An appendix lists in modern…

We show that integrals of the form \[ \dint_{0}^{1} x^{m}{\rm Li}_{p}(x){\rm Li}_{q}(x)dx, (m\geq -2, p,q\geq 1) \] and \[ \dint_{0}^{1} \frac{\ds \log^{r}(x){\rm Li}_{p}(x){\rm Li}_{q}(x)}{\ds x}dx, (p,q,r\geq 1) \] satisfy certain…

This paper, along with E592 and E636, seems to consider the binomial expansion (1+z)^n in the case where z is complex. Euler even gives the sums of divergent series. The paper is translated from Euler's Latin original into German.

E26 in the Enestrom index. Translated from the Latin original, "Observationes de theoremate quodam Fermatiano aliisque ad numeros primos spectantibus" (1732). In this paper Euler gives a counterexample to Fermat's claim that all numbers of…

E30 in the Enestrom index. Translated from the Latin original "De formis radicum aequationum cuiusque ordinis coniectatio" (1733). For an equation of degree n, Euler wants to define a "resolvent equation" of degree n-1 whose roots are…

This is a translation of Euler's 1773 "Variae observationes circa angulos in progressione geometrica progredientes", E561 in the Enestr{\"o}m index. I translated this paper as a result of my study of Euler's work on the infinite product…

Leonhard Euler likely developed his summation formula in 1732, and soon used it to estimate the sum of the reciprocal squares to 14 digits --- a value mathematicians had been competing to determine since Leibniz's astonishing discovery that…

Euler wrote a formula expressing that l(n)/n is a completely multiplicative function with sum 0 (a CMO function) , where l(n) is the completely multiplicative function equal to -1 on the prime numbers (the Liouville function). We extend…

We introduce and study the arithmetic function E_m(n), defined as the sum of the remainders of n when divided by the first m positive integers. Although the definition is elementary, the function encodes rich arithmetic structure. In this…

A rather easy yet rigorous proof of a version of G\"odel's first incompleteness theorem is presented. The version is "each recursively enumerable theory of natural numbers with 0, 1, +, *, =, logical and, logical not, and the universal…

Euler evaluates the integrals in the title and recognizes a recursion between them, which he then uses to give continued fractions for the log and arctan. The paper is translated from Euler's Latin original into German.

In this paper, we present series representations of the remainders in the expansions for $2/(e^t+1)$, $\mbox{sech} t$ and $\coth t$. For example, we prove that for $t > 0$ and $N\in\mathbb{N}:=\{1, 2, \ldots\}$, \[\mbox{sech}\,…

In this paper we consider error sums of the form \[\sum_{m=0}^{\infty} \varepsilon_m\Big( \,b_m\alpha - \frac{a_m}{c_m}\,\Big) \,,\] where $\alpha$ is a real number, $a_m$, $b_m$, $c_m$ are integers, and $\varepsilon_m=1$ or $\varepsilon_m…

For a nonzero integer $a$ let ${E_n^{(a)}}$ be given by $\sum_{k=0}^{[n/2]}\binom n{2k}a^{2k}E_{n-2k}^{(a)}=(1-a)^n$ $(n=0,1,2,...)$, where $[x]$ is the greatest integer not exceeding $x$. As $E_n^{(1)}=E_n$ is the Euler number, $E_n^{(a)}$…

The generalized hyperharmonic numbers $h_n^{(m)}(k)$ are defined by means of the multiple harmonic numbers. We show that the hyperharmonic numbers $h_n^{(m)}(k)$ satisfy certain recurrence relation which allow us to write them in terms of…

The purpose of this article is to introduce the concept of invariance and its properties. These properties can be used to check the primality of a number. Combining these properties with the Euler theorem, it is possible to generalize this…