Congruences for r_s(n) modulo 2s

DOI10.1016/J.JNT.2007.05.002MaRDI QIDQ2469151zbMATH OpenOpenAlexWikidataFDO

Authors Samuel S. jun. Wagstaff

Publication date 4 February 2008

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jnt.2007.05.002

zbMATH Keywords

congruencesums of squares

Mathematics Subject Classification ID

Representation problems (11D85) Sums of squares and representations by other particular quadratic forms (11E25)

Review text

Let \(r_s(n)\) denote the number of ways to write \(n\) as the sum of \(s\) squares of integers. The author determines \(r_s(n)\) modulo \(2s\) when \(s\) is a prime or a power of 2. For general \(s\), he proves a congruence for \(r_s(n)\) modulo the largest power of 2 dividing \(2s\). The author also remarks that tables of \(r_s(n)\) suggest that his theorems above describe all congruences modulo a divisor of \(2s\) satisfied by \(r_s(n)\) for all \(n > 0\).

Recommendations

• Congruences for r_s(n)
• scientific article; zbMATH DE number 4095543
• Congruences for r ^s (n )
• The congruent properties for r_s(n)
• Sums of squares and partition congruences

Cited in

(5)

• The congruent properties for r_s(n)
• Congruences for r ^s (n )
• Sums of squares and partition congruences
• scientific article; zbMATH DE number 2063237 (Why is no real title available?)
• Congruences for r_s(n)

This page was built for publication: Congruences for \(r_s(n)\) modulo \(2s\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2469151)