# Théorème des quatre carrés de Jacobi

Jacobi's four-square theorem For other theorems of Jacobi see Jacobi's theorem (désambiguïsation).

Jacobi's four-square theorem gives a formula for the number of ways that a given positive integer n can be represented as the sum of four squares.

Contenu 1 Histoire 2 Théorème 3 Preuve 4 Voir également 5 Remarques 6 Références 7 External links History The theorem was proved in 1834 by Carl Gustav Jakob Jacobi.

Theorem Two representations are considered different if their terms are in different order or if the integer being squared (not just the square) is different; to illustrate, these are three of the eight different ways to represent 1: {style d'affichage {commencer{aligné}&1^{2}+0^{2}+0^{2}+0^{2}\&0^{2}+1^{2}+0^{2}+0^{2}\&(-1)^{2}+0^{2}+0^{2}+0^{2}.fin{aligné}}} The number of ways to represent n as the sum of four squares is eight times the sum of the divisors of n if n is odd and 24 times the sum of the odd divisors of n if n is even (see divisor function), c'est à dire.

{style d'affichage r_{4}(n)={commencer{cas}8limites de somme _{m|n}m&{texte{si }}n{texte{ est impair}}\[12pt]24limites de somme _{commencer{smallmatrix}m|n\m{texte{ odd}}fin{smallmatrix}}m&{texte{si }}n{texte{ est même}}.fin{cas}}} De manière équivalente, it is eight times the sum of all its divisors which are not divisible by 4, c'est à dire.

{style d'affichage r_{4}(n)=8sum _{mmid n,,4nmid m}M.} We may also write this as {style d'affichage r_{4}(n)=8sigma (n)-32sigma (n/4) ,} where the second term is to be taken as zero if n is not divisible by 4. En particulier, for a prime number p we have the explicit formula r4(p) = 8(p + 1).[1] Some values of r4(n) occur infinitely often as r4(n) = r4(2mn) whenever n is even. The values of r4(n) can be arbitrarily large: En effet, r4(n) is infinitely often larger than 8√log n.[1] Proof The theorem can be proved by elementary means starting with the Jacobi triple product.[2] The proof shows that the Theta series for the lattice Z4 is a modular form of a certain level, and hence equals a linear combination of Eisenstein series.

See also Lagrange's four-square theorem Lambert series Sum of squares function Notes ^ Jump up to: a b Williams 2011, p. 119. ^ Hirschhorn, Michel D. (2000). "Partial Fractions and Four Classical Theorems of Number Theory". Le mensuel mathématique américain. 107 (3): 260–264. CiteSeerX 10.1.1.28.1615. est ce que je:10.2307/2589321. JSTOR 2589321. References Hirschhorn, Michael D.; McGowan, Jacques A. (2001). "Algebraic Consequences of Jacobi's Two— and Four—Square Theorems". In Garvan, F. G.; Ismail, M. E. H. (éd.). Symbolic Computation, La théorie du nombre, Special Functions, Physics and Combinatorics. Developments in Mathematics. Volume. 4. Springer. pp. 107–132. CiteSeerX 10.1.1.26.9028. est ce que je:10.1007/978-1-4613-0257-5_7. ISBN 978-1-4020-0101-7. Hirschhorn, Michel D. (1987). "A simple proof of Jacobi's four-square theorem". Actes de l'American Mathematical Society. 101 (3): 436. est ce que je:10.1090/s0002-9939-1987-0908644-9. Williams, Kenneth S. (2011). Number theory in the spirit of Liouville. Textes des étudiants de la London Mathematical Society. Volume. 76. la presse de l'Universite de Cambridge. ISBN 978-0-521-17562-3. Zbl 1227.11002. Weissstein externe gauche, Eric W. "Sum of Squares Function". MathWorld. Catégories: Squares in number theoryTheorems in number theory

Si vous voulez connaître d'autres articles similaires à Théorème des quatre carrés de Jacobi vous pouvez visiter la catégorie Squares in number theory.

Monter

Nous utilisons nos propres cookies et ceux de tiers pour améliorer l'expérience utilisateur Plus d'informations