Related papers: Theoremata arithmetica nova methodo demonstrata

In this paper we propose a new point of view on weak solutions of the Euler equations, describing the motion of an ideal incompressible fluid in $\mathbb{R}^n$ with $n\geq 2$. We give a reformulation of the Euler equations as a differential…

We formalize a complete proof of the regular case of Fermat's Last Theorem in the Lean4 theorem prover. Our formalization includes a proof of Kummer's lemma, that is the main obstruction to Fermat's Last Theorem for regular primes. Rather…

We propose a new approach at Fermat's Last Theorem (FLT) solution: for each FLT equation we associate a polynomial of the same degree. The study of the roots of the polynomial allows us to investigate the FLT validity. This technique,…

A folklore proof of Euclid's theorem on the infinitude of primes uses the Euler product and the irrationality of $\zeta(2) = \pi^2/6$. A quantified form of Euclid's Theorem is Bertrand's postulate $p_{n+1} < 2p_n$. By quantifying the…

In this paper two conjectures are proposed based on which we can prove the first case of Fermat's Last Theorem(FLT) for all primes $p \equiv -1 (\bmod~6)$. With Pollaczek's result {\bf [1]} and the conjectures the first case of FLT can be…

This paper has two parts. The first part surveys Euler's work on the constant gamma=0.57721... bearing his name, together with some of his related work on the gamma function, values of the zeta function and divergent series. The second part…

Euler's identity equates the number of partitions of any non-negative integer n into odd parts and the number of partitions of n into distinct parts. Beck conjectured and Andrews proved the following companion to Euler's identity: the…

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…

By using of Euler's difference table, we obtain simple explicit formula for the decomposition of $k$-th tensor power of adjoint representation of $A_n$ Lie algebra at $2 k \le{n+1}$.

In this note we will present how Euler's investigations on various different subjects lead to certain properties of the Legendre polynomials. More precisely, we will show that the generating function and the difference equation for the…

While preparing the correspondence between Leonhard Euler and Christian Goldbach for publication, Martin Mattmueller asked whether the lemma given in the postscript of Euler's letter dated July 26, 1749, was enough for completing the proof…

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…

We study a class of approximations to the Riemann zeta function introduced earlier by the second author on the basis of Euler product. This allows us to justify Euler Product Sieve for generation of prime numbers. Also we show that Bounded…

A composite positive integer $n$ has the Lehmer property if $\phi(n)$ divides $n-1,$ where $\phi$ is an Euler totient function. In this note we shall prove that if $n$ has the Lehmer property, then $n\leq 2^{2^{K}}-2^{2^{K-1}}$, where $K$…

Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat's theorem. For an integer $N$, the test tries to find an…

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…

Euler's partition identity states that the number of partitions of $n$ into odd parts is equal to the number of partitions of $n$ into distinct parts. Strikingly, Straub proved in 2016 that this identity also holds when counting partitions…

A new derivation of Golomb's limit formula for generating the $n$th$+1$ prime number is presented. The limit formula is derived by extracting $p_{n+1}$ from Euler's prime product representation of the Riemann zeta function $\zeta(s)$ in the…

We give a triplet of short proofs, each of which answers a question raised by Erd\H{o}s. The first concerns the small prime factors of $\binom{n}{k}$, the second concerns whether an additive basis $A$ can always be split into pieces $A_1$…

We begin by reporting on some recent results of the authors (Frederico and Torres, 2006), concerning the use of the fractional Euler-Lagrange notion to prove a Noether-like theorem for the problems of the calculus of variations with…