scientific article; zbMATH DE number 1942863
From MaRDI portal
Publication:4409388
Euler proved a strong form of Fermat's theorem: a number of the form \(4n+1\) with \(n\) a positive integer is prime if and only if it can be represented as a sum of two squares in a unique way. The author considers entries in Euler's notebooks that show how he arrived at his results and at about what time he investigated these matters and wrote some of his letters and articles. For the entire collection see [Zbl 1013.00019].
Recommendations
Cited in
(11)- Euler's notebooks: The notes concerning analytical number theory, series and continued fractions
- A note on Euler's factoring problem
- scientific article; zbMATH DE number 3843693 (Why is no real title available?)
- A prime testing algorithm from Leonhard Euler
- Euler and number theory
- Sierpinski's Theorem is Deducible from Euler and Dirichlet
- scientific article; zbMATH DE number 1105182 (Why is no real title available?)
- Euler's E228: primality testing and factoring via sums of squares
- Euler's favorite proof meets a theorem of Vantieghem
- A new look at some facts of number theory: alternate divisibility when constructing simple solutions to problems of arithmetic
- Euler, Goldbach, and ``Fermat's theorem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4409388)