Find a general solution for this recurrence: $a_n = sqrt{a_{n-1}a_{n-2}}$












2












$begingroup$


Find a general solution for this recurrence:
$$a_n = sqrt{a_{n-1}a_{n-2}}$$
when $a_1 = 2$, $a_2 = 8$.




My attempt to solve it:



This recurrence isn't a regular one. In order to solve it,
I have tried to count the first elements in this recurrence, which are $$a_1 = 2, a_2 = 8, a_3 = 4, a_4 = sqrt{32}, a_5 = sqrt{512} ...,$$ but I didn't find any way to proceed.



Any help will be very appreciated.






recurrence-relations combinations







share|cite|improve this question











$endgroup$








  • 3




    $begingroup$
    Try $a_n$ = $2^{b_n}$
    $endgroup$
    – DanielV
    Jan 11 at 20:06










  • $begingroup$
    and what is $b_n$?
    $endgroup$
    – Robo Yonuomaro
    Jan 11 at 20:10










  • $begingroup$
    I mean how can I find a general solution for $b_n$?
    $endgroup$
    – Robo Yonuomaro
    Jan 11 at 20:16










  • $begingroup$
    @RoboYonuomaro using the given recurrence formula for $a_n$.
    $endgroup$
    – Scientifica
    Jan 11 at 20:18










  • $begingroup$
    First write the recurrence among $b_n, b_{n-1}, b_{n-2}$ using
    $endgroup$
    – Will Jagy
    Jan 11 at 20:18
















2












$begingroup$


Find a general solution for this recurrence:
$$a_n = sqrt{a_{n-1}a_{n-2}}$$
when $a_1 = 2$, $a_2 = 8$.




My attempt to solve it:



This recurrence isn't a regular one. In order to solve it,
I have tried to count the first elements in this recurrence, which are $$a_1 = 2, a_2 = 8, a_3 = 4, a_4 = sqrt{32}, a_5 = sqrt{512} ...,$$ but I didn't find any way to proceed.



Any help will be very appreciated.






recurrence-relations combinations







share|cite|improve this question











$endgroup$








  • 3




    $begingroup$
    Try $a_n$ = $2^{b_n}$
    $endgroup$
    – DanielV
    Jan 11 at 20:06










  • $begingroup$
    and what is $b_n$?
    $endgroup$
    – Robo Yonuomaro
    Jan 11 at 20:10










  • $begingroup$
    I mean how can I find a general solution for $b_n$?
    $endgroup$
    – Robo Yonuomaro
    Jan 11 at 20:16










  • $begingroup$
    @RoboYonuomaro using the given recurrence formula for $a_n$.
    $endgroup$
    – Scientifica
    Jan 11 at 20:18










  • $begingroup$
    First write the recurrence among $b_n, b_{n-1}, b_{n-2}$ using
    $endgroup$
    – Will Jagy
    Jan 11 at 20:18














2












2








2





$begingroup$


Find a general solution for this recurrence:
$$a_n = sqrt{a_{n-1}a_{n-2}}$$
when $a_1 = 2$, $a_2 = 8$.




My attempt to solve it:



This recurrence isn't a regular one. In order to solve it,
I have tried to count the first elements in this recurrence, which are $$a_1 = 2, a_2 = 8, a_3 = 4, a_4 = sqrt{32}, a_5 = sqrt{512} ...,$$ but I didn't find any way to proceed.



Any help will be very appreciated.






recurrence-relations combinations







share|cite|improve this question











$endgroup$




Find a general solution for this recurrence:
$$a_n = sqrt{a_{n-1}a_{n-2}}$$
when $a_1 = 2$, $a_2 = 8$.




My attempt to solve it:



This recurrence isn't a regular one. In order to solve it,
I have tried to count the first elements in this recurrence, which are $$a_1 = 2, a_2 = 8, a_3 = 4, a_4 = sqrt{32}, a_5 = sqrt{512} ...,$$ but I didn't find any way to proceed.



