A Combinatorial Approach to Sums of Two Squares and Related Problems
From MaRDI portal
Recommendations
- Combinatorial proofs of the two-squares theorem and generalizations
- On sumsets of subsets of squares
- scientific article; zbMATH DE number 2202720
- A Combinatorial Approach to Sums of Integer Powers
- The additive problem for the number of representations as a sum of two squares
- On sums of two squarefull numbers
- Sums of squares and partition congruences
- On some numbers related to extremal combinatorial sum problems
Cited in
(14)- Combinatorial proofs of the two-squares theorem and generalizations
- New looks at old number theory
- Representing integers as the sum of two squares in the ring Z_n
- A computational substantiation of the d-step approach to the number of distinct squares problem
- A short proof of Fermat's two-square theorem
- Pythagorean primes and palindromic continued fractions
- scientific article; zbMATH DE number 1122843 (Why is no real title available?)
- scientific article; zbMATH DE number 1788103 (Why is no real title available?)
- A Family Portrait of Primes-A Case Study in Discrimination
- scientific article; zbMATH DE number 866552 (Why is no real title available?)
- A Tale of Two Squares-and Two Rings
- Polynomial Representations of Sums of Two Squares
- A Quixotic Proof of Fermat’s Two Squares Theorem for Prime Numbers
- A partition-theoretic proof of Fermat's two squares theorem
This page was built for publication: A Combinatorial Approach to Sums of Two Squares and Related Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996308)