RSS

doubt finding the recurrent relation

Please support our Computer Science advertiser: Programming Forums

Views: 1344 | Replies: 2 | Thread Tools Display Modes

•

Join Date: Sep 2005

Posts: 8

Reputation: Gotcha is an unknown quantity at this point

Rep Power: 0

Solved Threads: 0

Gotcha

Offline

Newbie Poster

doubt finding the recurrent relation

Oct 19th, 2005

Does anyone knows how to solve this?

Thanks for suggestions.

Find a recurrent relation, its initial conditions and explain how is obtained this relation.

A Driver pays in a station of toll using only five cents coins or ten cents coins, throwing one currency a the time. Find the number of different forms that it can pay in the toll plaza. (the order in which the currencies are thrown is important and consider that the payment of the toll is a multiple of 5 cents.

thanxs,

•

Join Date: Jun 2005

Location: Cambridge, MA

Posts: 1,367

Reputation: Rashakil Fol has a spectacular aura about

Rep Power: 7

Solved Threads: 45

Rashakil Fol Rashakil Fol is offline

Offline

Salamander Man

Re: doubt finding the recurrent relation

Oct 20th, 2005

He either throws a nickel first or a dime first. The number of ways to pay is equal to the number of ways to pay by throwing a nickel first added to the number of ways to pay by throwing a dime first.