Abus driver pays all tolls, using only nickels and dimes, by throwing one coin at a time into the mechanical toll collector.
a) find a recurrence relation for the number of different ways the bus driver can pay a toll of n cents (where the order in which the coins are used matters).
b) in how many different ways can the driver pay a toll of 45 cents.

a) An = An-1 + An-2

b) 55ways

Step-by-step explanation:

a) a nickel is 5 cents and a dime is 10cent so a multiple of 5 cents is the possible way to pay the tolls in both choices.

Let An represents the number of possible ways the driver can pay a toll of 5n cents, so that

An = 5n cents

Case 1: Using a nickel for payment which is 5 cents, the number of ways given as;

An-1 = 5( n-1)

Case 2: using a dime which is two 5 cents, the number of ways is given as;

An-2 = 5(n-2)

Summing up the number of ways, we have

An = An-1 + An-2

From the relation,

If n= 0, Ao= 1

n =1, A1= 1

b) 45 cents paid in multiples of 5cents will give us 9 ways(A9)

From the relation, we have that

Ao = 1

A1 = 1

An =An-1 + An-2

Ao = 1

A1 = 1

A2 = A1+Ao = 1+1= 2

A3 = A2 + A1 = 3

A4 = A3+A2=5

A5=A4+A3=8

A6=A5+A4=13

A7 =A6+A5 = 21

A8= A7+A6= 34

A9= A8+A7= 55

So there are 55ways to pay 45cents.

answer: i think it is (1,-2)

, and

for

step-by-step explanation:

we can analyze the pattern at which the terms increase. let us denote , , , so that we can call

note the following:

the pattern: to get the next term value, we just add the next term number (e.g. 1st, 2nd, to the previous term value (term values are the given numbers in the question, 1, 3, 6, 10, 15,

from , to get to , we add

from , to get to , we add

etc.

we need to form a recursive formula, a formula that has the next term as a function of the previous term. so a possible recursive formula can be

, and for