The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Math Topics » discretemath

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: more recurrence relations
Replies: 1   Last Post: Nov 7, 1999 2:08 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 58
Registered: 12/6/04
more recurrence relations
Posted: Nov 5, 1999 6:35 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

I'm not very good with recurrence relations ... so I guess the only
way to get better is practice.

This is the qn I'm now having problems doing:

Suppose that we have 4 cent stamps, 6 cent stamps, and 10 cent stamps,
each in unlimited supply. Let f(n) be the number of ways of obtaining
n cents of postage if the order in which we put on stamps counts. For
example, f(4)=1 and f(8)=1 (two 4 cent stamps), while f(10)=3 (one 10
cent stamp, or a 4 cent stamp followed by a 6 cents stamp, or a 6 cent
stamp followed by a 4 cent stamp).

(a) If n >10, derive a recurrence for f(n).
(b) Use the recurrence of part a) to find the # of ways of obtaining
14 cents of postage. (... this is just f(14) right?)

Thank you for the help again :)

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.