Here’s one of my favorite puzzles.

**The Problem**

Solve the following equation:

**Background**

This problem was initially posed by the most brilliant mathematician of the past century, an eccentric prodigy named Srinivasa Ramanujan. He submitted it to the Journal of Indian Mathematical Society without a solution, challenging his fellow mathematicians to solve it. Eventually, when nobody could do it, he gave in and revealed the answer along with a simple proof that probably put them all to shame.

**Solution**

Ok, so seriously, try this for yourself before reading on. Most people haven’t ever done anything with infinite nested square roots, so this is a good opportunity to be creative and come up with weird ways of solving the problem. Play around with it, give random things names, and see what you can do!

You’ll notice (as I did when I first tried working it out) that solving nested radicals can be really* really *hard. Things quickly get really ugly. Luckily, the answer is beautifully simple. It’s just 3!

Let’s see why. We start with a very simple identity:

Taking the square root, we get

If we just plug in a few integer values, we see the following:

What happens if we plug in the value of 4 from the second line to the 4 in the first? We get

Hm, already looking familiar! We’re not done yet – we now plug in the value of 5 from the third line to this new equation, obtaining:

And once more:

And etc off to infinity.

And that’s the proof!

**Generalizing**

Now, Ramanujan actually proved a much more general result than this. I’ll prove a less general result than his, but still more general than what we just saw.

The generalization comes from noticing that our initial identity didn’t *have* to involve adding 1 in (x+1)^{2}. We could have added any number to x, squared it, and then gotten a brand new general theorem about a whole class of continued root problems.

Thus we start with the identity

or…

Now we perform substitutions exactly as we did above:

In the end, what we get is a solution for a whole class of initially very difficult seeming problems:

And if we plug in m = 1 and n = 2, we get our initial problem!