Solve recursion












2












$begingroup$


$a_n=n^2times a_{(n-1)}$, for $ n>0, a_0=1$



Whats the correct formula to use in this case?



I solved problem with recursion before, but they had '$+$' instead of $'times'$ so there is following formula to simply solve them:
$ar^n+bnr^n$.



Is there something similar, but for multiplication instead?






discrete-mathematics







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Compute the first terms for $sqrt{a_n}$.
    $endgroup$
    – Mindlack
    Jan 26 at 23:29
















2












$begingroup$


$a_n=n^2times a_{(n-1)}$, for $ n>0, a_0=1$



Whats the correct formula to use in this case?



I solved problem with recursion before, but they had '$+$' instead of $'times'$ so there is following formula to simply solve them:
$ar^n+bnr^n$.



Is there something similar, but for multiplication instead?






discrete-mathematics







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Compute the first terms for $sqrt{a_n}$.
    $endgroup$
    – Mindlack
    Jan 26 at 23:29














2












2








2





$begingroup$


$a_n=n^2times a_{(n-1)}$, for $ n>0, a_0=1$



Whats the correct formula to use in this case?



I solved problem with recursion before, but they had '$+$' instead of $'times'$ so there is following formula to simply solve them:
$ar^n+bnr^n$.



Is there something similar, but for multiplication instead?






discrete-mathematics







share|cite|improve this question











$endgroup$




$a_n=n^2times a_{(n-1)}$, for $ n>0, a_0=1$



Whats the correct formula to use in this case?



I solved problem with recursion before, but they had '$+$' instead of $'times'$ so there is following formula to simply solve them:
$ar^n+bnr^n$.



Is there something similar, but for multiplication instead?






discrete-mathematics




discrete-mathematics






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 26 at 23:29









abc...

3,237738




3,237738










asked Jan 26 at 23:27









GorossoGorosso

315




315








  • 1




    $begingroup$
    Compute the first terms for $sqrt{a_n}$.
    $endgroup$
    – Mindlack
    Jan 26 at 23:29














  • 1




    $begingroup$
    Compute the first terms for $sqrt{a_n}$.
    $endgroup$
    – Mindlack
    Jan 26 at 23:29








1




1




$begingroup$
Compute the first terms for $sqrt{a_n}$.
$endgroup$
– Mindlack
Jan 26 at 23:29




$begingroup$
Compute the first terms for $sqrt{a_n}$.
$endgroup$
– Mindlack
Jan 26 at 23:29










2 Answers
2






active

oldest

votes


















2












$begingroup$

$a_n=(n!)^2$ using induction. Try to evaluate the first few terms on your own.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    This is the only reasonable answer, but it shows that the problem is somewhat stupid as $n!$ is defined literally like that, i.e. $n! = n cdot (n-1) cdot ldots cdot 2 cdot 1$...
    $endgroup$
    – Klaus
    Jan 26 at 23:37





















1












$begingroup$

Multiply these lines together:
begin{align}
a_n&=n^2times a_{n-1}\
a_{n-1}&=(n-1)^2times a_{n-2}\
&dots\
a_2&=2^2times a_{1}\
a_1&=1^2times a_{0}\
end{align}
After canceling, we get
$$
a_n = 1^2 cdot 2^2 cdots n^2 a_0 = (1 cdot 2 cdots n)^2 = (n!)^2
$$






share|cite|improve this answer









