Given $x_1 = a^1over k$ and $x_n+1 = left(aover x_nright)^1over k$ prove that $x_n = a^1-(-k)^-n over k +1$

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
2
down vote

favorite












I'm solving various problems on sequences and here is one I'm stuck with:




Given $x_1 = a^1over k$ where $a > 0$, and $x_n+1 = left(aover x_nright)^1over k$ where $n in mathbb N$. Prove that:
$$
x_n = a^1-(-k)^-n over k +1
$$




Everything I've tried so far just gives me some identity. For example:



$$
beginalign
x_n+1 &= left(aover x_nright)^1over k = \
&= fraca^1over kx_n^1over k = \
&= fracx_1x_n^1over k
endalign
$$



Now try to express $x_n$:



$$
beginalign
x_n^1over k &= fracx_1x_n+1 iff \
iff x_n &= fracx_1^kx_n+1^k
endalign
$$



So this results in $x_n = x_n$ which doesn't show anything. I feel like there might be some smart substitution to translate the problem into some recurrence relation but don't see how.



Could someone please point me in the right direction?







share|cite|improve this question
















  • 1




    how about induction can we solve it using induction?
    – James
    Aug 9 at 15:07










  • @James assuming $x_1$ is the base case what would be the inductive step?
    – roman
    Aug 9 at 15:10














up vote
2
down vote

favorite












I'm solving various problems on sequences and here is one I'm stuck with:




Given $x_1 = a^1over k$ where $a > 0$, and $x_n+1 = left(aover x_nright)^1over k$ where $n in mathbb N$. Prove that:
$$
x_n = a^1-(-k)^-n over k +1
$$




Everything I've tried so far just gives me some identity. For example:



$$
beginalign
x_n+1 &= left(aover x_nright)^1over k = \
&= fraca^1over kx_n^1over k = \
&= fracx_1x_n^1over k
endalign
$$



Now try to express $x_n$:



$$
beginalign
x_n^1over k &= fracx_1x_n+1 iff \
iff x_n &= fracx_1^kx_n+1^k
endalign
$$



So this results in $x_n = x_n$ which doesn't show anything. I feel like there might be some smart substitution to translate the problem into some recurrence relation but don't see how.



Could someone please point me in the right direction?







share|cite|improve this question
















  • 1




    how about induction can we solve it using induction?
    – James
    Aug 9 at 15:07










  • @James assuming $x_1$ is the base case what would be the inductive step?
    – roman
    Aug 9 at 15:10












up vote
2
down vote

favorite









up vote
2
down vote

favorite











I'm solving various problems on sequences and here is one I'm stuck with:




Given $x_1 = a^1over k$ where $a > 0$, and $x_n+1 = left(aover x_nright)^1over k$ where $n in mathbb N$. Prove that:
$$
x_n = a^1-(-k)^-n over k +1
$$




Everything I've tried so far just gives me some identity. For example:



$$
beginalign
x_n+1 &= left(aover x_nright)^1over k = \
&= fraca^1over kx_n^1over k = \
&= fracx_1x_n^1over k
endalign
$$



Now try to express $x_n$:



$$
beginalign
x_n^1over k &= fracx_1x_n+1 iff \
iff x_n &= fracx_1^kx_n+1^k
endalign
$$



So this results in $x_n = x_n$ which doesn't show anything. I feel like there might be some smart substitution to translate the problem into some recurrence relation but don't see how.



Could someone please point me in the right direction?







share|cite|improve this question












I'm solving various problems on sequences and here is one I'm stuck with:




Given $x_1 = a^1over k$ where $a > 0$, and $x_n+1 = left(aover x_nright)^1over k$ where $n in mathbb N$. Prove that:
$$
x_n = a^1-(-k)^-n over k +1
$$




Everything I've tried so far just gives me some identity. For example:



$$
beginalign
x_n+1 &= left(aover x_nright)^1over k = \
&= fraca^1over kx_n^1over k = \
&= fracx_1x_n^1over k
endalign
$$



Now try to express $x_n$:



$$
beginalign
x_n^1over k &= fracx_1x_n+1 iff \
iff x_n &= fracx_1^kx_n+1^k
endalign
$$



