Sums of squares: An elementary method
Let \(n,s,\alpha,\beta\) be non-negative integers with \(s>0\), \(\alpha+ \beta>0\). Let \(R_s(n)\) denote the number of representations of \(n\) as a sum of \(s\) integral squares, and let \(R_{\alpha, \beta}(n)\) be the number of representations of \(n\) as a sum of \(\alpha+ \beta\) integral squares of which \(\alpha\) are odd and \(\beta\) are even. If \(\alpha+ \beta=2s\) is even and at most 12, there are well-known explicit formulae in which \(R_{2s}(n)\) and \(R_{\alpha, \beta} (n)\) are expressed solely in terms of certain divisor functions. These formulae are most naturally derived from identities among suitable elliptic modular forms (theta series and Eisenstein series). It is the aim of the paper under review to give proofs for these formulae by means of elementary methods not involving modular forms. The author says that he completed his proofs already in 1944 and that his methods are similar, but not identical, with those of the doctoral thesis of \textit{Helmut Bessel} [Königsberg, 1929; JFM 55.0694.02]. Many textbooks on number theory present an elementary proof for \(R_2(n)=4 \sum_{d\mid n}({-1 \over d})\). From a formula for \(R_s(n)\) and \(R_{\alpha, \beta}(n)\) one can pass to formulas for higher values of \(s\), \(\alpha, \beta\) by means of the obvious identity \(R_{a+b}(n)= \sum^n_{m=0} R_a (m)R_b (n-m)\) and a similar, slightly more complicated identity which expresses \(R_{a+b, c+d}(n)\) in terms of the products \(R_{a,c}(m)R_{b,d}(n-m)\). The problem of exploiting such an identity boils down to a study of the sets \(S(n)\) of solutions of \(\xi x+\eta y=n\) in positive integers where \(x,y\) are odd and \(\xi, \eta\) are relatively prime. In an ingenious theorem, the author shows that the set \(S(n)\) splits as a disjoint union of so-called chains of solutions, where each chain starts with a solution satisfying \(|\xi- \eta|=1\), or 0 and ends with a solution satisfying \(x=y\). Within a chain, \(|\xi- \eta|\) increases and \(|x-y|\) decreases, and the number of chains is easily computed. Inevitably, the details of the proof of this theorem and its application are complicated. The methods have already been used in the author's elementary proofs of relations among Eisenstein series [Proc. R. Soc. Edinb., Sect. A 76, 107-117 (1976; Zbl 0347.10019); see also \textit{N. P. Skoruppa}, J. Number Theory 43, 68-73 (1993; Zbl 0786.11021)]. For the entire collection see [Zbl 0935.00033].
- On sums of sixteen squares
- On the number of representations of certain integers as sums of 11 or 13 squares.
- The congruent properties for r_s(n)
- Congruences for r s (n )
- scientific article; zbMATH DE number 3916389 (Why is no real title available?)
- A Simple Derivation of Jacobi's Four-Square Formula
- scientific article; zbMATH DE number 1932102 (Why is no real title available?)
- scientific article; zbMATH DE number 2229022 (Why is no real title available?)
- Finding elementary formulas for theta functions associated to even sums of squares
This page was built for publication: Sums of squares: An elementary method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517794)