# Plus Nine Divide Five

Here’s a fun little math problem: take any number and **add nine, and divide by five**. We’ll use
$15$
as a starting example

Then **add nine, and divide by five**

repeat

$$\frac{(2.76+9)}{5}=2.352$$ $$\frac{(2.352+9)}{5}=2.2704$$[5 more skipped]

$$2.2500013\dots $$The value seems to converge to $2.25$. Let’s try another starting number: $-58$ and repeat the process. And let’s be a bit more formal with our notation. We can describe each result of adding nine and dividing by five to be a step in a sequence. So we can describe the next in a sequence given the last in the sequence

$${S}_{n+1}=\frac{({S}_{n}+9)}{5}$$And we’ll define ${S}_{0}=-58$

$$\begin{array}{rlrlrl}{S}_{0}& =-58& {S}_{1}& =-9.8& {S}_{2}& =-0.16\\ \text{}{S}_{3}& =1.768& {S}_{4}& =2.1536& {S}_{5}& =2.23072\\ {S}_{6}& =2.246144& {S}_{7}& =2.249\dots & {S}_{8}& =2.250\dots \end{array}$$Funnily enough, even with a different starting value, the process converges to the same value of $2.25$. Try a few starting numbers yourself; you’ll see that *they all* converge to $2.25$.

What’s the big deal with $2.25$? Well, let’s make it a fraction

$$\frac{9}{4}$$Nine fourths is pretty similar to the rule used for the problem **add 9 divide by 5**. Could it be that the value converges to a fraction of the value you add ($9$) over one less than the value you divide by ($5-1$)?

Now, we can redefine the problem: add 7 divide by 2. If the hypothesis is correct,we should see all starting values converge to $\frac{7}{1}$. We redefine the sequence

$${S}_{n+1}=\frac{({S}_{n}+7)}{2}$$Then try it out

$$\begin{array}{rlrlrl}{S}_{0}& =78& {S}_{1}& =42.5& {S}_{2}& =24.75\\ {S}_{3}& =15.875& {S}_{4}& =11.4375& {S}_{5}& =9.21875\\ {S}_{6}& =8.109375& {S}_{7}& =7.55469\dots & {S}_{8}& =7.27734\dots \\ {S}_{9}& =7.13867\dots & {S}_{10}& =7.06934\dots & {S}_{11}& =7.03467\dots \end{array}$$If you were to continue on you would see that the value converges to $7$.

Let’s notate the problem to not depend on any $7$’s or $2$’s

$${S}_{n+1}=\frac{{S}_{n}+a}{b}$$And with what we learned from the two examples above, we can state our hypothesis

$${S}_{n+1}\approx \frac{a}{b-1}$$The next iteration in the sequence is approximately equal to $a$ over $b$ minus one. This approximation will become more accurate with more steps. We could even be fancy and write it with limits

$$\underset{n\to \infty}{\mathrm{lim}}\phantom{\rule{0.1667em}{0ex}}{S}_{n}=\frac{a}{b-1}$$But how do we prove it?

## Into the weeds

Instead of evaluating each step in the sequence with numbers, what if we were to do it with algebra?

Setting everything up we have the definition of the sequence

$${S}_{n+1}=\frac{{S}_{n}+a}{b}$$Given that ${S}_{0}$ is some unimportant constant

Lets evaluate the first few steps with algebra. Of course ${S}_{0}={S}_{0}$ but the following ones are more interesting

$$\begin{array}{rlrlr}{S}_{1}& =\frac{{S}_{0}+a}{b}& & & =\frac{{S}_{0}}{b}+\frac{a}{b}\\ {S}_{2}& =\frac{{S}_{1}+a}{b}& =& \text{}\frac{\frac{{S}_{0}+a}{b}+a}{b}& =\frac{{S}_{0}}{{b}^{2}}+\frac{a}{{b}^{2}}+\frac{a}{b}\\ {S}_{3}& =\frac{{S}_{2}+a}{b}& =& \text{}\frac{\frac{\frac{{S}_{0}+a}{b}+a}{b}+a}{b}& =\frac{{S}_{0}}{{b}^{3}}+\frac{a}{{b}^{3}}+\frac{a}{{b}^{2}}+\frac{a}{b}\end{array}$$After dividing through all the repeated fractions, we get a relatively clean pattern where, the starting value is divided by a certain amount of $b$’s which is added to the sum of $a$ divided by increasing powers of $b$. Lets factor out the form of the equation into two parts

$${S}_{n}=\frac{{S}_{0}}{{b}^{n}}+a(\frac{1}{{b}^{1}}+\frac{1}{{b}^{2}}+\cdots +\frac{1}{{b}^{n-1}}+\frac{1}{{b}^{n}})$$We can simplify (or complicate depending on how you look at it) the sum of reciprocal powers of $b$ by using a the summation notation

$${S}_{n}=\frac{{S}_{0}}{{b}^{n}}+a\sum _{k=1}^{n}\frac{1}{{b}^{k}}$$Given that our goal is to find the value ${S}_{n}$ converges to with an ever-growing $n$, let’s take the limit

$$\underset{n\to \infty}{\mathrm{lim}}(\frac{{S}_{0}}{{b}^{n}}+a\sum _{k=1}^{n}\frac{1}{{b}^{k}})$$With an ever increasing $n$ we can see that the term $\frac{{S}_{0}}{{b}^{n}}$ will become ever smaller and smaller and with that, we’ve proven that the starting value doesn’t matter. The term which has ${S}_{0}$ will go to zero as $n$ goes to infinity.

