Solve Hard Sequence Problem: Find √1+√1+2√1+3√1+...

In summary, the conversation is about trying to find the value of x which is equal to the square root of 1 plus the square root of 1 plus 2 times the square root of 1 plus 3 times the square root of 1 plus and so on. The conversation mentions Ramanajan's identity and a recursive formula for x. The limit of x is found to be infinite and it is concluded that x is asymptotically a power law. The backwards recursive relation for x is also discussed and a discrete z-transform is defined to find a functional equation for x.
  • #1
aznluster
5
0
Find [tex]\sqrt{1+\sqrt{1+2\sqrt{1+3\sqrt{1+...}}}}[/tex]
 
Mathematics news on Phys.org
  • #2


It comes out to be 3. Why? I'm trying to find out.
 
  • #3
Ok so this is basically one of Ramanajan's identities:

[tex] x + n + a = \sqrt{ax + (n+a)^{2} + x \sqrt{a(x +n) + (n+a)^{2} + (x + n) \sqrt{...}}}}[/tex]
 
  • #4


Wouldn't that add up to 2? Or maybe I'm doing something wrong. Is there a proof of that identity somewhere?
 
  • #5


Let

[tex]
x_{n} = \sqrt{1 + n \sqrt{1 + (n +1) \sqrt{1 + \ldots}}}
[/tex]

Then, we have the backwards recursive formula:

[tex]
x_{n} = \sqrt{1 + n x_{n + 1}}
[/tex]

We want to find [itex]x_{1}[/itex]. Let us see what is the limit [itex]x \equiv \lim_{n \rightarrow \infty}{x_{n}}[/itex]?



If we want a finite limit, we must have:

[tex]
x_{n} \sim -\frac{1}{n}, \; n \rightarrow \infty
[/tex]

but, this is impossible since all [itex]x_{n} > 0[/itex]. Therefore, the limit is infinite. Let us assume that is asymptotically a power law:

[tex]
x_{n} \sim A \, n^{\alpha}, \; n \rightarrow \infty, \; \alpha > 0
[/tex]

Then, we have:

[tex]
A n^{\alpha} \sim \sqrt{1 + n A (n + 1)^{\alpha}} \sim \sqrt{A} \, n^{\frac{1 + \alpha}{2}}
[/tex]

which means:

[tex]
\alpha = \frac{1 + \alpha}{2} \Rightarrow \alpha = 1
[/tex]

and

[tex]
A = \sqrt{A} \Rightarrow A = 0 \vee A = 1
[/tex]

So, we may conclude:

[tex]
x_{n} = n (1 + y_{n}), \; y_{n} \rightarrow 0, \; n \rightarrow \infty
[/tex]

The backwards recursive relation for [itex]y_{n}[/itex] is:

[tex]
n (1 + y_{n}) = \sqrt{1 + n \cdot n (1 + y_{n + 1})}
[/tex]

[tex]
y_{n} = \sqrt{1 + y_{n + 1} + \frac{1}{n}} - 1
[/tex]

[tex]
y_{n + 1} = y_{n} (2 + y_{n}) - \frac{1}{n}
[/tex]

Define a discrete z-transform:

[tex]
Y(z) \equiv \sum_{n = 1}^{\infty}{y_{n} z^{-n}}
[/tex]

As we can see, [itex]y_{1}[/itex] is the coefficient in the Laurent series of [itex]Y(z)[/itex] around [itex]z = 0[/itex]. According to the residue theorem:

[tex]
y_{1} = \mathrm{Res}(Y(z), z = 0) = \frac{1}{2 \pi i} \, \oint_{C_{z = 0}}{Y(z) \, dz}
[/tex]

We need to find a functional equation for [itex]Y(z)[/itex] from the above (non-linear) recursive relation.
 

FAQ: Solve Hard Sequence Problem: Find √1+√1+2√1+3√1+...

How do I approach solving a hard sequence problem?

When faced with a difficult sequence problem, the first step is to carefully examine the pattern and try to identify any underlying mathematical relationships. In this case, we can see that each term is the square root of a number added to the previous term. This suggests that we may need to use a recursive formula to find the value of each term.

What is the formula for finding the square root of a number?

The square root of a number can be found by either using a calculator or by using a mathematical formula. The formula for finding the square root of a number is √x = y, where x is the number and y is the square root of that number. For example, if x = 4, then √4 = 2.

How can I simplify the given sequence?

One approach to simplifying this sequence is to rewrite it in terms of a summation. This would be expressed as √1 + √1 + 2√1 + 3√1 + ... = ∑√(1 + n), where n represents the term number. This allows us to more easily see the pattern and apply a formula to find the value of each term.

What is the solution to this sequence?

The solution to this sequence is infinity, since the terms continue to increase without bound. However, we can find the value of each term by using the formula √(1 + n) = √n + 1, where n represents the term number. For example, the first term (n = 1) would be √1 + 1 = 2, the second term (n = 2) would be √2 + 1 ≈ 2.414, and so on.

Are there any real-world applications for solving hard sequence problems?

Yes, there are many real-world applications for solving hard sequence problems. For example, in mathematics and computer science, sequence problems are used to find patterns and make predictions about future values. In physics, sequences are used to model natural phenomena and make calculations about complex systems. In engineering, understanding sequences can help with designing and optimizing processes and systems. Overall, the ability to solve hard sequence problems is a valuable skill in many fields of study and can lead to practical real-world applications.

Similar threads

Replies
3
Views
865
Replies
2
Views
1K
Replies
11
Views
1K
Replies
45
Views
4K
Replies
41
Views
2K
Replies
3
Views
1K
Replies
34
Views
4K
Replies
1
Views
1K
Back
Top