Sums of \(4k\) squares: a polynomial approach (Q2880112)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6023057
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sums of \(4k\) squares: a polynomial approach |
scientific article; zbMATH DE number 6023057 |
Statements
12 April 2012
0 references
sums of squares
0 references
formulas of Ramanujan
0 references
0.89130956
0 references
0 references
0 references
0 references
0 references
0 references
0.8727975
0 references
0.8717813
0 references
Sums of \(4k\) squares: a polynomial approach (English)
0 references
Let \(k\) and \(n\) be positive integers and \(S_k(u)\) denote the number of representations of \(u\) as the sum of \(k\) squares. Ramanujan gave without proof a formula for \(S_n(u)\), where \(k\) is even, letter proved by Morchell using modular forms. In the case \(k\equiv 0\text{\,mod\,}4\), the authors prove Ramanujan's formula in an entirely elementary way using only simple properties of polynomials. Explicit values of \(S_k(u)\) are determined for \(\varepsilon= 4,8,12,\dots,44\) and \(48\).
0 references
