Sum of squares function

In number theory, the sum of squares function is an arithmetic function that gives the number of representations for a given positive integer n as the sum of k squares, where representations that differ only in the order of the summands or in the signs of the numbers being squared are counted as different, and is denoted by rk(n).

Definition

The function is defined as

where denotes the cardinality of a set. In other words, rk(n) is the number of ways n can be written as a sum of k squares.

For example, since where each sum has two sign combinations, and also since with four sign combinations. On the other hand, because there is no way to represent 3 as a sum of two squares.

Formulae

k = 2

Integers satisfying the sum of two squares theorem are squares of possible distances between integer lattice points; values up to 100 are shown, with
Squares (and thus integer distances) in red
Non-unique representations (up to rotation and reflection) bolded

The number of ways to write a natural number as sum of two squares is given by r2(n). It is given explicitly by

where d1(n) is the number of divisors of n which are congruent to 1 modulo 4 and d3(n) is the number of divisors of n which are congruent to 3 modulo 4. Using sums, the expression can be written as:

The prime factorization , where are the prime factors of the form and are the prime factors of the form gives another formula

, if all exponents are even. If one or more are odd, then .

k = 3

Gauss proved that for a squarefree number n > 4,

where h(m) denotes the class number of an integer m.

There exist extensions of Gauss' formula to arbitrary integer n.[1][2]

k = 4

The number of ways to represent n as the sum of four squares was due to Carl Gustav Jakob Jacobi and it is eight times the sum of all its divisors which are not divisible by 4, i.e.

Representing n = 2km, where m is an odd integer, one can express in terms of the divisor function as follows:

k = 6

The number of ways to represent n as the sum of six squares is given by

where is the Kronecker symbol.[3]

k = 8

Jacobi also found an explicit formula for the case k = 8:[3]

Generating function

The generating function of the sequence for fixed k can be expressed in terms of the Jacobi theta function:[4]

where

Numerical values

The first 30 values for are listed in the table below:

n=r1(n)r2(n)r3(n)r4(n)r5(n)r6(n)r7(n)r8(n)
0011111111
11246810121416
22041224406084112
330083280160280448
42224624902525741136
550824481123128402016
62×300249624054412883136
770006432096023685504
823041224200102034449328
9322430104250876354212112
102×508241445601560442414112
11110024965602400756021312
1222×3008964002080924031808
131308241125602040845635168
142×7004819280032641108838528
153×500019296041601657656448
16242462473040921849474864
1717084814448034801780878624
182×320436312124043801974084784
191900241601520720027720109760
2022×50824144752655234440143136
213×700482561120460829456154112
222×1100242881840816031304149184
232300019216001056049728194688
2423×30024961200822452808261184
2552212302481210781243414252016
262×13087233620001020052248246176
2733003232022401312068320327040
2822×700019216001248074048390784
2929087224016801010468376390240
302×3×5004857627201414471120395136

See also

References

  1. P. T. Bateman (1951). "On the Representation of a Number as the Sum of Three Squares" (PDF). Trans. Amer. Math. Soc. 71: 70–101. doi:10.1090/S0002-9947-1951-0042438-4.
  2. S. Bhargava; Chandrashekar Adiga; D. D. Somashekara (1993). "Three-Square Theorem as an Application of Andrews' Identity" (PDF). Fibonacci Quart. 31 (2): 129–133.
  3. Cohen, H. (2007). "5.4 Consequences of the Hasse–Minkowski Theorem". Number Theory Volume I: Tools and Diophantine Equations. Springer. ISBN 978-0-387-49922-2.
  4. Milne, Stephen C. (2002). "Introduction". Infinite Families of Exact Sums of Squares Formulas, Jacobi Elliptic Functions, Continued Fractions, and Schur Functions. Springer Science & Business Media. p. 9. ISBN 1402004915.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.