Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Use generating functions to find the number of ways to make change for \(100 using

a) \)10, \(20, and \)50 bills.

b) \(5, \)10, \(20, and \)50 bills.

c) \(5, \)10, \(20, and \)50 bills if at least one bill of each denomination is used.

d) \(5, \)10, and $20 bills if at least one and no more than four of each denomination is used.

Short Answer

Expert verified

The answer to each sub-part is given below:

(a) 10

(b) 49

(c) 2

(d) 4

Step by step solution

01

Use Generating Function:

Generating function for the sequencea0,a1,,ak,of real numbers is the infinite series;

G(x)=a0+a1x+a2x2++akxk+=k=0+akxk

Extended binomial theorem:

(1+x)u=k=0+(uk)xk

$10can form any dollar amount that is a multiple of 10 and thus the generating function for the dimes can contain all powers of x that are multiples of 10:

1+x10+x20+

$20can form any dollar amount that is a multiple of 20 and thus the generating function for the dimes can contain all powers of x that are multiples of 20:

1+x20+x40+

$50can form any dollar amount that is a multiple of 50 and thus the generating function for the dimes can contain all powers of x that are multiples of $50:

1+x50+x100+

02

The total generating function is then the product of the generating functions for each type of bill.

The coefficient of x100(100 cents or 1 dollar), thus we only require the sums up to the terms x100(in the non-finite sums). Expand the sum:

k=010x10kk=05x20kk=02x50k=1+x10+2x20+2x30+3x40+5x50+5x60+6x70+7x80+8x90+10x100+10x110+11x120+11x130+12x140+12x150+12x160+11x170+11x180+10x190+10x200+8x210+7x220+6x230+5x240+4x250+3x260+2x270+2x280+x290+x300

Thus, the coefficient of x100isa100=10.

03

The generating function for the dimes can contain all powers of x that are multiples of 5:

$5can form any dollar amount that is a multiple of 5 and thus the generating function for the dimes can contain all powers of x that are multiples of 5:

1+x5+x10+

$10 can form any dollar amount that is a multiple of 10 and thus the generating function for the dimes can contain all powers of x that are multiples of 10:

1+x10+x20+

$20can form any dollar amount that is a multiple of 20 and thus the generating function for the dimes can contain all powers of x that are multiples of 20:

1+x20+x40+

$50 can form any dollar amount that is a multiple of 50 and thus the generating function for the dimes can contain all powers of x that are multiples of 50.

1+x50+x100+

04

The total generating function is then the product of the generating functions for each type of bill.

1+x5+x10+1+x10+x20+1+x20+x40+1+x50+x100+=k=0+x5kk=0+x10kk=0+x20kk=0+x50k

We are interested in the coefficient of x100(100 dollars), thus we only require the sums up to the terms x100. Use technology to expand the sum.

k=020x5kk=010x10kk=05x20kk=02x50k=1+x5+2x10+2x15+4x20+4x25++39x95+49x100+48x105+58x110+

Thus, the coefficient of x100isa100=49.

05

The generating function for the dimes can contain all powers of $x$ that are multiples of 5.

$5 can form any dollar amount that is a multiple of 5.

At least one bill is used, thus the power cannot be 0.

x5+x10+x15+

$10 can form any dollar amount that is a multiple of 10 and thus the generating function for the dimes can contain all powers of x that are multiples of 10.

At least one bill is used, thus the power cannot be 0.

x10+x20+x30+

$20 can form any dollar amount that is a multiple of 20 and thus the generating function for the dimes can contain all powers of x that are multiples of 20.

At least one bill is used, thus the power cannot be 0.

x20+x40+x60+

$50 can form any dollar amount that is a multiple of 50 and thus the generating function for the dimes can contain all powers of x that are multiples of 50.

At least one bill is used, thus the power cannot be 0.

x50+x100+x150+

06

The total generating function is then the product of the generating functions for each type of bill.

