A partition-theoretic proof of Fermat's two squares theorem

DOI10.1016/j.disc.2015.12.002zbMath1329.05022OpenAlexW2214131438MaRDI QIDQ906492

David A. Christopher

Publication date: 21 January 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.12.002

zbMATH Keywords

partitiontransposeconjugatetwo squares theorem

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Related Items (2)

A Quixotic Proof of Fermat’s Two Squares Theorem for Prime Numbers ⋮ A Short Proof of Fermat’s Two-square Theorem

Cites Work

• Unnamed Item
• Unnamed Item
• A trinomial analogue of Bailey's lemma and \(N=2\) superconformal invariance
• A Combinatorial Approach to Sums of Two Squares and Related Problems
• A Simple Proof of Fermat's Two-Square Theorem
• A Simple Proof of Jacobi's Two-Square Theorem
• A One-Sentence Proof That Every Prime p≡1(\mod 4) Is a Sum of Two Squares

This page was built for publication: A partition-theoretic proof of Fermat's two squares theorem