21. Each day you buy exactly one of the following items: tape (costing $1), a ruler (costing $1), pens (costing $2), pencils (costing $2), paper (costing $2), or a loose-leaf binder (costing $3). Write a recurrence relation and initial conditions for the number s, of different sequences in which you can spend exactly n dollars (n 1) 22. Suppose that you have a large supply of 2-, 3-, and 5-cent stamps. Write a recurrence relation and initial conditions for the number sn of different ways in which n cents worth of postage.can be attached to an envelope 9.1 Recurrence Relations 469 if the order in which the stamps are attached matters. (Thus a 2-cent stamp followed by a 3-cent stamp is different froma 3-cent stamp followed by a 2-cent stamp.) 23. Write a recurrence relation and initial conditions for an, the number of arrangements of the integers1, 2, ...,n. 24. Write a recurrence relation and initial conditions for s, the number of subsets of a set with n elements. 25. Write a recurrence relation and initial conditions for s, the number of two-element subsets of a set with n elements. 26. Write a recurrence relation and initial conditions for the number sn of n-bit strings having no two consecutive 27. Write a recurrence relation and initial conditions for the number s of sequences of nickels, dimes, and quarters that can be inserted into a vending machine to purchase a soft drink costing 5n cents. How many sequences zeros. Compute s6. a recurrencerelation and initial conditions for pn, the number of L-shaped pieces needed to cover a 6 x for the number Cn of different ways to group 2n people int are there for a drink costing 50 cents? 28. For n 2, a 6 x n checkerboard can be covered by L-shaped pieces of the type shown in Figure 2.20. Write its natu

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Topic Video
Question

#22 please 

21. Each day you buy exactly one of the following items: tape (costing $1), a ruler (costing $1), pens (costing $2),
pencils (costing $2), paper (costing $2), or a loose-leaf binder (costing $3). Write a recurrence relation and
initial conditions for the number s, of different sequences in which you can spend exactly n dollars (n 1)
22. Suppose that you have a large supply of 2-, 3-, and 5-cent stamps. Write a recurrence relation and initial
conditions for the number sn of different ways in which n cents worth of postage.can be attached to an envelope
9.1 Recurrence Relations
469
if the order in which the stamps are attached matters. (Thus a 2-cent stamp followed by a 3-cent stamp is
different froma 3-cent stamp followed by a 2-cent stamp.)
23. Write a recurrence relation and initial conditions for an, the number of arrangements of the integers1, 2, ...,n.
24. Write a recurrence relation and initial conditions for s, the number of subsets of a set with n elements.
25. Write a recurrence relation and initial conditions for s, the number of two-element subsets of a set with n
elements.
26. Write a recurrence relation and initial conditions for the number sn of n-bit strings having no two consecutive
27. Write a recurrence relation and initial conditions for the number s of sequences of nickels, dimes, and quarters
that can be inserted into a vending machine to purchase a soft drink costing 5n cents. How many sequences
zeros. Compute s6.
a recurrencerelation and initial conditions for pn, the number of L-shaped pieces needed to cover a 6 x
for the number Cn of different ways to group 2n people int
are there for a drink costing 50 cents?
28. For n 2, a 6 x n checkerboard can be covered by L-shaped pieces of the type shown in Figure 2.20. Write
its natu
Transcribed Image Text:21. Each day you buy exactly one of the following items: tape (costing $1), a ruler (costing $1), pens (costing $2), pencils (costing $2), paper (costing $2), or a loose-leaf binder (costing $3). Write a recurrence relation and initial conditions for the number s, of different sequences in which you can spend exactly n dollars (n 1) 22. Suppose that you have a large supply of 2-, 3-, and 5-cent stamps. Write a recurrence relation and initial conditions for the number sn of different ways in which n cents worth of postage.can be attached to an envelope 9.1 Recurrence Relations 469 if the order in which the stamps are attached matters. (Thus a 2-cent stamp followed by a 3-cent stamp is different froma 3-cent stamp followed by a 2-cent stamp.) 23. Write a recurrence relation and initial conditions for an, the number of arrangements of the integers1, 2, ...,n. 24. Write a recurrence relation and initial conditions for s, the number of subsets of a set with n elements. 25. Write a recurrence relation and initial conditions for s, the number of two-element subsets of a set with n elements. 26. Write a recurrence relation and initial conditions for the number sn of n-bit strings having no two consecutive 27. Write a recurrence relation and initial conditions for the number s of sequences of nickels, dimes, and quarters that can be inserted into a vending machine to purchase a soft drink costing 5n cents. How many sequences zeros. Compute s6. a recurrencerelation and initial conditions for pn, the number of L-shaped pieces needed to cover a 6 x for the number Cn of different ways to group 2n people int are there for a drink costing 50 cents? 28. For n 2, a 6 x n checkerboard can be covered by L-shaped pieces of the type shown in Figure 2.20. Write its natu
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 1 steps

Blurred answer
Knowledge Booster
Discrete Probability Distributions
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,