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

In how many ways can a dozen books be placed on four distinguishable shelves

a) if the books are indistinguishable copies of the same title?

b) if no two books are the same, and the positions of the books on the shelves matter? (Hint: Break this into 12 tasks, placing each book separately. Start with the sequence 1, 2, 3, 4 to represent the shelves. Represent the books by bi , i = 1, 2, . . . , 12. Place b1 to the right of one of the terms in 1, 2, 3, 4. Then successively place b2, b3, . . . , and b12.)

Short Answer

Expert verified
  1. Therefore, there are \(455\)different ways
  2. Therefore, there are \(217945728000\) different ways if no two books are the same, and the positions of the books on the shelves matter

Step by step solution

01

Step 1: If books are indistinguishable copies of same title

There are four shelves with twelve indistinguishable books, so we use combination and repetition to get the number of ways we can order the books.

\(\begin{array}{l}C_{4 - 1}^{12 + 4 - 1} \to C_3^{15}\\C_r^n = \frac{{n!}}{{r!(n - r)!}} = \frac{{15!}}{{3!12!}}\\C_3^{15} = \frac{{2730}}{6} = 455\end{array}\)

Therefore, there are \(455\)different ways

02

Step 2: if no two books are the same, and the positions of the books on the shelves matter

There are four ways we can place book 1, five ways for book and since the order matters six ways for book 3 and fifteen ways for book 12.

Multiply those together to get the answer\(\begin{array}{l}4 \times 5 \times 6 \times 7 \times 8 \times 9 \times 10 \times 11 \times 12 \times 13 \times 14 \times 15\\ = 217945728000\end{array}\)

Therefore, there are \(217945728000\) different ways if no two books are the same, and the positions of the books on the shelves matter

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

7. How many ways are there to select three unordered elements from a set with five elements when repetition is allowed?

Explain how to prove Pascalโ€™s identity using a combinatorial argument.

Prove the identity\(\left( {\begin{array}{*{20}{l}}n\\r\end{array}} \right)\left( {\begin{array}{*{20}{l}}r\\k\end{array}} \right) = \left( {\begin{array}{*{20}{l}}n\\k\end{array}} \right)\left( {\begin{array}{*{20}{l}}{n - k}\\{r - k}\end{array}} \right)\), whenever\(n\),\(r\), and\(k\)are nonnegative integers with\(r \le n\)and\(k{\rm{ }} \le {\rm{ }}r\),

a) using a combinatorial argument.

b) using an argument based on the formula for the number of \(r\)-combinations of a set with\(n\)elements.

One hundred tickets, numbered \(1,2,3, \ldots ,100\), are sold to \(100\) different people for a drawing. Four different prizes are awarded, including a grand prize (a trip to Tahiti). How many ways are there to award the prizes if

a) there are no restrictions?

b) the person holding ticket \(47\) wins the grand prize?

c) the person holding ticket \(47\) wins one of the prizes?

d) the person holding ticket \(47\) does not win a prize?

e) the people holding tickets \(19\) and \(47\) both win prizes?

f) the people holding tickets \(19\;,\;47\)and \(73\) all win prizes?

g) the people holding tickets \(19\;,\;47\;,\;73\) and \(97\) all win prizes?

h) none of the people holding tickets \(19\;,\;47\;,\;73\) and \(97\) wins a prize?

i) the grand prize winner is a person holding ticket \(19\;,\;47\;,\;73\) or \(97\)?

j) the people holding tickets 19 and 47 win prizes, but the people holding tickets \(73\) and \(97\) do not win prizes?

What is the row of Pascal's triangle containing the binomial coefficients(9k),0โ‰คkโ‰ค9?

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