Recursive determination of the enumerator for sums of three squares
For each nonnegative integer n, r3(n) denotes the number of representations of n by sums of three squares. Here presented is a two-step recursive scheme for computing r3(n), n≥0.
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Wiley
2000-01-01
|
| Col·lecció: | International Journal of Mathematics and Mathematical Sciences |
| Matèries: | |
| Accés en línia: | http://dx.doi.org/10.1155/S0161171200003902 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|