This note concerns the logic of why some possible solutions to nested radical problems are incorrect. I would like to warn you it is a somewhat lengthy monologue. Please read on if you are uncertain about the topic. Also, please solve this problem before reading on.
First I would like to thank Pranay Singh for the set Nested Radicals which contains a sizable number of problems relating to infinite nested fractions or radicals. My first math competition was a state geometry competition. In between rounds, there were "just for fun" problems; that is where I saw my first nested radical problem, and it fascinated me. An example of an infinite nested radical problem is
There are a few methods to go about this, but seemingly the most popular is substitution.
This seems like could be two different values, but the correct answer is How does one conclude it must be the positive value? In this case, it's simple. There are three easy ways to prove it:
Now I will show a different problem: If you are having trouble seeing it, it is the infinite tetration of meaning to the power of to the power of and so on. If you use the popular substitution method, you will see that or One of these is incorrect, so how do you choose the correct one? This problem is interesting in that both possible solutions are positive, so we can't use the " is positive" reasoning above. In fact, none of the methods above will work.
General solution
Let's define "nested iterations problem" as a problem in which you must find the value of some iteration repeated many times. For example, in the first problem, the iteration is to add to the deepest radical. In the second, the iteration is to raise the expression to the power of With most nested iterations problems, you can define a function to equal the value of the expression after iterations. For example, f(1) = \sqrt{2} \\ f(2) = \sqrt{2}^\sqrt{2} \\ f(3) = \sqrt{2}^{\sqrt{2}^\sqrt{2}} Sometimes, you will be able to find a closed form expression for Other times, it may not be possible, or it may be too complicated. Either way, the process of finding the correct solution in an infinite iteration problem is easy: If you have the closed form, you can usually compute this limit. If you do not have the closed form (or if you do not know about limits), you can basically do the same exact thing numerically, by computing and so on, until it stably approaches some value. If you apply this method to the second problem, You can continue this process for a while (perhaps with the assistance of Wolfram Alpha) until you are satisfied it is approaching your predicted value. In this case, we proved it must either be or and if you repeat this process, it is more clearly approaching so that must be the correct answer.
This method can also show that a real solution doesn't exist, if applicable. If we try the second problem again, but replace with the numerical value just keeps getting uncontrollably larger and larger, to infinity; thus, no solution exists.
As far as I know, this method can solve any infinite nested iterations problem, but I am hoping that someone can provide a problem that cannot be solved this way.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Relevant Question with answer in solution
Sir ,
Thanks for this note as this is helpful to all of us .
But I still have a query that why 3 would not converge ?
Are there some other values other than 2 on which the expression would converge ?
Log in to reply
The empirical reason why the 3 case does not converge, is that it keeps getting bigger, and bigger, and bigger, all the way to infinity. Theoretically, though, the infinite tetration of a number makes use of the product log function, or the Lambert W-function. The general formula for an infinite tetration on a is, to my knowledge, f(a)=−ln(a)W(−ln(a)) As an example, we already solved the a=2 case to be 2. Here's the Wolfram Alpha link verifying that. Then here's the 3 case, which has an imaginary part, showing the tetration doesn't converge; in fact, this is actually only 1 of several possible complex results, but if you wanted to find the "correct" complex solution, I think you should choose the one in the link.
Now as for the domain of convergence: other values than a=2 work as well; (5/2), (11/10), and (e/2), to name a few. Im(f(a))=0 when 0<a≤e1/e
Note that f(1) is indeterminate, but we can still assign f(1)=1 since 111...=1. So the domain of convergence is
a∈(0,e1/e]
Lastly, here's the graph illustrating that. The maximum convergent value is f(e1/e)=e, interestingly enough. And here's a graph showing only the convergent values (no, that's not a vertical asymptote on the right! it maxes out at e then goes back down.)
Log in to reply
Thanks sir ,
can you help solving me this query ?
Is this Proof correct ?