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:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
Math
Appears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3
2×3
2^{34}
234
a_{i-1}
ai−1
\frac{2}{3}
32
\sqrt{2}
2
\sum_{i=1}^3
∑i=13
\sin \theta
sinθ
\boxed{123}
123
Comments
The method to solve this kind of nested radical is to define a function
f(x)=1+x1+(x+1)1+(x+2)1+⋯
Clearly
f(x)2−1=xf(x+1)
Now note that
f(0)=1
We will use induction to show that
f(x)=x+1
for all positive integers x (which will in turn give us the value of f(2))
First note the base case
f(0)=1=0+1
Now suppose
f(k)=k+1
for some positive integer k. Then
f(k)2−1=kf(k+1)⟹(k+1)2−1=kf(k+1)⟹k2+2k=kf(k+1)⟹f(k+1)=k+2
and the induction is done.
We conclude that
f(x)=x+1
for all positive integers x.
Now we compute the value of f(2) simply as 2+1=3. :)
Not quite. In essence, you have not proven anything as yet. You need the fact that f(1)=2 to conclude that f(k)=k+1.
The induction step is only valid if you can divide by k (right at the end). Hence, this need not hold true for k=0. As such, your base case needs to be k=1.
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
The method to solve this kind of nested radical is to define a function f(x)=1+x1+(x+1)1+(x+2)1+⋯ Clearly f(x)2−1=xf(x+1) Now note that f(0)=1 We will use induction to show that f(x)=x+1 for all positive integers x (which will in turn give us the value of f(2)) First note the base case f(0)=1=0+1 Now suppose f(k)=k+1 for some positive integer k. Then f(k)2−1=kf(k+1)⟹(k+1)2−1=kf(k+1)⟹k2+2k=kf(k+1)⟹f(k+1)=k+2 and the induction is done.
We conclude that f(x)=x+1 for all positive integers x.
Now we compute the value of f(2) simply as 2+1=3. :)
Log in to reply
Thanks dude! Wikipedia had a more general one which was more difficult to be understood! Keep it up!
Log in to reply
Thanks! :)
There is still a slight issue with the induction though. (I think). See if you can find it.
Log in to reply
f(x)2−1=xf(x+1)
Yeah sure! I just checked tillLog in to reply
@Calvin Lin can clear it up)
Here is the issue (which I'm not sure if it's really an issue, maybeWhen going from f(0) to f(1) using the recurrence relation and solving for f(1), what do we get?
Log in to reply
00 indeterminate form!!!
Oh yeah!Not quite. In essence, you have not proven anything as yet. You need the fact that f(1)=2 to conclude that f(k)=k+1.
The induction step is only valid if you can divide by k (right at the end). Hence, this need not hold true for k=0. As such, your base case needs to be k=1.
Log in to reply
@Calvin Lin does this prove the base case?
2=1+1⋅3 1+1⋅3=1+11+2⋅4 1+11+2⋅4=1+11+21+3⋅5
We can continue this indefinitely
Log in to reply
3=1+2×4=1+21+3×5 and so on as you did in your solution!!
Log in to reply
Can you help me in proving this? I guess @Nathan Ramesh 's method is not bad and "something" can be done with induction.
It is 3! And it is reported in http://en.wikipedia.org/wiki/Nested_radical
Log in to reply
Is there any other possible approach?
Log in to reply
Not one that I know.
Its value is 3
This is very famous nested radical given by ramanujan.
Log in to reply
yes i also approached same question on this site, the key is ramanujan
From: f(x)2−1=xf(x+1) (f(x)+1)(f(x)−1)=xf(x+1)
Suppose f(x)=x+1, then: (x+1+1)(x+1−1)=x(x+2) x(x+2)≡x(x+2)
It appears that f(x)=x+1 satisfies the first equation for all real values of x. The special case of x=0 is also shown to be f(0)=0+1.
I hope this is adequate.