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

Find the least number of cables required to connect 100 computers to 20 printers to guarantee that 2 every subset of 20 computers can directly access 20 different printers. (Here, the assumptions about cables and computers are the same as in Example 9.) Justify your answer.

Short Answer

Expert verified

The resultant answer is 1620 cables.

Step by step solution

01

Given data

There are 100 computers and 20 printers, are the given expression.

02

Concept of Pigeonhole principle

If the number of pigeons exceeds the number of pigeonholes, at least one hole will hold at least two pigeons, according to the pigeon hole principle.

03

Simplify the expression

It is required to connect 100 computers to 20 printers and be sure that in every group of twenty computers, all printers can be accessed.

Note that it is not required for every computer of every group of twenty computers to necessarily have access to one or more printers.

First connect 80 of the computers to all 20 printers. This will require \(80 \cdot 20 = 1600\) cables.

Now there is only one group of twenty computers that has no access to the printers.

Take one of them and connect to all the printers, which will require further \(20 \cdot 1 = 20\) cables.

Thus, \(1600 + 20 = 1620\) cables in total are needed.

Hence, the resultant answer is 1620 cables.

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

A group contains n men and n women. How many ways are there to arrange these people in a row if the men and women alternate?

a) How many ways are there to deal hands of five cards to six players from a standard 52-card deck?

b) How many ways are there to distribute n distinguishable objects into kdistinguishable boxes so thatniobjects are placed in box i?

The row of Pascal's triangle containing the binomial coefficients, is:

(10k),0โ‰คkโ‰ค10, is:

1โ€…โ€…โ€…โ€…10โ€…โ€…โ€…โ€…45โ€…โ€…โ€…โ€…120โ€…โ€…โ€…โ€…210โ€…โ€…โ€…โ€…252โ€…โ€…โ€…โ€…210โ€…โ€…โ€…โ€…120โ€…โ€…โ€…โ€…45โ€…โ€…โ€…โ€…10โ€…โ€…โ€…โ€…1

Use Pascalโ€™s identity to produce the row immediately following

this row in Pascalโ€™s triangle.

a) Derive a formula for the number of permutations ofobjects of k different types, where there aren1 indistinguishable objects of type one,n2 indistinguishable objects of type two,..., andnk indistinguishable objects of type k.

b) How many ways are there to order the letters of the word INDISCREETNESS?

a) Explain how to find a formula for the number of ways to select robjects from nobjects when repetition is allowed and order does not matter.

b) How many ways are there to select a dozen objects from among objects of five different types if objects of the same type are indistinguishable?

c) How many ways are there to select a dozen objects from these five different types if there must be at least three objects of the first type?

d) How many ways are there to select a dozen objects from these five different types if there cannot be more than four objects of the first type?

e) How many ways are there to select a dozen objects from these five different types if there must be at least two objects of the first type, but no more than three objects of the second type?

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