Any help will be very appreciated.






recurrence-relations combinations




recurrence-relations combinations






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 11 at 20:23









Namaste

1




1










asked Jan 11 at 20:04









Robo YonuomaroRobo Yonuomaro

786




786








  • 3




    $begingroup$
    Try $a_n$ = $2^{b_n}$
    $endgroup$
    – DanielV
    Jan 11 at 20:06










  • $begingroup$
    and what is $b_n$?
    $endgroup$
    – Robo Yonuomaro
    Jan 11 at 20:10










  • $begingroup$
    I mean how can I find a general solution for $b_n$?
    $endgroup$
    – Robo Yonuomaro
    Jan 11 at 20:16










  • $begingroup$
    @RoboYonuomaro using the given recurrence formula for $a_n$.
    $endgroup$
    – Scientifica
    Jan 11 at 20:18










  • $begingroup$
    First write the recurrence among $b_n, b_{n-1}, b_{n-2}$ using
    $endgroup$
    – Will Jagy
    Jan 11 at 20:18














  • 3




    $begingroup$
    Try $a_n$ = $2^{b_n}$
    $endgroup$
    – DanielV
    Jan 11 at 20:06










  • $begingroup$
    and what is $b_n$?
    $endgroup$
    – Robo Yonuomaro
    Jan 11 at 20:10










  • $begingroup$
    I mean how can I find a general solution for $b_n$?
    $endgroup$
    – Robo Yonuomaro
    Jan 11 at 20:16










  • $begingroup$
    @RoboYonuomaro using the given recurrence formula for $a_n$.
    $endgroup$
    – Scientifica
    Jan 11 at 20:18










  • $begingroup$
    First write the recurrence among $b_n, b_{n-1}, b_{n-2}$ using
    $endgroup$
    – Will Jagy
    Jan 11 at 20:18








3




3




$begingroup$
Try $a_n$ = $2^{b_n}$
$endgroup$
– DanielV
Jan 11 at 20:06




$begingroup$
Try $a_n$ = $2^{b_n}$
$endgroup$
– DanielV
Jan 11 at 20:06












$begingroup$
and what is $b_n$?
$endgroup$
– Robo Yonuomaro
Jan 11 at 20:10




$begingroup$
and what is $b_n$?
$endgroup$
– Robo Yonuomaro
Jan 11 at 20:10












$begingroup$
I mean how can I find a general solution for $b_n$?
$endgroup$
– Robo Yonuomaro
Jan 11 at 20:16




$begingroup$
I mean how can I find a general solution for $b_n$?
$endgroup$
– Robo Yonuomaro
Jan 11 at 20:16












$begingroup$
@RoboYonuomaro using the given recurrence formula for $a_n$.
$endgroup$
– Scientifica
Jan 11 at 20:18




$begingroup$
@RoboYonuomaro using the given recurrence formula for $a_n$.
$endgroup$
– Scientifica
Jan 11 at 20:18












$begingroup$
First write the recurrence among $b_n, b_{n-1}, b_{n-2}$ using
$endgroup$
– Will Jagy
Jan 11 at 20:18




$begingroup$
First write the recurrence among $b_n, b_{n-1}, b_{n-2}$ using
$endgroup$
– Will Jagy
Jan 11 at 20:18










2 Answers
2






active

oldest

votes


















11












$begingroup$

Hint: By taking the log (with respect to any base) of both sides, we can rewrite the recurrence as
$$
log(a_n) = frac 12[log(a_{n-1}) + log(a_{n-2})]
$$
So, the sequence $b_n := log(a_n)$ satisfies a linear recurrence.






share|cite|improve this answer









