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

Letbe positive integers. Show that if \({n_1} + {n_2} + \cdots + {n_t} - t + 1\) objects are placed into \(t\) boxes, then for some \(i,i = 1,2, \ldots ,t\), the \(i\)-th box contains at least \({n_i}\) objects.

Short Answer

Expert verified

The resultant answer is the total no. of objects is at most \(\sum\limits_{i = 1}^t {\left( {{n_i} - } \right.} 1\)) \( < {n_1} + {n_2} + \ldots + {n_t} - t + 1\), a contradiction.

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

Given data

The given data is \({n_1},{n_2}, \ldots ,{n_t}\)which is a positive integer.

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

Contradict and simplify the expression

Suppose the \(i\)-th box contains less than \({n_i}\) objects \(\forall i = 1,2, \ldots ,t\). Thus, the total no. of objects is at most \(\sum\limits_{i = 1}^t {\left( {{n_i} - } \right.} 1\)) \( < {n_1} + {n_2} + \ldots + {n_t} - t + 1\), a contradiction.

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) How can the product rule be used to find the number of functions from a set with m elements to a set with n elements?

b) How many functions are there from a set with five elements to a set with 10 elements?

c) How can the product rule be used to find the number of one-to-one functions from a set with m elements to a set with n elements?

d) How many one-to-one functions are there from a set with five elements to a set with 10 elements?

e) How many onto functions are there from a set with five elements to a set with 10 elements?

Find the value of each of these quantities:

a) C (5,1)

b) C (5,3)

c) C (8,4)

d) C (8,8)

e) C (8,0)

f) C (12,6)

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

In this exercise we will count the number of paths in the\(xy\)plane between the origin \((0,0)\) and point\((m,n)\), where\(m\)and\(n\)are nonnegative integers, such that each path is made up of a series of steps, where each step is a move one unit to the right or a move one unit upward. (No moves to the left or downward are allowed.) Two such paths from\((0,0)\)to\((5,3)\)are illustrated here.

a) Show that each path of the type described can be represented by a bit string consisting of\(m\,\,0\)s and\(n\,\,1\)s, where a\(0\)represents a move one unit to the right and a\(1\)represents a move one unit upward.

b) Conclude from part (a) that there are \(\left( {\begin{array}{*{20}{c}}{m + n}\\n\end{array}} \right)\) paths of the desired type.

Find the expansion of(x+y)5

a) using combinatorial reasoning, as in Example 1.

b) using the binomial theorem.

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