$endgroup$













    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',
    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%2f3088920%2fsolve-recursion%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









    2












    $begingroup$

    $a_n=(n!)^2$ using induction. Try to evaluate the first few terms on your own.






    share|cite|improve this answer









    $endgroup$













    • $begingroup$
      This is the only reasonable answer, but it shows that the problem is somewhat stupid as $n!$ is defined literally like that, i.e. $n! = n cdot (n-1) cdot ldots cdot 2 cdot 1$...
      $endgroup$
      – Klaus
      Jan 26 at 23:37


















    2












    $begingroup$

    $a_n=(n!)^2$ using induction. Try to evaluate the first few terms on your own.






    share|cite|improve this answer









    $endgroup$













    • $begingroup$
      This is the only reasonable answer, but it shows that the problem is somewhat stupid as $n!$ is defined literally like that, i.e. $n! = n cdot (n-1) cdot ldots cdot 2 cdot 1$...
      $endgroup$
      – Klaus
      Jan 26 at 23:37
















    2












    2








    2





    $begingroup$

    $a_n=(n!)^2$ using induction. Try to evaluate the first few terms on your own.






    share|cite|improve this answer









    $endgroup$



    $a_n=(n!)^2$ using induction. Try to evaluate the first few terms on your own.







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Jan 26 at 23:30









    abc...abc...

    3,237738




    3,237738












    • $begingroup$
      This is the only reasonable answer, but it shows that the problem is somewhat stupid as $n!$ is defined literally like that, i.e. $n! = n cdot (n-1) cdot ldots cdot 2 cdot 1$...
      $endgroup$
      – Klaus
      Jan 26 at 23:37




















    • $begingroup$
      This is the only reasonable answer, but it shows that the problem is somewhat stupid as $n!$ is defined literally like that, i.e. $n! = n cdot (n-1) cdot ldots cdot 2 cdot 1$...
      $endgroup$
      – Klaus
      Jan 26 at 23:37


















    $begingroup$
    This is the only reasonable answer, but it shows that the problem is somewhat stupid as $n!$ is defined literally like that, i.e. $n! = n cdot (n-1) cdot ldots cdot 2 cdot 1$...
    $endgroup$
    – Klaus
    Jan 26 at 23:37






    $begingroup$
    This is the only reasonable answer, but it shows that the problem is somewhat stupid as $n!$ is defined literally like that, i.e. $n! = n cdot (n-1) cdot ldots cdot 2 cdot 1$...
    $endgroup$
    – Klaus
    Jan 26 at 23:37













    1












    $begingroup$

    Multiply these lines together:
    begin{align}
    a_n&=n^2times a_{n-1}\
    a_{n-1}&=(n-1)^2times a_{n-2}\
    &dots\
    a_2&=2^2times a_{1}\
    a_1&=1^2times a_{0}\
    end{align}
    After canceling, we get
    $$
    a_n = 1^2 cdot 2^2 cdots n^2 a_0 = (1 cdot 2 cdots n)^2 = (n!)^2
    $$






    share|cite|improve this answer









    $endgroup$


















      1












      $begingroup$

      Multiply these lines together:
      begin{align}
      a_n&=n^2times a_{n-1}\
      a_{n-1}&=(n-1)^2times a_{n-2}\
      &dots\
      a_2&=2^2times a_{1}\
      a_1&=1^2times a_{0}\
      end{align}
      After canceling, we get
      $$
      a_n = 1^2 cdot 2^2 cdots n^2 a_0 = (1 cdot 2 cdots n)^2 = (n!)^2
      $$






      share|cite|improve this answer









      $endgroup$
















        1












        1








        1





        $begingroup$

        Multiply these lines together:
        begin{align}
        a_n&=n^2times a_{n-1}\
        a_{n-1}&=(n-1)^2times a_{n-2}\
        &dots\
        a_2&=2^2times a_{1}\
        a_1&=1^2times a_{0}\
        end{align}
        After canceling, we get
        $$
        a_n = 1^2 cdot 2^2 cdots n^2 a_0 = (1 cdot 2 cdots n)^2 = (n!)^2
        $$






        share|cite|improve this answer









        $endgroup$



        Multiply these lines together:
        begin{align}
        a_n&=n^2times a_{n-1}\
        a_{n-1}&=(n-1)^2times a_{n-2}\
        &dots\
        a_2&=2^2times a_{1}\
        a_1&=1^2times a_{0}\
        end{align}
        After canceling, we get
        $$
        a_n = 1^2 cdot 2^2 cdots n^2 a_0 = (1 cdot 2 cdots n)^2 = (n!)^2
        $$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Jan 27 at 0:37









        lhflhf

        166k11172402




        166k11172402






























            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%2f3088920%2fsolve-recursion%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

            'app-layout' is not a known element: how to share Component with different Modules

            Image
            0 My application was working fine until I decided to go with lazy loading: So, my shared component looks like this: import { Component, Renderer2 } from '@angular/core'; export interface FormModel { captcha?: string; } @Component({ selector: 'app-layout', templateUrl: './app-layout.component.html', styleUrls: ['./app-layout.css'] }) export class FullLayoutComponent { } app-layout.component.ts I am using this component in my Another component say school-home.component.html like this: <app-layout> </app-layout> and it was working fine until I created a Module school-home.module.ts like this: import { NgModule } from '@angular/core'; import { CommonModule } from '@angular/common'; import { SchoolhomeRoutingModule ...
            Read more

            android studio warns about leanback feature tag usage required on manifest while using Unity exported app?

            Image
            .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } 0 This is a simple project showing cubes on Unity, exported to android project and imported on Android studio. On maifest file it showed following warning: Expecting <uses-feature android:name="android.software.leanback" android:required="false" /> tag I have no information about it. And also on default emptyview android project does not use/mention this feature. I know it is required by TV's and such but why its not added by default? Why is this? And Should I concern about it? android unity3d ...
            Read more

            WPF add header to Image with URL pettitions [duplicate]

            Image
            up vote 0 down vote favorite This question already has an answer here: Image source URI requiring authorization 3 answers Add header to all* HTTP requests on a machine 1 answer first of all sorry for my english. Recently I added some security in the backend of my project, and now I need to send a validation code(apiKey) inside the headers to retrieve the images. I have a problem with ALL images in my project that I had attached in my UI. For example, before I had: <Image Height="90" Source="{Binding Video.Thumbnail}"/> Now I need to change my code to create a CUSTOM petition add the apiKey in the header:...
            Read more