English
Related papers

Related papers: Theorematum quorundam arithmeticorum demonstration…

200 papers

A famous conjecture of Erd\H os and Straus is that for every integer $n\ge2$, $4/n$ can be represented as $1/x+1/y+1/z$, where $x,y,z$ are positive integers. This conjecture was generalized to $5/n$ by Sierpi\'nski, and then Schinzel…

Number Theory · Mathematics 2026-01-16 Carl Pomerance , Andreas Weingartner

In the present work we demonstrate that the so called Goldbach conjecture from 1742, All positive even numbers greater than two can be expressed as a sum of two primes, due to Leonhard Euler, is a true statement. This result is partially…

General Mathematics · Mathematics 2007-05-23 P. H. Pereyra , B. E. J. Bodmann

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…

Combinatorics · Mathematics 2007-05-23 Bruce E. Sagan , Ping Zhang

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…

History and Overview · Mathematics 2019-12-10 David J. Pengelley

``In this paper we give the history of Leonhard Euler's work on the pentagonal number theorem, and his applications of the pentagonal number theorem to the divisor function, partition function and divergent series. We have attempted to give…

History and Overview · Mathematics 2007-05-23 Jordan Bell

In this article we show that the form $x^2 + iy^2 + z^2 + iw^2$ represents all gaussian integers. The main tools used in this proof are Fermat's little theorem (over finite field extensions), the Mordell-Niven theorem (representation of…

Number Theory · Mathematics 2014-05-12 Felix Sidokhine

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…

History and Overview · Mathematics 2007-05-23 Leonhard Euler

Let $A$ be a finite set of integers. We show that if $k$ is a prime power or a product of two distinct primes then $$|A+k\cdot A|\geq(k+1)|A|-\lceil k(k+2)/4\rceil$$ provided $|A|\geq (k-1)^{2}k!$, where $A+k\cdot A=\{a+kb:\ a,b\in A\}$. We…

Combinatorics · Mathematics 2014-02-21 Shan-Shan Du , Hui-Qin Cao , Zhi-Wei Sun

We show that the Euler system is not exactly controllable by a finite-dimensional external force. The proof is based on the comparison of the Kolmogorov epsilon-entropy for Holder spaces and for the class of functions that can be obtained…

Analysis of PDEs · Mathematics 2009-11-13 Armen Shirikyan

From the Rhind Papyrus and other extant sources, we know that the ancient Egyptians were very iterested in expressing a given fraction into a sum of unit fractions, that is fractions whose numerators are equal to 1. One of the problems that…

General Mathematics · Mathematics 2009-12-15 Konstantine Zelator

We refine Lagrange's four-square theorem in new ways by imposing some restrictions involving powers of two (including $1$). For example, we show that each $n=1,2,3,\ldots$ can be written as $x^2+y^2+z^2+w^2$ $(x,y,z,w\in\mathbb…

Number Theory · Mathematics 2019-10-11 Zhi-Wei Sun

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.

History and Overview · Mathematics 2012-02-02 Leonhard Euler , Artur Diener , Alexander Aycock

We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m.…

Combinatorics · Mathematics 2012-08-23 William Y. C. Chen , Ae Ja Yee , Albert J. W. Zhu

At a crossroads of calculus and combinatorics, the generating function of secant and tangent numbers (Euler numbers) provides enumeration of alternating permutations. In this article, we present a new refinement of Euler numbers to answer…

Combinatorics · Mathematics 2020-11-17 Masato Kobayashi

We give an explicit formulae for obtaining the translation symmetries in the cartesian product $X^N$, where $N$ is some positive integer and $X$ is some finite set. Moreover, we obtain some fundamental results from elementary number theory.

Number Theory · Mathematics 2025-01-03 Sourav Koner , Sreetamo Roy

We present a proof given by Euler in his paper {\it ``De serierum determinatione seu nova methodus inveniendi terminos generales serierum"} \cite{E189} (E189:``On the determination of series or a new method of finding the general terms of…

History and Overview · Mathematics 2023-09-01 Alexander Aycock

We give a new proof that there are infinitely many primes, relying on van der Waerden's theorem for coloring the integers, and Fermat's theorem that there cannot be four squares in an arithmetic progression. We go on to discuss where else…

Number Theory · Mathematics 2017-08-24 Andrew Granville

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…

History and Overview · Mathematics 2009-08-11 Leonhard Euler , Jordan Bell

This is an English translation from the Latin original of Leonhard Euler's ``Solutio facilior problematis Diophantei circa triangulum, in quo rectae ex angulis latera opposita bisecantes rationaliter exprimantur''. In this paper, Euler…

History and Overview · Mathematics 2007-05-23 Leonhard Euler

In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.

Number Theory · Mathematics 2018-02-13 Shin-ichiro Seki