We still haven’t proven our hypothesis of

$$\underset{n\to \infty}{\mathrm{lim}}\phantom{\rule{0.1667em}{0ex}}{S}_{n}=\frac{a}{b-1}$$But we can simplify the equation a bit by removing the term which approaches zero, and putting the limit into the upper bound of the sum

$$a\sum _{k=1}^{\infty}\frac{1}{{b}^{k}}$$Unless we can untangle that infinite sum of a increasing powers, we can’t yet prove it. Through this method, and please forgive me, but this route is *somewhat* of a dead end road (I’ll explain why I say somewhat later).

## The simple way

So, here’s the problem in case you forgot it

$${S}_{n+1}=\frac{{S}_{n}+a}{b}$$If this sequence does converge to one specific value, then there should be an ${S}_{n}$ such that ${S}_{n+1}={S}_{n}$ . Or in plainer words, there should be a value which we can add $a$ to, then divide by $b$ and get that same value back. We can setup the equation to say such

$${S}_{n}=\frac{{S}_{n}+a}{b}$$Multiply both sides by $b$

$${S}_{n}\times b={S}_{n}+a$$subtract ${S}_{n}a$ from both sides

$${S}_{n}\times (b-1)=a$$Solve for ${S}_{n}$

$${S}_{n}=\frac{a}{b-1}$$So now (if we are willing to assume that there is only one value the process converges on) we have proven that

$$\underset{n\to \infty}{\mathrm{lim}}\phantom{\rule{0.1667em}{0ex}}{S}_{n}=\frac{a}{b-1}$$Or, the process will converge to be the fraction $a$ over $b$ minus one.

But we have proven much more than that! Allow me to restate some equations which we have seen to be valid

$$\begin{array}{rl}\underset{n\to \infty}{\mathrm{lim}}\phantom{\rule{0.1667em}{0ex}}{S}_{n}& =a\sum _{k=1}^{\infty}{\left(\frac{1}{b}\right)}^{k}\\ \phantom{\rule{0.1667em}{0ex}}\underset{n\to \infty}{\mathrm{lim}}\phantom{\rule{0.1667em}{0ex}}{S}_{n}& =\frac{a}{b-1}\end{array}$$Then we can set them to be equal to each other

$$\frac{a}{b-1}=a\sum _{k=1}^{\infty}{\left(\frac{1}{b}\right)}^{k}$$We can then divide out the $a$

$$\frac{1}{b-1}=\sum _{k=1}^{\infty}{\left(\frac{1}{b}\right)}^{k}$$And now − all from playing a silly number game − we have a simple identity for what a complicated infinite sum evaluates to. I hope you now understand why I took the time to go down the ‘dead end road.’

## Closing

The infinite sum identity discovered in this article is nothing new. It’s well known and called the Geometric Series. I’ve been curious about **add nine, and divide by five** for more than a year at this point − bouncing around in the back of my mind. Only in the past few months did I solve the problem. I first made a computer program that brute forced plenty of different values just to get an idea of the problem, then I went on to solve it in a very similar way to how I’ve written it out today. I’m still a bit fascinated that a problem as simple as **add nine, and divide by five** could reveal a seemingly obscure identity for an infinite sum.

## Technical notes

(bonus stuff for nerds and pedants)

The values of $a$ and $b$ within the following statement are assumed to be positive and non-zero

$${S}_{n+1}=\frac{{S}_{n}+a}{b}$$And in general, any time you see a fraction in this article, it is assumed that division by zero is not considered.

The series I called the geometric series is *not quite* a real geometric series

The real one has a lower bound of $n=0$ and is typically not expressed as a fraction

$$\sum _{n=0}^{\infty}{p}^{n}$$We define $p={\textstyle \frac{1}{b}}$

These two sums are equivalent except for the fact that the real geometric series has one more term at $n=0$. We can find that term by evaluating ${p}^{0}$ which equals $1$. Therefor, we can state that the ‘fake’ geometric series is one less than the real one, and then set them to be equal to each other.

$$\sum _{n=0}^{\infty}{p}^{n}=\sum _{n=1}^{\infty}{\left(\frac{1}{b}\right)}^{n}+1$$And as established earlier, we know the solution to the ‘fake’ geometric sum, so we can then solve for the real one.

$$\sum _{n=0}^{\infty}{p}^{n}=\frac{1}{b-1}+1$$Let’s substitute out $b$ in favor of $p$ to make the equation clearer and then crunch some algebra

$$\sum _{n=0}^{\infty}{p}^{n}=\frac{1}{\frac{1}{p}-1}+1=\frac{p}{1-p}+1=\frac{p+1-p}{1-p}=\frac{1}{1-p}$$Which yields us the standard form you may be familiar with

$$\sum _{n=0}^{\infty}{p}^{n}=\frac{1}{1-p}$$Another neat thing. The formula

$$\underset{n\to \infty}{\mathrm{lim}}\phantom{\rule{0.1667em}{0ex}}{S}_{n}=\frac{a}{b-1}$$works perfectly well when $b=1$ (or rather, when $b$ approaches $1$). If you were to **add 9 and divide by 1** repeatedly, then the sequence would balloon up to an ever rising number. The diverging nature at $b=1$ fits pretty well into the equation as it represents division by zero

If you catch any mistakes in my reasoning, math, or notation: please let me know.