x5+x10+x15+x10+x20+x30+x20+x40+x60+x50+x100+x150+=k=1+x5kk=1+x10kk=1+x20kk=1+x50k=x5x10x20x50k=0+x5kk=0+x10kk=0+x20kk=0+x50k=x85k=0+x5kk=0+x10kk=0+x20kk=0+x50k

The coefficient of x100(100 dollars), thus we only require the sums up to the termsx100. Expand the sum:

x85k=020x5kk=010x10kk=05x20kk=12x50k=x85+x90+2x95+2x100+4x105+4x110+

Thus, the coefficient of x100isa100=2.

07

The generating function for the dimes can contain all powers of x that are multiples of 5.

$5 can form any dollar amount that is a multiple of 5. At least one bill is used, thus the power cannot be 0.

At most 4 bills are used, thus the powers cannot be more than4·5=20.x5+x10+x15+x20

$10 can form any dollar amount that is a multiple of 10 and thus the generating function for the dimes can contain all powers of x that are multiples of 10.

At least one bill is used, thus the power cannot be 0. At most 4 bills are used, thus the powers cannot be more than4·20=80.

x10+x20+x30+x40

$20 can form any dollar amount that is a multiple of 20 and thus the generating function for the dimes can contain all powers of x that are multiples of 20.

At least one bill is used, thus the power cannot be 0. At most 4 bills are used, thus the powers cannot be more than4·20=80.

x20+x40+x60+x80

08

The total generating function is then the product of the generating functions for each type of bill.

x5+x10+x15+x20x10+x20+x30+x40x20+x40+x60+x80=k=14x5kk=14x10kk=14x20k=x5x10x20k=03x5kk=03x10kk=03x20k

Expand the sum:

x35k=03x5kk=03x10kk=03x20k=x35+x40+2x45+2x50+3x55+3x60+4x65+4x70+4x75+4x80+4x85+4x90+4x95+4x100+4x105+4x110+3x115+3x120+2x125+2x130+x135+x140

Thus, the coefficient of x100isa100=4.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Find the solution to the recurrence relation,

\(f\left( n \right) = f\left( {\frac{n}{2}} \right) + {n^2}\)

For \(n = {2^k}\)

Where \(k\) is a positive integer and

\(f\left( 1 \right) = 1\).

Use generating functions (and a computer algebra package, if available) to find the number of ways to make change for 1 using pennies, nickels, dimes, and quarters with

a) no more than 10 pennies.

b) no more than 10 pennies and no more than 10 nickels.

c) no more than 10 coins

A sequence \({a_1},{a_2},.....,{a_n}\) is unimodal if and only if there is an index \(m,1 \le m \le n,\) such that \({a_i} < {a_i} + 1\) when \(1{1 < i < m}\) and \({a_i} > {a_{i + 1}}\) when \(m \le i < n\). That is, the terms of the sequence strictly increase until the \(m\)th term and they strictly decrease after it, which implies that \({a_m}\) is the largest term. In this exercise, \({a_m}\) will always denote the largest term of the unimodal sequence \({a_1},{a_2},.....,{a_n}\).

a) Show that \({a_m}\) is the unique term of the sequence that is greater than both the term immediately preceding it and the term immediately following it.

b) Show that if \({a_i} < {a_i} + 1\) where \(1 \le i < n\), then \(i + 1 \le m \le n\).

c) Show that if \({a_i} > {a_{i + 1}}\) where \(1 \le i < n\), then \(1 \le m \le i\).

d) Develop a divide-and-conquer algorithm for locating the index \(m\). (Hint: Suppose that \(i < m < j\). Use parts (a), (b), and (c) to determine whether \(((i + j)/2) + 1 \le m \le n,\) \(1 \le m \le ((i + j)/2) - 1,\) or \(m = ((i + j)/2)\)

Use generating functions to find an explicit formula for the Fibonacci numbers.

Give a combinatorial interpretation of the coefficient of x4 in the expansion 1+x+x2+x3+3. Use this interpretation to find this number.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free