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 determine the number of different ways 12 identical action figures can be given to five children so that each child receives at most three action figures.

Short Answer

Expert verified

There are then 35 ways to give 12 action figures to each of the four children.

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

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

01

Use Generating Function:

Generating function for the sequence\({a_0},{a_1}, \ldots ,{a_k}, \ldots \)of real numbers is the infinite series

\(G(x) = {a_0} + {a_1}x + {a_2}{x^2} + \ldots + {a_k}{x^k} + \ldots = \sum\limits_{k = 0}^{ + \infty } {{a_k}} {x^k}\)

Extended binomial theorem

\({(1 + x)^u} = \sum\limits_{k = 0}^{ + \infty } {\left( {\begin{array}{*{20}{l}}u\\k\end{array}} \right)} {x^k}\)

Each child receives at most 3 action figures each, the series representing one child should then contain only terms with a power of at most 3:

\(1 + x + {x^2} + {x^3}\)

02

There are five children is given by:

\(\begin{array}{c}{\left( {1 + x + {x^2} + {x^3}} \right)^5} = {\left( {\sum\limits_{k = 0}^3 {{x^k}} } \right)^5}\\ &= {\left( {\frac{{1 - {x^4}}}{{1 - x}}} \right)^5}\\& = \frac{{{{\left( {1 - {x^4}} \right)}^5}}}{{{{(1 - x)}^5}}}\\ &= {\left( {1 + \left( { - {x^4}} \right)} \right)^5} \cdot {(1 + ( - x))^{ - 5}}\end{array}\)

By further simplification:

\(\begin{array}{} &= \sum\limits_{m = 0}^{ + \infty } {\left( {\begin{array}{{}{}}5\\m\end{array}} \right)} {\left( { - {x^4}} \right)^m} \cdot \sum\limits_{k = 0}^{ + \infty } {\left( {\begin{array}{{}{}}{ - 5}\\k\end{array}} \right)} {( - x)^k}\\ &= \sum\limits_{m = 0}^{ + \infty } {\left( {\begin{array}{{}{}}5\\m\end{array}} \right)} {( - 1)^m}{x^{4m}} \cdot \sum\limits_{k = 0}^{ + \infty } {\left( {\begin{array}{{}{}}{ - 5}\\k\end{array}} \right)} {( - 1)^k}{x^k}\;\;\;\;\;\\ &= \sum\limits_{m = 0}^{ + \infty } {{b_m}} {x^{4m}} \cdot \sum\limits_{k = 0}^{ + \infty } {{c_k}} {x^k}\end{array}\)

{Let \({b_m} = \left( {\begin{array}{{}{}}5\\m\end{array}} \right){( - 1)^m}\) and\({c_k} = \left( {\begin{array}{{}{}}{ - 5}\\k\end{array}} \right){( - 1)^k}\)}

03

The coefficient of \({x^{12}}\) which is obtained if \(4m + k = 12\)

Since \(m\) and \(k\) are non-negative:

\(\begin{array}{c}m = 0,k = 12{\rm{ }}\\{\rm{or }}m = 1,k = 8{\rm{ }}\\{\rm{or }}m = 2,k = 4{\rm{ }}\\{\rm{or }}m = 3,k = 0\end{array}\)

The coefficient of \({x^{12}}\) is then the sum of the coefficients for each possible combination of \(m\) and\(k\):

\(\begin{aligned}{}{a_{12}} = {b_0}{c_{12}} + {b_1}{c_8} + {b_2}{c_4} + {b_3}{c_0}\\ = \left( {\begin{aligned}{{}{}}5\\0\end{aligned}} \right){( - 1)^0}\left( {\begin{aligned}{{}{}}{ - 5}\\{12}\end{aligned}} \right){( - 1)^{12}} + \left( {\begin{aligned}{{}{}}5\\1\end{aligned}} \right){( - 1)^1}\left( {\begin{aligned}{{}{}}{ - 5}\\8\end{aligned}} \right){( - 1)^8}\\ + \left( {\begin{aligned}{{}{}}5\\2\end{aligned}} \right){( - 1)^2}\left( {\begin{aligned}{{}{}}{ - 5}\\4\end{aligned}} \right){( - 1)^4} + \left( {\begin{aligned}{{}{}}5\\3\end{aligned}} \right){( - 1)^1}\left( {\begin{aligned}{{}{}}{ - 5}\\0\end{aligned}} \right){( - 1)^0}\\ = 1820 - 2475 + 700 - 10\\ = 35\end{aligned}\)

Thus, there are then 35 ways to give 12 action figures to each of four children such that each child receives at most 3 action figures.

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

Suppose that c1,c2,โ€ฆ,cpis a longest common subsequence of the sequences a1,a2,โ€ฆ,amandb1,b2,โ€ฆ,bn.
a) Show that if am=bn, then cp=am=bnand c1,c2,โ€ฆ,cp-1is a longest common subsequence of a1,a2,โ€ฆ,am-1and b1,b2,โ€ฆ,bn-1 when p>1.
b) Suppose that amโ‰ bn. Show that if cpโ‰ am, then c1,c2,โ€ฆ,cpis a longest common subsequence of a1,a2,โ€ฆ,am-1and b1,b2,โ€ฆ,bnand also show that if cpโ‰ bn, then c1,c2,โ€ฆ,cpis a longest common subsequence of a1,a2,โ€ฆ,amandb1,b2,โ€ฆ,bn-1

Find a closed form for the generating function for each of these sequences. (Assume a general form for the terms of the sequence, using the most obvious choice of such a sequence.)

a) \( - 1, - 1, - 1, - 1, - 1, - 1, - 1,0,0,0,0,0,0, \ldots \)

b) \(1,3,9,27,81,243,729, \ldots \)

c) \(0,0,3, - 3,3, - 3,3, - 3, \ldots \)

d) \(1,2,1,1,1,1,1,1,1, \ldots \)

e) \(\left( {\begin{array}{*{20}{l}}7\\0\end{array}} \right),2\left( {\begin{array}{*{20}{l}}7\\1\end{array}} \right),{2^2}\left( {\begin{array}{*{20}{l}}7\\2\end{array}} \right), \ldots ,{2^7}\left( {\begin{array}{*{20}{l}}7\\7\end{array}} \right),0,0,0,0, \ldots \)

f) \( - 3,3, - 3,3, - 3,3, \ldots \)

g) \(0,1, - 2,4, - 8,16, - 32,64, \ldots \)

h) \(1,0,1,0,1,0,1,0, \ldots \)

Use generating functions to solve the recurrence relation ak=3ak-1+2with the initial conditiona0=1.

Find the generating function for the finite sequence2,2,2,2,2 .

Give a big- Oestimate for the function fin Exercise34iffis an increasing function.

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