Related papers: Observations on a certain theorem of Fermat and on…

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…

Euler proves that the sum of two 4th powers can't be a 4th power and that the difference of two distinct non-zero 4th powers can't be a 4th power and Fermat's theorem that the equation x(x+1)/2=y^4 can only be solved in integers if x=1 and…

Euler presents a third proof of the Fermat theorem, the one that lets us call it the Euler-Fermat theorem. This seems to be the proof that Euler likes best. He also proves that the smallest power x^n that, when divided by a numer N, prime…

In his book "250 Problems in Elementary Number Theory", W.Sierpinski shows that the numbers 1+2^(2^n)+2^(2^n+1) are divisible by 21; for n=1,2,.... In this paper, we prove a similar but more general result.Consider the natural numbers of…

E158 in the Enestrom index. Translation of the Latin original "Observationes analyticae variae de combinationibus" (1741). This paper introduces the problem of partitions, or partitio numerorum (the partition of integers). In the first part…

In 1737 Leonard Euler gave what we often now think of as a new proof, based on infinite series, of Euclid's theorem that there are infinitely many prime numbers. Our short paper uses a simple modification of Euler's argument to obtain new…

Translation from the Latin of Euler's "Demonstratio theorematis circa ordinem in summis divisorum observatum" (1760). E244 in the Enestroem index. In his previous paper E243, Euler stated the pentagonal number theorem and assuming it proved…

E394 in the Enestrom index. Translated from the Latin original, "De partitione numerorum in partes tam numero quam specie datas" (1768). Euler finds a lot of recurrence formulas for the number of partitions of $N$ into $n$ parts from some…

This is an English translation of Euler's ``Theoremata circa residua ex divisione potestatum relicta'', Novi Commentarii academiae scientiarum Petropolitanae 7 (1761), 49-82. E262 in the Enestrom index. Euler gives many elementary results…

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…

Translated from the Latin original, "De numeris amicabilibus" (1747). E100 in the Enestroem index. Euler starts by saying that with the success of mathematical analysis, number theory has been neglected. He argues that number theory is…

Euler's theorem asserts that $A(n)=B(n)$ where $A(n)$ is the number of partitions of $n$ into distinct parts and $B(n)$ is the number of partitions of $n$ into odd parts. In this paper, it is proved that for $n>0$, \begin{align*}…

Translated from the Latin original, "Observationes generales circa series, quarum termini secundum sinus vel cosinus angulorum multiplorum progrediuntur" (1777). E655 in the Enestrom index. Euler looks at the binomial expansion $(1+x)^n$…

A composite number $n$ is called Lehmer when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. In 1932, D.~H.~Lehmer conjectured that there are no composite Lehmer numbers and showed that Lehmer numbers must be odd and…

In 1876, Edouard Lucas showed that if an integer $b$ exists such that $b^{n-1} \equiv 1 (\mathrm{mod} \ n)$ and $b^{(n-1)/p} \not\equiv 1( \mathrm{mod} \ n)$ for all prime divisors $p$ of $n-1$ , then $n$ is prime, a result known as Lucas's…

We present an elementary inductive proof which Euler could have obtained, for the corresponding result as the title indicates, had he refined a bit his proof for Fermat's assertion on representing primes as two squares.

E565 in the Enestrom index. Translated from the Latin original, "De plurimis quantitatibus transcendentibus quas nullo modo per formulas integrales exprimere licet" (1775). Euler does not prove any results in this paper. It seems to me like…

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…

Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as sums of two…

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…