# A Set of Eight Numbers

> An annotated edition of this paper on Fermat's Library, where scientists and readers explain its ideas, equations and history in the margins. Annotated edition: https://fermatslibrary.com/s/a-set-of-eight-numbers

- **Authors:** Arthur Porges
- **Topic:** Mathematics
- **Original:** https://s3-us-west-1.amazonaws.com/fermatslibrary/uploads%2F1522050676055-gaca28cngpa-eb376cfbecf8162336ad91a93551a0a6%2Fpdfresizer.com-pdf-crop+%283%29.pdf
- **Pages:** 4
- **Annotations:** 9 comments in 9 threads
- **Featured:** Fermat's Library Journal Club
- **Annotated edition:** https://fermatslibrary.com/s/a-set-of-eight-numbers

## Annotations

### Annotation 1 (page 1)

Beside the passage: “1. Introduction. In this paper the operation of adding the squared digits of any natural number A a finite number of times is proved to transform A either to unity or to one of a set of eight natural numbers closed under the operation.”

**Annotation** by Luís Batalha (2018-04-21):

> Arthur Porges was an American author of numerous short stories mostly between 1950 and 1960. He also had a master's degrees in mathematics and was drafted into the army for World War II during which he wrote this paper.
>
> ![](http://www.porges.net/Images/arthurporges.jpg)

### Annotation 2 (page 1)

Beside the passage: “2. Definitions. We use the expression natural number to denote a member of the set 1, 2, 3, of positive integers. Zero has not been adjoined to this set and is not to be included in the definition. The operator G is defined by the equation”

**Annotation** by Luís Batalha (2018-04-21):

> This paper tries to prove the following theorem: if you take any positive integer $n$ and sum the squares of its digits, repeating this operation, eventually you’ll either end at 1 or cycle between the eight values 4, 16, 37, 58, 89, 145, 42, and 20.
>
> $$
> 1 \rightarrow 1 \\
> 2 \rightarrow 4 \\
> 3 \rightarrow 9 \rightarrow 81 \rightarrow 65 \rightarrow 61 \rightarrow 37 \rightarrow 58 \\
> 4 \rightarrow 16 \rightarrow 37 \rightarrow 58
> $$
>
> If you want to test it yourself here is some code you can use to test it for the first 500 positive integers.
>
> ```
>     fixed_points = [1, 4, 16, 37, 58, 89, 145, 42, 20]
>
>     for n in range(1, 500):
>         m = n
>         while m not in fixed_points:
>             m = sum([int(c)**2 for c in str(m)])
>
> ```

### Annotation 3 (page 1)

Beside the passage: “Since A has R digits, XR 0 O. We note that G(0) = 0, and G(1) = 1. Using the customary notation, we write G (A), where n> 1, for n successive applications of the operator G to A. G' is not a linear operator since, in general, G(A1+A2)OG(A1)+G(A2). The set of numbers”

**Annotation** by Steve Powell (2018-04-25):

> Of course, the constraints $0\leq X_i \leq 9$ and $X_i$ integral for all $i:1 .. R$ are implicit.

### Annotation 4 (page 1)

Beside the passage: “Since A has R digits, XR 0 O. We note that G(0) = 0, and G(1) = 1. Using the customary notation, we write G (A), where n> 1, for n successive applications of the operator G to A. G' is not a linear operator since, in general, G(A1+A2)OG(A1)+G(A2). The set of numbers”

**Annotation** by Luís Batalha (2018-04-21):

> It's not difficult to show that the G operator is not linear since
>
> $$
> G(A_1+A_2) = \sum(X_i+Y_i)^2 \\
> G(A_1)+G(A_2) = \sum X_i^2+\sum Y_j^2
> $$
>
> For instance: $G(2+2) = G(4) = 16 \neq G(2) +G(2) = 8 $

### Annotation 5 (page 2)

Beside the passage: “380 A SET OF EIGHT NUMBERS [Aug.-Sept., is closed under the operation defined by (1). We call (3) Set K, and use the symbol a' to denote any non-specified element of the set. The equation (4) G8(a') = a' is easily verified. Numbers of the form lOn, 13. 10, lOn+1+3, where n is a positive integer or zero, and others not …”

**Annotation** by Luís Batalha (2018-04-21):

> Note that:
>
> $$
> G(10^n)=1^2+0^2 + \ldots +0^2 = 1 \\
> G^2(13 \times 10^n) = G(1^2+3^2 + 0^2 + \ldots +0^2)= G(10) = 1 \\
>  G^2(10^{n+1} + 3)=G(1^2 + 0^2 + \ldots + 0^2 + 3^2)= G(10) = 1 \\
> $$

### Annotation 6 (page 2)

Beside the passage: “380 A SET OF EIGHT NUMBERS [Aug.-Sept., is closed under the operation defined by (1). We call (3) Set K, and use the symbol a' to denote any non-specified element of the set. The equation (4) G8(a') = a' is easily verified. Numbers of the form lOn, 13. 10, lOn+1+3, where n is a positive integer or zero, and others not …”

**Annotation** by Luís Batalha (2018-04-21):

> To prove $G(A)<A$ for $R \geq 4$ we observe that for a certain $R$, the maximum number of $G(A)$ is $R \cdot 9^2$, while the minimum A is $10^{R-1}$, which means we just have to show that $R \cdot 9^2 < 10^{R-1} $. It's not difficult to see that the left side grows way slower with $R$ (linearly) than the right side (exponentially). With this in mind we just have to show the inequality holds for R=4 for it to be true for all R>4  $\rightarrow$  $R=4$, $4 \cdot 9^2 = 324 < 10^3$
>
> The same is easy to see in the following plot (Red $\rightarrow 10^{R-1}$, Blue $\rightarrow R \cdot 9^2$ )
> ![](https://i.imgur.com/ecHeGx5.png)

### Annotation 7 (page 3)

Beside the passage: “From Lemma 2 it is evident we need prove the theorem only for A ! 162. The writer was unable to find a simple indirect proof sufficiently superior to the following direct one of selective verification to justify its inclusion here. We consider two cases. Case 1. I00<A ?162. For A thus restricted, it is apparent that …”

**Annotation** by Luís Batalha (2018-04-21):

> I encourage the Fermat's Library readers to try to polish the author's proof and come up with an indirect way to show that $G^r(A)=a'$ or $G^r(A)=1$ for $A \leq 162$ =) I think there's an opportunity for another paper if someone finds a more elegant way to approach this problem.

### Annotation 8 (page 3)

Beside the passage: “(14) G2(101) = a' = 4, G3(105) = a' = 16, G6(102) = a' = 89, G(106) = a' = 37, G2(103) = 1, G6(107) = a' = 89, thus completing the proof of the theorem for Case 1. Case 2. 0<A<100. For A =1OX+ Y, where 0?X:9, and 0: Yg9, the following identity is valid.”

**Annotation** by Steve Powell (2018-04-25):

> Surely it is not necessary to _repeatedly_ apply $G(\cdot)$ to $100..107$, but just once:$$G(N) < 100~\mathit{for~all}~ 100 \leq N \leq 107$$and then rely upon _Case 2_ to complete the proof.

### Annotation 9 (page 4)

Beside the passage: “If we assume the existence of a natural number A > 1 and different from a' such that Gn(A) =A for some n ? 1, it follows that A would not be transformed into either unity or an element of Set K by a finite number of applications of the operator G to A. But this is a direct contradiction of Theorem 1, and hence the …”

**Annotation** by Steve Powell (2018-04-25):

> Define $K_{k,b}(n)$ to be the sum of the $k$th powers of the ‘digits’ of $n$ expressed in base $b$.
>
> Thus $G$, in the paper, is $K_{2,10}$ and $H$ is $K_{3,10}$.
>
> If $n = \sum_{i=0}^R x_ib^i$, where integral $x_i$ satisfies $0\leq x_i < b$ and we assume $x_R \neq 0$, then we have$$K_{k,b}(n) = \sum_{i=0}^R x_i^k$$analogous to the special cases in the paper.
>
> By the same analysis we can say that, for any natural number $n$ expressed as above,$$K_{k,b}(n) \leq (b-1)^kR$$ and that $b^{R-1} \leq n \lt b^R$.
>
> Again, if we can find $R_0$ such that $(b-1)^kR_0 \lt b^{R_0-1}$, then $K_{k,b}(n) < n$, so $K_{k,b}$ will be a strict contraction for $n$ with more than or equal to $R_0$ ‘digits’ in base $b$ because all larger $R$ keep this inequality.
>
> But we can always find such an $R_0$, for fixed, positive $b$ and $k$ (exercise?) and so it is true that, for every natural number $n$, there is a number $N$, depending on $n$, such that$$K_{k,b}^N(n) < b^{R_0} .$$
>
> In general, then, every natural number will, under iteration of $K_{k,b}$, end up in the _finite_ set $\{ 0, 1, \dots, b^{R_0}-1\}$.
>
> Although further applications of $K_{k,b}$ are not necessarily _closed_ on this set (why not?) the function $K_{k,b}^2$ certainly is so that the only possible outcomes are that the iterates eventually reach a finite cycle.  For each $k$ and each $b$ we can ask how many cycles there are and what their sizes are.  This paper establishes that for the case $b=10$ and $k=2$ there is only one cycle with eight elements, one fixed point ($\{1\}$) — or two if you include zero, which I do in the above.

## Full text

Extracted from the PDF. [Annotation N] marks where each annotation above sits.

#### Page 1

1945] A SET OF EIGHT NUMBERS 379

it can be shown for large n that Y,_1 is approximately equal to (2irnpq)-112, or 1//V2irau. Thus from (6) we obtain the approximation

(I1) MD n = X/2/7ran = 0.79788a,,. More exact computation, using the remainder terms in Stirling's formula, yields the better approximation

(12) - (MD,)2 = npq + (np - [np])(nq - [nq]) -(1- pq)/6 + En/24n, 2

where the error coefficient En becomes numerically less than or equal to unity as n becomes infinite, for all choices of np between 1 and n-1; and [np] and [nq] denote the greatest integers not exceeding np and nq respectively.

A SET OF EIGHT NUMBERS ARTHUR PORGES, Western Military Academy

1. Introduction. In this paper the operation of adding the squared digits of any natural number A a finite number of times is proved to transform A either to unity or to one of a set of eight natural numbers closed under the operation. [Annotation 1]

2. Definitions. We use the expression natural number to denote a member of the set 1, 2, 3, of positive integers. Zero has not been adjoined to this set and is not to be included in the definition. [Annotation 2] The operator G is defined by the equation

R 2 (1) G(A) = X, i=l

where A is a natural number of R digits given by R (2) A = Xloi-1.

Since A has R digits, XR 0 O. We note that G(0) = 0, and G(1) = 1. Using the customary notation, we write G (A), where n> 1, for n successive [Annotation 3] applications of the operator G to A. G' is not a linear operator since, in general, G(A1+A2)OG(A1)+G(A2). [Annotation 4] The set of numbers

a,= 4, as= 89, a2 = 16, a6= 145, a3 = 37, a7= 42, a4= 58, a8= 20,

This content downloaded from 134.184.26.108 on Fri, 30 Oct 2015 10:36:11 UTC

All use subject to JSTOR Terms and Conditions

#### Page 2

380 A SET OF EIGHT NUMBERS [Aug.-Sept., is closed under the operation defined by (1). We call (3) Set K, and use the symbol a' to denote any non-specified element of the set. The equation (4) G8(a') = a' is easily verified. Numbers of the form lOn, 13. 10, lOn+1+3, where n is a positive integer or zero, and others not specified here, satisfy the equation (5) Gt(A) = 1 for some integer r>0. Any natural number [Annotation 5] satisfying (5) will be denoted by the symbol b'. 3. Preliminary Lemmas. In what follows, the symbols A and B always represent finite natural numbers in the denary system of notation. LEMMA 1. A ny natural number A of R digits, where R 2 4, satisfies the inequality (6) G(A) < A. It is evident that G(A) g 81R, and that A 2 OR-1. The inequality (7) 81R [Annotation 6] < 1OR-1 becomes, upon taking the common logarithm of each member and transposing, (8) logio R <R - 2.9085, an inequality valid for R >4. LEMMA 2. For any natural number A there exists a positive integer n such that (9) Gn(A) < 162. For R24, Lemma 1 establishes the inequality (6). As a direct consequence of (6), the operator G applied to A a finite number of times must result in a natural number of less than four digits, since for R=4, G(A) 9324. For R<4, the following inequalities are readily established. (10) G(A) ! 243, (11) G2(A) 5 G(199) = 163, (12) G3(A) 5 G(99) = 162. S?nce G(A), where A is a three digit number, cannot exceed 3.81 = 243, (10) is obviously valid. Also, since G(199) 2G(B) for any Bg 243, (11) holds. Finally, since G(99)2G(P) for any Pg163, (12) is proved. The inequalities (10), (11), and (12) complete the proof of Lemma 2. 4. Convergence of Gn(A). The following theorem is the main result of this paper.

This content downloaded from 134.184.26.108 on Fri, 30 Oct 2015 10:36:11 UTC All use subject to JSTOR Terms and Conditions

#### Page 3

19451 A SET OF EIGHT NUMBERS 381

THEOREM 1. For every natural number A there exists either a positive integer n such that (5) holds for all r 2 n, or a positive integer m such that

(13) Gr(A) = a'

for all r > m, where a' is some element of Set K.

From Lemma 2 it is evident we need prove the theorem only for A ! 162. The writer was unable to find a simple indirect proof sufficiently superior to the following direct one of selective verification to justify its inclusion here. We consider two cases. Case 1. I00<A ?162. For A thus restricted, it is apparent that G(A) !G(159) = 107. Direct [Annotation 7] application of the operator G to A over the range 100 to 107 gives

G(100) = 1, G6(104) = a' = 89,

(14) G2(101) = a' = 4, G3(105) [Annotation 8] = a' = 16, G6(102) = a' = 89, G(106) = a' = 37, G2(103) = 1, G6(107) = a' = 89, thus completing the proof of the theorem for Case 1. Case 2. 0<A<100. For A =1OX+ Y, where 0?X:9, and 0: Yg9, the following identity is valid.

(15) G(IOX + Y) G(1OY + X). Further, if Gn(A)=a', and Gm(B)=A, it follows that there exists a number h=n+m such that Gh(B) = a'. By means of these considerations, it is possible to verify Theorem 1 numerically for all A <100 by actual computation of Gn(A) for 30 values of A <100, thus completing the proof of the theorem. The writer is aware of the inelegance of such a proof, and would like very much to see a simple indirect one. However, proving the non-existence of another set like (3), which seems a necessary step, is quite difficult because of the non-linear character of G.

COROLLARY. For every natural number A there exists either a positive integer n such that Gn(A) = 1, or a positive integer m such that Gm(A) =4.

The corollary follows directly from Theorem 1 and the nature of Set K. Since every natural number is transformed either into unity or into an element of Set K by the operator G, we need only note that for every a' $4, there exists a positive integer r < 7 such that Gr(a') =4.