So this results in $x_n = x_n$ which doesn't show anything. I feel like there might be some smart substitution to translate the problem into some recurrence relation but don't see how.



Could someone please point me in the right direction?









share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Aug 9 at 15:02









roman

4391413




4391413







  • 1




    how about induction can we solve it using induction?
    – James
    Aug 9 at 15:07










  • @James assuming $x_1$ is the base case what would be the inductive step?
    – roman
    Aug 9 at 15:10












  • 1




    how about induction can we solve it using induction?
    – James
    Aug 9 at 15:07










  • @James assuming $x_1$ is the base case what would be the inductive step?
    – roman
    Aug 9 at 15:10







1




1




how about induction can we solve it using induction?
– James
Aug 9 at 15:07




how about induction can we solve it using induction?
– James
Aug 9 at 15:07












@James assuming $x_1$ is the base case what would be the inductive step?
– roman
Aug 9 at 15:10




@James assuming $x_1$ is the base case what would be the inductive step?
– roman
Aug 9 at 15:10










2 Answers
2






active

oldest

votes

















up vote
2
down vote



accepted










$$x_1=a^frac1k$$
now calculate $x_2$ using $x_n+1 = left(aover x_nright)^1over k$



thus $$x_2= (fracax_1)^frac1k$$
thus $$x_2=a^frac1k*x_1^frac-1k=a^frac1k-frac1k^2$$



now solve for $x_3$ using $x_2$ obtained above



you will get $$x_3=a^frac1k-frac1k^2+frac1k^3$$
also $$x_4=a^frac1k-frac1k^2+frac1k^3-frac1k^4$$



hope you are seeing the pattern so
we can write it for $x_n$



now the problem reduces to summing the series for n(even) $$S_n=frac1k-frac1k^2+frac1k^3-frac1k^4+.....-frac1k^n$$






share|cite|improve this answer






















  • I guess to find the pattern here is not the main problem. As the OP wrote he was not able to prove the formula $$x_n=a^frac1-(-k)^-nk+1$$
    – mrtaurho
    Aug 9 at 15:25











  • we can easily prove it it is simple series sum in the power of a
    – James
    Aug 9 at 15:26










  • Ah yes. Sorry, I have mistaken your idea. Yeah this is a quite impressing way to approach to this problem.
    – mrtaurho
    Aug 9 at 15:34






  • 2




    This actually answers the question, after finding a common formula for the sum I got what is required to prove
    – roman
    Aug 9 at 15:41

















up vote
2
down vote













Hint. One may just rewrite the initial relation as
$$
left(-kright)^n+1ln (x_n+1)-left(-kright)^nln (x_n)=ln left[a^left(-kright)^nright]
$$ recognizing a telescoping sum then using logarithmic properties.






