On sums of squares of digits
This paper is an exposition of the work by Beardon [1]. It is basically based on the process of finding out whether or not a natural number is a happy number. For a natural number n, let F(n) be the sum of the squares of the digits of n. If applying F sufficiently many times to n ends in 1, then n i...
Saved in:
Main Authors: | Santos, J. Loret Q., Sy, Allen G. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2009
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/5227 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
On squares expressible as sum of consecutive squares
by: Rumbaoa, Joefort Dale O., et al.
Published: (1995) -
An improvement for the large sieve for square moduli
by: Baier, Stephan, et al.
Published: (2009) -
On square-dance numbers and mirror multiplication
by: Chua, Chandice R.
Published: (1997) -
Integers as sum of squares
by: Calusin, Rosalie Coney E., et al.
Published: (1995) -
Large sieve inequality with characters to square moduli
by: Zhao, Liangyi.
Published: (2010)