Skip to main content
deleted 25 characters in body
Source Link
GH from MO
  • 105.4k
  • 8
  • 293
  • 398

To your second question: byBy a simple volume argument (resembling Gauss's original argument in the circle problem) it is easy to see that $$R_{p^m,k}(n)\sim \frac{S_{p^m,k}}{p^{km}}\cdot\frac{(\pi n)^{k/2}}{\Gamma(k/2+1)},$$ where $S_{p^m,k}$ is the number of solutions of the congruence $$\sum_{i=1}^k x_i^2\equiv 0\pmod{p^m}.$$ The quantity $S_{p^m,k}$ can be expressed more explicitly via Hensel's lemma (reducing it to $m=1$ when $p>2$, and to $m=3$ when $p=2$).

To your second question: by a simple volume argument (resembling Gauss's original argument in the circle problem) it is easy to see that $$R_{p^m,k}(n)\sim \frac{S_{p^m,k}}{p^{km}}\cdot\frac{(\pi n)^{k/2}}{\Gamma(k/2+1)},$$ where $S_{p^m,k}$ is the number of solutions of the congruence $$\sum_{i=1}^k x_i^2\equiv 0\pmod{p^m}.$$ The quantity $S_{p^m,k}$ can be expressed more explicitly via Hensel's lemma (reducing it to $m=1$ when $p>2$, and to $m=3$ when $p=2$).

By a simple volume argument (resembling Gauss's original argument in the circle problem) it is easy to see that $$R_{p^m,k}(n)\sim \frac{S_{p^m,k}}{p^{km}}\cdot\frac{(\pi n)^{k/2}}{\Gamma(k/2+1)},$$ where $S_{p^m,k}$ is the number of solutions of the congruence $$\sum_{i=1}^k x_i^2\equiv 0\pmod{p^m}.$$ The quantity $S_{p^m,k}$ can be expressed more explicitly via Hensel's lemma (reducing it to $m=1$ when $p>2$, and to $m=3$ when $p=2$).

Source Link
GH from MO
  • 105.4k
  • 8
  • 293
  • 398

To your second question: by a simple volume argument (resembling Gauss's original argument in the circle problem) it is easy to see that $$R_{p^m,k}(n)\sim \frac{S_{p^m,k}}{p^{km}}\cdot\frac{(\pi n)^{k/2}}{\Gamma(k/2+1)},$$ where $S_{p^m,k}$ is the number of solutions of the congruence $$\sum_{i=1}^k x_i^2\equiv 0\pmod{p^m}.$$ The quantity $S_{p^m,k}$ can be expressed more explicitly via Hensel's lemma (reducing it to $m=1$ when $p>2$, and to $m=3$ when $p=2$).