share|cite|improve this answer




















    Your Answer




    StackExchange.ifUsing("editor", function ()
    return StackExchange.using("mathjaxEditing", function ()
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    );
    );
    , "mathjax-editing");

    StackExchange.ready(function()
    var channelOptions =
    tags: "".split(" "),
    id: "69"
    ;
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function()
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled)
    StackExchange.using("snippets", function()
    createEditor();
    );

    else
    createEditor();

    );

    function createEditor()
    StackExchange.prepareEditor(
    heartbeatType: 'answer',
    convertImagesToLinks: true,
    noModals: false,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    );



    );








     

    draft saved


    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2877289%2fgiven-x-1-a1-over-k-and-x-n1-lefta-over-x-n-right1-over-k%23new-answer', 'question_page');

    );

    Post as a guest






























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    2
    down vote



    accepted










    $$x_1=a^frac1k$$
    now calculate $x_2$ using $x_n+1 = left(aover x_nright)^1over k$



    thus $$x_2= (fracax_1)^frac1k$$
    thus $$x_2=a^frac1k*x_1^frac-1k=a^frac1k-frac1k^2$$



    now solve for $x_3$ using $x_2$ obtained above



    you will get $$x_3=a^frac1k-frac1k^2+frac1k^3$$
    also $$x_4=a^frac1k-frac1k^2+frac1k^3-frac1k^4$$



    hope you are seeing the pattern so
    we can write it for $x_n$



    now the problem reduces to summing the series for n(even) $$S_n=frac1k-frac1k^2+frac1k^3-frac1k^4+.....-frac1k^n$$






    share|cite|improve this answer






















    • I guess to find the pattern here is not the main problem. As the OP wrote he was not able to prove the formula $$x_n=a^frac1-(-k)^-nk+1$$
      – mrtaurho
      Aug 9 at 15:25











    • we can easily prove it it is simple series sum in the power of a
      – James
      Aug 9 at 15:26










    • Ah yes. Sorry, I have mistaken your idea. Yeah this is a quite impressing way to approach to this problem.
      – mrtaurho
      Aug 9 at 15:34






    • 2




      This actually answers the question, after finding a common formula for the sum I got what is required to prove
      – roman
      Aug 9 at 15:41














    up vote
    2
    down vote



    accepted










    $$x_1=a^frac1k$$
    now calculate $x_2$ using $x_n+1 = left(aover x_nright)^1over k$



    thus $$x_2= (fracax_1)^frac1k$$
    thus $$x_2=a^frac1k*x_1^frac-1k=a^frac1k-frac1k^2$$



    now solve for $x_3$ using $x_2$ obtained above



    you will get $$x_3=a^frac1k-frac1k^2+frac1k^3$$
    also $$x_4=a^frac1k-frac1k^2+frac1k^3-frac1k^4$$



    hope you are seeing the pattern so
    we can write it for $x_n$



    now the problem reduces to summing the series for n(even) $$S_n=frac1k-frac1k^2+frac1k^3-frac1k^4+.....-frac1k^n$$






    share|cite|improve this answer






















    • I guess to find the pattern here is not the main problem. As the OP wrote he was not able to prove the formula $$x_n=a^frac1-(-k)^-nk+1$$
      – mrtaurho
      Aug 9 at 15:25











    • we can easily prove it it is simple series sum in the power of a
      – James
      Aug 9 at 15:26










    • Ah yes. Sorry, I have mistaken your idea. Yeah this is a quite impressing way to approach to this problem.
      – mrtaurho
      Aug 9 at 15:34






    • 2




      This actually answers the question, after finding a common formula for the sum I got what is required to prove
      – roman
      Aug 9 at 15:41












    up vote
    2
    down vote



    accepted







    up vote
    2
    down vote



    accepted






    $$x_1=a^frac1k$$
    now calculate $x_2$ using $x_n+1 = left(aover x_nright)^1over k$



    thus $$x_2= (fracax_1)^frac1k$$
    thus $$x_2=a^frac1k*x_1^frac-1k=a^frac1k-frac1k^2$$



    now solve for $x_3$ using $x_2$ obtained above



    you will get $$x_3=a^frac1k-frac1k^2+frac1k^3$$
    also $$x_4=a^frac1k-frac1k^2+frac1k^3-frac1k^4$$



    hope you are seeing the pattern so
    we can write it for $x_n$



    now the problem reduces to summing the series for n(even) $$S_n=frac1k-frac1k^2+frac1k^3-frac1k^4+.....-frac1k^n$$






    share|cite|improve this answer














    $$x_1=a^frac1k$$
    now calculate $x_2$ using $x_n+1 = left(aover x_nright)^1over k$



    thus $$x_2= (fracax_1)^frac1k$$
    thus $$x_2=a^frac1k*x_1^frac-1k=a^frac1k-frac1k^2$$



    now solve for $x_3$ using $x_2$ obtained above



    you will get $$x_3=a^frac1k-frac1k^2+frac1k^3$$
    also $$x_4=a^frac1k-frac1k^2+frac1k^3-frac1k^4$$



    hope you are seeing the pattern so
    we can write it for $x_n$



    now the problem reduces to summing the series for n(even) $$S_n=frac1k-frac1k^2+frac1k^3-frac1k^4+.....-frac1k^n$$







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited Aug 9 at 15:42

























    answered Aug 9 at 15:22









    James

    1,627318




    1,627318











    • I guess to find the pattern here is not the main problem. As the OP wrote he was not able to prove the formula $$x_n=a^frac1-(-k)^-nk+1$$
      – mrtaurho
      Aug 9 at 15:25











    • we can easily prove it it is simple series sum in the power of a
      – James
      Aug 9 at 15:26










    • Ah yes. Sorry, I have mistaken your idea. Yeah this is a quite impressing way to approach to this problem.
      – mrtaurho
      Aug 9 at 15:34






    • 2




      This actually answers the question, after finding a common formula for the sum I got what is required to prove
      – roman
      Aug 9 at 15:41
















    • I guess to find the pattern here is not the main problem. As the OP wrote he was not able to prove the formula $$x_n=a^frac1-(-k)^-nk+1$$
      – mrtaurho
      Aug 9 at 15:25











    • we can easily prove it it is simple series sum in the power of a
      – James
      Aug 9 at 15:26










    • Ah yes. Sorry, I have mistaken your idea. Yeah this is a quite impressing way to approach to this problem.
      – mrtaurho
      Aug 9 at 15:34






    • 2




      This actually answers the question, after finding a common formula for the sum I got what is required to prove
      – roman
      Aug 9 at 15:41















    I guess to find the pattern here is not the main problem. As the OP wrote he was not able to prove the formula $$x_n=a^frac1-(-k)^-nk+1$$
    – mrtaurho
    Aug 9 at 15:25





    I guess to find the pattern here is not the main problem. As the OP wrote he was not able to prove the formula $$x_n=a^frac1-(-k)^-nk+1$$
    – mrtaurho
    Aug 9 at 15:25













    we can easily prove it it is simple series sum in the power of a
    – James
    Aug 9 at 15:26




    we can easily prove it it is simple series sum in the power of a
    – James
    Aug 9 at 15:26












    Ah yes. Sorry, I have mistaken your idea. Yeah this is a quite impressing way to approach to this problem.
    – mrtaurho
    Aug 9 at 15:34




    Ah yes. Sorry, I have mistaken your idea. Yeah this is a quite impressing way to approach to this problem.
    – mrtaurho
    Aug 9 at 15:34




    2




    2




    This actually answers the question, after finding a common formula for the sum I got what is required to prove
    – roman
    Aug 9 at 15:41




    This actually answers the question, after finding a common formula for the sum I got what is required to prove
    – roman
    Aug 9 at 15:41










    up vote
    2
    down vote













    Hint. One may just rewrite the initial relation as
    $$
    left(-kright)^n+1ln (x_n+1)-left(-kright)^nln (x_n)=ln left[a^left(-kright)^nright]
    $$ recognizing a telescoping sum then using logarithmic properties.






    share|cite|improve this answer
























      up vote
      2
      down vote













      Hint. One may just rewrite the initial relation as
      $$
      left(-kright)^n+1ln (x_n+1)-left(-kright)^nln (x_n)=ln left[a^left(-kright)^nright]
      $$ recognizing a telescoping sum then using logarithmic properties.






      share|cite|improve this answer






















        up vote
        2
        down vote










        up vote
        2
        down vote









        Hint. One may just rewrite the initial relation as
        $$
        left(-kright)^n+1ln (x_n+1)-left(-kright)^nln (x_n)=ln left[a^left(-kright)^nright]
        $$ recognizing a telescoping sum then using logarithmic properties.






        share|cite|improve this answer












        Hint. One may just rewrite the initial relation as
        $$
        left(-kright)^n+1ln (x_n+1)-left(-kright)^nln (x_n)=ln left[a^left(-kright)^nright]
        $$ recognizing a telescoping sum then using logarithmic properties.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Aug 9 at 15:25









        Olivier Oloa

        106k17173293




        106k17173293






















             

            draft saved


            draft discarded


























             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2877289%2fgiven-x-1-a1-over-k-and-x-n1-lefta-over-x-n-right1-over-k%23new-answer', 'question_page');

            );

            Post as a guest













































































            這個網誌中的熱門文章

            tkz-euclide: tkzDrawCircle[R] not working

            How to combine Bézier curves to a surface?

            1st Magritte Awards