Hostname: page-component-7479d7b7d-68ccn Total loading time: 0 Render date: 2024-07-12T02:29:17.720Z Has data issue: false hasContentIssue false
  • English
  • Français

Sums of squares of digits

Published online by Cambridge University Press:  01 August 2016

A. F. Beardon
A. F. Beardon*
Affiliation:
DPMMS, 16 Mill Lane, Cambridge CB2 1SB, e-mail: afb@dpmms.cam.ac.uk
Get access Rights & Permissions [Opens in a new window]

Extract

This paper contains many opportunities to investigate, conjecture and verify results by writing simple computer programs, and the reader is strongly urged to participate in this way throughout.

For each positive integer n, let F(n) be the sum of the squares of the digits of n; for example,

Type
Articles
Information
The Mathematical Gazette , Volume 82 , Issue 495 , November 1998 , pp. 379 - 388
Copyright
Copyright © The Mathematical Association 1998

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Hardy, G. H. and Wright, E. M., An introduction to the theory of numbers, (5th edition), Oxford University Press (1979).Google Scholar
2. Davenport, H., The higher arithmetic, (6th edition), Cambridge University Press (1992).Google Scholar
3. Mordell, L. J., Diophantine equations, Academic Press (1969).Google Scholar