New Home Forums Math Olympiad - IOQM Number Theory Recurrence relation

Viewing 3 posts - 1 through 3 (of 3 total)
  • Author
    Posts
  • #64465
    Crazy Gamer
    Participant

    find the value of  A(2). where A(n)=17A(n-1)+30n ,when A(0)=3

    [A(2) or A(n) stands for '2 or n' is suffix of A respectively.

     

    #64505

    we will get back to you soon

    #64946
    Saumik Karfa
    Participant

    Given recurrence relation is : $A_n=17A_{n-1}+30n\ldots\ldots (i)$

    Using the same relation we can write $A_{n-1}=17A_{n-2}+30(n-1)$

    Putting the value of $A_{n-1}$ is $(i)$

    $A_n=17^2A_{n-2}+30[n+17(n-1)]$

    Repeat this process until you get $A_0$ in the equation.

Viewing 3 posts - 1 through 3 (of 3 total)
  • You must be logged in to reply to this topic.
linkedin facebook pinterest youtube rss twitter instagram facebook-blank rss-blank linkedin-blank pinterest youtube twitter instagram