THEOREM 2. The number of digits N in G(A), where A has R digits, satisfies the inequality

(16) N < 2.9 + logio R.

This content downloaded from 134.184.26.108 on Fri, 30 Oct 2015 10:36:11 UTC

All use subject to JSTOR Terms and Conditions

#### Page 4

382 A SET OF. EIGHT NUMBERS

This theorem is a simple consequence of the inequality G(A) g 81R. We have

(iT) G(A) ? 101'9 + logio R

a number of N digits, where N S 2.9 + Log1o R.

THEOREM 3. The only solutions in natural numbers of

Gn(A) = A, where n > 1, are (19) A = 1, n = J, (20) A = a', n=8,

where J is any natural number.

If we assume the existence of a natural number A > 1 and different from a' such that Gn(A) =A for some n ? 1, it follows that A would not be transformed into either unity or an element of Set K by a finite number of applications of the operator G to A. But this is a direct contradiction of Theorem 1, and hence the assumption is false. 5. Concluding Remarks. A problem suggested by the one just discussed is that of repeatedly summing the cubed digits of a natural number. A complication occurs, however, since there is more than one number A such that H(A) =A, where H is the operator analogous to (1) given by R [Annotation 9] (21) H(A)= Xi X. i=1

For example, H(153) = 153, H(407) = 407, and H(371) = 371. This destroys the factor of uniqueness, since H(A) may be unity as when A = 100; or A may be transformed into a number A' like 153. It is interesting to note that since for any number A transformed into some element of Set K by a finite number of applications of G we can construct a number B = -OA such that G(B) =1, there are at least "as many" numbers satisfying (5) as (13). This intuitionally unsatisfying conclusion results from the comparison of two infinite sets.

Leibniz discovers the obvious. I have made some observations on prime numbers which, in mxn opinion, are of consequence for the perfection of the science of numbers .... If the sequence [of primes] were well known, it would enable us to uncover the mystery of numbers in general; but up till now it has seemed so bizarre that nobody has succeeded in finiding any affirmative characteristic or property . . ... I believe I have found the right road for penetrating their [primes'] nature: but not having had the leisure to pursue it, I shall give you here a positive property, which seems to me curious and useful.-Leibniz, in a letter to the editor of the Journal des Savans, 1678. The discovery: a prime is necessarily of one or other of the forms 6n+1, 6n +5.-Contributed.

This content downloaded from 134.184.26.108 on Fri, 30 Oct 2015 10:36:11 UTC

All use subject to JSTOR Terms and Conditions

---

Source: [Fermat's Library](https://fermatslibrary.com/) — https://fermatslibrary.com/s/a-set-of-eight-numbers. More annotated papers: https://fermatslibrary.com/llms.txt
