A Short Proof of Jacobi's Formula for the Number of Representations of an Integer as a Sum of Four Squares
From MaRDI portal
Publication:5286090
DOI10.2307/2324461zbMATH Open0769.11020arXivmath/9206203OpenAlexW2963289873MaRDI QIDQ5286090FDOQ5286090
Authors: George E. Andrews, Shalosh B. Ekhad, Doron Zeilberger 
Publication date: 29 June 1993
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Abstract: A short and elementary proof, and a finite-form generalization, are given of Jacobi's formula for the number of ways of writing an integer as a sum of four squares (that implies Lagrange's famous 1777 theorem.)
Full work available at URL: https://arxiv.org/abs/math/9206203
Recommendations
Cited In (12)
- Partial Fractions and Four Classical Theorems of Number Theory
- Partition bijections, a survey
- An elementary proof of Jacobi's six squares theorem
- Jacobi's four and eight squares theorems and partitions into distinct parts
- Parameter augmentation and the \(q\)-Gosper algorithm
- A basis for \(S_k(\Gamma_0(4))\) and representations of integers as sums of squares
- The death of proof? Semi-rigorous mathematics? You've got to be kidding!
- Convolution sums of some functions on divisors
- The many aspects of counting lattice points in polytopes
- Title not available (Why is that?)
- A Simple Derivation of Jacobi's Four-Square Formula
- Approximate set union via approximate randomization
This page was built for publication: A Short Proof of Jacobi's Formula for the Number of Representations of an Integer as a Sum of Four Squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286090)
