Sunday, November 24, 2019

Formula for series fracsqrtab+fracsqrta+sqrtab+cdots+fracsqrta+sqrta+sqrtcdots+sqrtab



All variables are positive integers.




For:



a1xy
a2x+xy

anx+x++xy



Is there a formula of an unconditional form to describe series an?







I thought of something along the lines of:



nk=1(kj=1xy)



but, I quickly realized that it was very incorrect; Then I thought of:



nk=1kj=1xy




which I also concluded as very incorrect...



I'm blank, but I would like to see an example of something along the lines of:



nk=1x+x++xy



where each x+ addition, repeats k times. (i.e k=3x+x+x);
If it is possible...



Cheers!



Answer



If all you are looking for is a compact representation, let
sk={0if k=0a+sk1if k>0.
Then
Sn=(ab)+(a+ab)++(a+a++ab)=1b[a+a+a++a+a++a]=1bnk=1sk.



Assume aR (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
s2sa=0,
which has roots
1±1+4a2.
Particularly, the locally stable fixed point is the solution with ± is +.
So, for large enough k,
sk1+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

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...