Results 1 to 2 of 2

Math Help - recurrence

  1. #1
    Newbie
    Joined
    Mar 2008
    Posts
    5

    recurrence

    Let An be the number of ways that nickels and dimes can be inserted (one at a time) into a vending machine to purchase and item that costs 5n cents.

    a) Find a1, a2, a3, a4

    b) Find a recurrence relation for An

    I think a1=5 a2=10 a3=15 and a4=20

    but i cant find an answer for b.

    Can someone please help?

    Thank you
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor Mathstud28's Avatar
    Joined
    Mar 2008
    From
    Pennsylvania
    Posts
    3,641

    Your

    part A is correct i assume you used _nC_r and imputing in the correct numbers as for part b its not that difficult..just look at again and try to analyze what g(n)=f(n)=f(n-1)
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. recurrence relations - degree of the recurrence
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: April 6th 2009, 07:56 PM
  2. Recurrence Relation
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: March 22nd 2009, 09:46 AM
  3. Recurrence relation
    Posted in the Discrete Math Forum
    Replies: 11
    Last Post: February 14th 2009, 06:24 PM
  4. recurrence
    Posted in the Algebra Forum
    Replies: 1
    Last Post: February 8th 2009, 03:46 PM
  5. recurrence
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: February 1st 2009, 10:53 PM

Search Tags


/mathhelpforum @mathhelpforum