$endgroup$





















    3












    $begingroup$

    Taking logs,
    and letting
    $b_n = log a_n$,
    this becomes
    $b_n
    =frac12(b_{n-1}+b_{n-2})
    $    .



    The characteristic polynomial is
    $x^2-frac12 x-frac12 = 0$
    which has roots
    $x
    =dfrac{frac12pmsqrt{frac14+2}}{2}
    =dfrac{frac12pmsqrt{frac94}}{2}
    =dfrac{frac12pmfrac32}{2}
    =dfrac{2, -1}{2}
    =1, -frac12
    $
    so the solutions are
    $b_n = 1$
    and
    $b_n = (-1/2)^n
    $    .



    As a check
    $frac12(b_{n-1}+b_{n-2})
    =frac12((-1/2)^{n-1}+(-1/2)^{n-2})
    =frac12(-1/2)^{n-2}(-frac12+1)
    =frac12(-1/2)^{n-2}(frac12)
    =frac14(-1/2)^{n-2}
    =(-1/2)^{n}
    $    .



    Therefore
    $b_n = u+v(-1/2)^{n}$
    for any reals $u$ and $v$,
    so,
    $a_n = rs^{(-1/2)^{n}}$
    where $r$ and $s$ are
    positive reals
    (actually, you can let them be
    any types that you can raise to a real power).






    share|cite|improve this answer









    $endgroup$














      Your Answer








      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',
      autoActivateHeartbeat: false,
      convertImagesToLinks: true,
      noModals: true,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: 10,
      bindNavPrevention: true,
      postfix: "",
      imageUploader: {
      brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
      contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
      allowUrls: true
      },
      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%2f3070299%2ffind-a-general-solution-for-this-recurrence-a-n-sqrta-n-1a-n-2%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      11












      $begingroup$

      Hint: By taking the log (with respect to any base) of both sides, we can rewrite the recurrence as
      $$
      log(a_n) = frac 12[log(a_{n-1}) + log(a_{n-2})]
      $$
      So, the sequence $b_n := log(a_n)$ satisfies a linear recurrence.






      share|cite|improve this answer









      $endgroup$


















        11












        $begingroup$

        Hint: By taking the log (with respect to any base) of both sides, we can rewrite the recurrence as
        $$
        log(a_n) = frac 12[log(a_{n-1}) + log(a_{n-2})]
        $$
        So, the sequence $b_n := log(a_n)$ satisfies a linear recurrence.






        share|cite|improve this answer









        $endgroup$
















          11












          11








          11





          $begingroup$

          Hint: By taking the log (with respect to any base) of both sides, we can rewrite the recurrence as
          $$
          log(a_n) = frac 12[log(a_{n-1}) + log(a_{n-2})]
          $$
          So, the sequence $b_n := log(a_n)$ satisfies a linear recurrence.






          share|cite|improve this answer









          $endgroup$



          Hint: By taking the log (with respect to any base) of both sides, we can rewrite the recurrence as
          $$
          log(a_n) = frac 12[log(a_{n-1}) + log(a_{n-2})]
          $$
          So, the sequence $b_n := log(a_n)$ satisfies a linear recurrence.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Jan 11 at 20:23









          OmnomnomnomOmnomnomnom

          129k794188




          129k794188























              3












              $begingroup$

              Taking logs,
              and letting
              $b_n = log a_n$,
              this becomes
              $b_n
              =frac12(b_{n-1}+b_{n-2})
              $              .



              The characteristic polynomial is
              $x^2-frac12 x-frac12 = 0$
              which has roots
              $x
              =dfrac{frac12pmsqrt{frac14+2}}{2}
              =dfrac{frac12pmsqrt{frac94}}{2}
              =dfrac{frac12pmfrac32}{2}
              =dfrac{2, -1}{2}
              =1, -frac12
              $
              so the solutions are
              $b_n = 1$
              and
              $b_n = (-1/2)^n
              $              .



              As a check
              $frac12(b_{n-1}+b_{n-2})
              =frac12((-1/2)^{n-1}+(-1/2)^{n-2})
              =frac12(-1/2)^{n-2}(-frac12+1)
              =frac12(-1/2)^{n-2}(frac12)
              =frac14(-1/2)^{n-2}
              =(-1/2)^{n}
              $              .



              Therefore
              $b_n = u+v(-1/2)^{n}$
              for any reals $u$ and $v$,
              so,
              $a_n = rs^{(-1/2)^{n}}$
              where $r$ and $s$ are
              positive reals
              (actually, you can let them be
              any types that you can raise to a real power).






              share|cite|improve this answer









              $endgroup$


















                3












                $begingroup$

                Taking logs,
                and letting
                $b_n = log a_n$,
                this becomes
                $b_n
                =frac12(b_{n-1}+b_{n-2})
                $                .



                The characteristic polynomial is
                $x^2-frac12 x-frac12 = 0$
                which has roots
                $x
                =dfrac{frac12pmsqrt{frac14+2}}{2}
                =dfrac{frac12pmsqrt{frac94}}{2}
                =dfrac{frac12pmfrac32}{2}
                =dfrac{2, -1}{2}
                =1, -frac12
                $
                so the solutions are
                $b_n = 1$
                and
                $b_n = (-1/2)^n
                $                .



                As a check
                $frac12(b_{n-1}+b_{n-2})
                =frac12((-1/2)^{n-1}+(-1/2)^{n-2})
                =frac12(-1/2)^{n-2}(-frac12+1)
                =frac12(-1/2)^{n-2}(frac12)
                =frac14(-1/2)^{n-2}
                =(-1/2)^{n}
                $                .



                Therefore
                $b_n = u+v(-1/2)^{n}$
                for any reals $u$ and $v$,
                so,
                $a_n = rs^{(-1/2)^{n}}$
                where $r$ and $s$ are
                positive reals
                (actually, you can let them be
                any types that you can raise to a real power).






                share|cite|improve this answer









                $endgroup$
















                  3












                  3








                  3





                  $begingroup$

                  Taking logs,
                  and letting
                  $b_n = log a_n$,
                  this becomes
                  $b_n
                  =frac12(b_{n-1}+b_{n-2})
                  $                  .



                  The characteristic polynomial is
                  $x^2-frac12 x-frac12 = 0$
                  which has roots
                  $x
                  =dfrac{frac12pmsqrt{frac14+2}}{2}
                  =dfrac{frac12pmsqrt{frac94}}{2}
                  =dfrac{frac12pmfrac32}{2}
                  =dfrac{2, -1}{2}
                  =1, -frac12
                  $
                  so the solutions are
                  $b_n = 1$
                  and
                  $b_n = (-1/2)^n
                  $                  .



                  As a check
                  $frac12(b_{n-1}+b_{n-2})
                  =frac12((-1/2)^{n-1}+(-1/2)^{n-2})
                  =frac12(-1/2)^{n-2}(-frac12+1)
                  =frac12(-1/2)^{n-2}(frac12)
                  =frac14(-1/2)^{n-2}
                  =(-1/2)^{n}
                  $                  .



                  Therefore
                  $b_n = u+v(-1/2)^{n}$
                  for any reals $u$ and $v$,
                  so,
                  $a_n = rs^{(-1/2)^{n}}$
                  where $r$ and $s$ are
                  positive reals
                  (actually, you can let them be
                  any types that you can raise to a real power).






                  share|cite|improve this answer









                  $endgroup$



                  Taking logs,
                  and letting
                  $b_n = log a_n$,
                  this becomes
                  $b_n
                  =frac12(b_{n-1}+b_{n-2})
                  $                  .



                  The characteristic polynomial is
                  $x^2-frac12 x-frac12 = 0$
                  which has roots
                  $x
                  =dfrac{frac12pmsqrt{frac14+2}}{2}
                  =dfrac{frac12pmsqrt{frac94}}{2}
                  =dfrac{frac12pmfrac32}{2}
                  =dfrac{2, -1}{2}
                  =1, -frac12
                  $
                  so the solutions are
                  $b_n = 1$
                  and
                  $b_n = (-1/2)^n
                  $                  .



                  As a check
                  $frac12(b_{n-1}+b_{n-2})
                  =frac12((-1/2)^{n-1}+(-1/2)^{n-2})
                  =frac12(-1/2)^{n-2}(-frac12+1)
                  =frac12(-1/2)^{n-2}(frac12)
                  =frac14(-1/2)^{n-2}
                  =(-1/2)^{n}
                  $                  .



                  Therefore
                  $b_n = u+v(-1/2)^{n}$
                  for any reals $u$ and $v$,
                  so,
                  $a_n = rs^{(-1/2)^{n}}$
                  where $r$ and $s$ are
                  positive reals
                  (actually, you can let them be
                  any types that you can raise to a real power).







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Jan 11 at 20:35









                  marty cohenmarty cohen

                  75.4k549130




                  75.4k549130






























                      draft saved

                      draft discarded




















































                      Thanks for contributing an answer to Mathematics Stack Exchange!


                      • Please be sure to answer the question. Provide details and share your research!

                      But avoid …



                      • Asking for help, clarification, or responding to other answers.

                      • Making statements based on opinion; back them up with references or personal experience.


                      Use MathJax to format equations. MathJax reference.


                      To learn more, see our tips on writing great answers.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function () {
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3070299%2ffind-a-general-solution-for-this-recurrence-a-n-sqrta-n-1a-n-2%23new-answer', 'question_page');
                      }
                      );

                      Post as a guest















                      Required, but never shown





















































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown

































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown







                      -

                      Popular posts from this blog

                      Cabo Verde

                      Image
                        Nota: Cabo-verdiano redireciona para este artigo. Para a língua falada em Cabo Verde, veja crioulo cabo-verdiano. Para outros significados, veja Cabo Verde (desambiguação). Coordenadas: 14° 55' N 23° 31' O Cabo Verde República de Cabo Verde Bandeira Brasão de Armas Lema: Unidade, Trabalho, Progresso Hino nacional: Cântico da Liberdade Gentílico: cabo-verdiano [ 1 ] Capital Praia 14° 55' N 23° 31' O Cidade mais populosa Praia Língua oficial Português Governo República unitária semipresidencialista [ 2 ]  - Presidente Jorge Carlos Fonseca  - Primeiro-ministro Ulisses Correia e Silva História    - Descoberta 1460   - Independência 00 • de Portugal 5 de Julho de 1975   - Multipartidarismo 13 de Janeiro de 1990  Área    - Total 4 033 km² (146.º)  - Água (%) 0,08 População    - Estimativa para 2017 560 899 [ 3 ] hab. (173.º)
                      Read more

                      Karlovacs län

                      Image
                      .mw-parser-output table.ambox{margin:0 10%;border-collapse:collapse;background:#fbfbfb;border:1px solid #aaa;border-left:10px solid #608ec2}.mw-parser-output table.ambox th.ambox-text,.mw-parser-output table.ambox td.ambox-text{padding:.25em .5em;width:100%}.mw-parser-output table.ambox td.ambox-image{padding:2px 0 2px .5em;text-align:center;vertical-align:middle}.mw-parser-output table.ambox td.ambox-imageright{padding:2px 4px 2px 0;text-align:center;vertical-align:middle}.mw-parser-output table.ambox-notice{border-left:10px solid #608ec2}.mw-parser-output table.ambox-delete,.mw-parser-output table.ambox-serious{border-left:10px solid #b22222}.mw-parser-output table.ambox-content{border-left:10px solid #f28500}.mw-parser-output table.ambox-style{border-left:10px solid #f4c430}.mw-parser-output table.ambox-merge{border-left:10px solid #9932cc}.mw-parser-output table.ambox-protection{border-left:10px solid #bba}.mw-parser-output .ambox+.ambox,.mw-parser-output .topbox+.ambox,.mw-pars
                      Read more

                      Gyllenstierna

                      Image
                      .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid
                      Read more