Considering $\mathbb{Z}_n$ the ring of integers modulo $n$, the classical Fermat-Euler theorem establishes the existence of a specific natural number $φ(n)$ satisfying the following property: $ x^{φ(n)}=1%\hspace{1.0cm}\text{for all}\hspace{0.2cm}x\in \mathbb{Z}_n^*, $ for all $x$ belonging to the group of units of $\mathbb{Z}_n$. In this manuscript, this result is extended to a class of rings that satisfies some mild conditions.
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 of Fermat's Four Squares Theorem. In this article we will show that Euler's result can in fact be used for proving this result via induction.
We give a proof of Fermat's little theorem which does not use nor arithmetic(Euclidean algorithm) neither algebra (group theory), but it rather employs the field of the formal power series Q((x)). The note is an example of a mathematical joke, though it contains a rigorous proof. (The paper will appear in print exactly as in the version v3).
Jacob's ladders, logarithmic modification of the Hardy-Littlewood integral (1918), Titchmarsh's $Ω$-theorem (1928) and new point of contact with the Fermat-Wiles theorem
Jacob's ladders, almost linear increments of the Hardy-Littlewood integral (1918), the classical Dirichet's sum of divisors (1849) and their relationship with the Fermat-Wiles theorem
Jacob's ladders, almost linear increments of the Hardy-Littlewood integral (1918) and their relation to the Titchmarsh's sums (1943) and the Fermat-Wiles theorem
Jacob's ladders and new equivalents of the Fermat-Wiles theorem connected with some cross-bred of the formulae of Hardy-Littlewood-Ingham (1926) and of Ingham (1926)
Jacob's ladders, Hardy-Littlewood integral (1918) and new asymptotic functional equations for Euler's Gamma function together with the tenth equivalent of the Fermat-Wiles theorem
`Fermat's Last Theorem for the exponent 3 has received numerous proofs, the most common of which being either in Euler's or in Gauss' style. This latter works entirely in the ring of integers of the quadratic field generated by the square root of -3. A proof in Euler's style is based on a central lemma related to properties of the quadratic form x^2 + 3y^2, then it proceeds by descent by considering Two main cases. In the present version, the central lemma receives a short proof and the classical proof by descent in Two main cases boils down to a One-case proof.
We determine the limiting distribution of the normalized Euler factors of an abelian threefold A defined over a number field k when A is geometrically isogenous to the cube of a CM elliptic curve defined over k. As an application, we classify the Sato-Tate distributions of the Jacobians of twists of the Fermat and Klein quartics, obtaining 54 and 23, respectively, and 60 in total. We encounter a new phenomenon not visible in dimensions 1 or 2: the limiting distribution of the normalized Euler factors is not determined by the limiting distributions of their coefficients.
Jacob's ladders, almost exact decomposition of certain increments of the Hardy-Littlewood integral (1918) by means of the Raabe's integral and the thirteenth equivalent of the Fermat-Wiles theorem
We study and generalize some arithmetical properties of the classes (2^k+) and (2^k-) introduced by V. I. Arnold: a number n belongs to the class (N+) if N|φ(n) and 2^{\frac{φ(n)}{N}} \equiv 1 mod n where φ(n) is the Euler function, and belongs to the class (M-) if M|φ(n) and 2^{\frac{φ(n)}{M}} \equiv -1 mod n. The classes (2+), (2-),(4+), (4-), (8+)and (8-) are studied by V. I. Arnold and here we will show general properties of the classes (2^k+) and (2^k-) and we will see that the properties which is proved by V. I. Arnold are special cases of ours.
Jacob's ladders, almost linear increments of the Hardy-Littlewood integral (1918) and their relations to the Selberg's formula (1946) and the Fermat-Wiles theorem
Jacob's ladders, our asymptotic formulae (1981) and next $ζ$-equivalents of the Fermat-Wiles theorem together with decomposition and synthesis of the Riemann's $ζ$-oscillators
We define a "period ring-valued beta function" and give a reciprocity law on its special values. The proof is based on some results of Rohrlich and Coleman concerning Fermat curves. We also have the following application. Stark's conjecture implies that the exponential of the derivatives at $s=0$ of partial zeta functions are algebraic numbers which satisfy a reciprocity law under certain conditions. It follows from Euler's formulas and properties of cyclotomic units when the base field is the rational number field. In this paper, we provide an alternative (and partial) proof by using the reci…
Fermat-Euler quotients arose from the study of the first case of Fermat's Last Theorem, and have numerous applications in number theory. Recently they were studied from the cryptographic aspects by constructing many pseudorandom binary sequences, whose linear complexities and trace representations were calculated. In this work, we further study their correlation measures by using the approach based on Dirichlet characters, Ramanujan sums and Gauss sums. Our results show that the $4$-order correlation measures of these sequences are very large. Therefore they may not be suggested for cryptograp…
The structure of the group $(\mathbb{Z}/n\mathbb{Z})^\star$ and Fermat's little theorem are the basis for some of best-known primality testing algorithms. Many related concepts arise: Euler's totient function and Carmichael's lambda function, Fermat pseudoprimes, Carmichael and cyclic numbers, Lehmer's totient problem, Giuga's conjecture, etc. In this paper, we present and study analogues to some of the previous concepts arising when we consider the underlying group $\mathcal{G}_n:=\{a+bi\in\mathbb{Z}[i]/n\mathbb{Z}[i] : a^2+b^2\equiv 1\ \textrm{$\pmod n$}\}$. In particular we characterize Gau…
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 converse of Fermat's little theorem. This result was considerably improved by Henry Pocklington in 1914 when he showed that it's not necessary to know all the prime factors of $n-1$ in order to determine if $n$ is prime. In this paper we optimize Pocklington's primality test for integers of the form $ap^{k}+1$ where $p$ is prime, $a<p$, $k\ge 1$. An extensi…
Euler wants to find rational numbers (integers) x and y such that x+y is a square and x^2+y^2 is a fourth power. He parametrizes these with two other variables that satisfy certain equations.
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 the form 2^{2^m}+1 are primes, by showing 2^{2^5}+1=4294967297 is divisible by 641. He also considers many cases in which we are guaranteed that a number is composite, but he notes clearly that it is not possible to have a full list of circumstances under which a number is composite. He then gives a theorem and several corollaries of it, but he says that he …
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 some gaussians), and the generalized Euler-identity over finite field extensions.
Denote by $Σn^m$ the sum of the $m$-th powers of the first $n$ positive integers $1^m+2^m+\ldots +n^m$. Similarly let $Σ^r n^m$ be the $r$-fold sum of the $m$-th powers of the first $n$ positive integers, defined such that $Σ^0 n^{m}=n^m$, and then recursively by $Σ^{r+1} n^{m}=Σ^{r} 1^{m}+Σ^{r} 2^{m}+\ldots + Σ^{r} n^{m}$. During the early 17th-century, polynomial expressions for the sums $Σ^r n^m$ and their factorisation and polynomial basis representation properties were examined by Johann Faulhaber, who published some remarkable theorems relating to these $r$-fold sums in his Academia Alge…
We revisit old conjectures of Fermat and Euler regarding representation of integers by binary quadratic form x^2+5y^2. Making use of Ramanujan's_1ψ_1 summation formula we establish a new Lambert series identity for \sum_{n,m=-\infty}^{\infty} q^{n^2+5m^2}. Conjectures of Fermat and Euler are shown to follow easily from this new formula. But we don't stop there. Employing various formulas found in Ramanujan's notebooks and using a bit of ingenuity we obtaina collection of new Lambert series for certain infinite products associated with quadratic forms such as x^2+6y^2, 2x^2+3y^2, x^2+15y^2, 3x^…
The Euler phi function on a given integer $n$ yields the number of positive integers less than $n$ that are relatively prime to $n$. Equivalently, it gives the order of the group of units in the quotient ring $\mathbb{Z}/(n)$. We generalize the Euler phi function to the Eisenstein integer ring $\mathbb{Z}[ρ]$ where $ρ$ is the primitive third root of unity $e^{2πi/3}$ by finding the order of the group of units in the ring $\mathbb{Z}[ρ]/(θ)$ for any given Eisenstein integer $θ$. As one application we investigate a sufficiency criterion for when certain unit groups $\left(\mathbb{Z}[ρ]/(γ^n)\rig…
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 on power residues modulo a prime number p. He shows that the order of a subgroup generated by an element a in F_p^* must divide the order p-1 of F_p^* (i.e. a special case of Lagrange's theorem for cyclic groups). Euler also gives a proof of Fermat's little theorem, that a^{p-1} = 1 mod p for a relatively prime to p (i.e. not 0 mod p). He remarks that this pr…
In two papers, Little and Sellers introduced an exciting new combinatorial method for proving partition identities which is not directly bijective. Instead, they consider various sets of weighted tilings of a $1 \times \infty$ board with squares and dominoes, and for each type of tiling they construct a generating function in two different ways, which generates a $q$-series identity. Using this method, they recover quite a few classical $q$-series identities, but Euler's Pentagonal Number Theorem is not among them. In this paper, we introduce a key parameter when constructing the generating fu…
A set S of integers is said to be multiplicative if for every pair m and n of coprime integers we have that mn is in S iff both m and n are in S. Both Landau and Ramanujan gave approximations to S(x), the number of n<=x that are in S, for specific choices of S. The asymptotical precision of their respective approaches are being compared and related to Euler-Kronecker constants, a generalization of Euler's constant gamma=0.57721566.... This paper claims little originality, its aim is to give a survey on the literature related to this theme with an emphasis on the contributions of the author (an…
