All variables are positive integers.
For:
a1√xy
a2√x+√xy
⋯
an√x+√x+√⋯+√xy
Is there a formula of an unconditional form to describe series an?
I thought of something along the lines of:
n∑k=1(k∑j=1√xy)
but, I quickly realized that it was very incorrect; Then I thought of:
n∑k=1∑kj=1√xy
which I also concluded as very incorrect...
I'm blank, but I would like to see an example of something along the lines of:
n∑k=1√x+√x+√⋅⋅⋅+√xy
where each √x+√⋯ addition, repeats k times. (i.e k=3⇒√x+√x+√x);
If it is possible...
Cheers!
Answer
If all you are looking for is a compact representation, let
sk={0if k=0√a+sk−1if k>0.
Then
Sn=(√ab)+(√a+√ab)+…+(√a+√a+…+√ab)=1b[√a+√a+√a+…+√a+√a+…+√a]=1bn∑k=1sk.
Assume a∈R (you don't have to do this). We can show that the recurrence is
stable everywhere (weakly stable at a=−14). Particularly,
the fixed point is given by
s2−s−a=0,
which has roots
1±√1+4a2.
Particularly, the locally stable fixed point is the solution with ± is +.
So, for large enough k,
sk≈1+√1+4a2.
This is as good an answer as you can hope for, save for error bounds on the above expression.
No comments:
Post a Comment