Concept explainers
Pigeonhole principle. Recall the Pigeonhole principle from the first section in Chapter 2. Restate this principle in terms of a correspondence. Suppose you try a method of assigning pigeons to holes and, after filling all the holes, some pigeons remain. If you remove the pigeons and try again, is there any hope of placing each pigeon in an individual hole the second time? Suppose you have an infinite number of pigeons and pigeonholes. Is it possible that a first attempt to give each pigeon an individual hole failed but a second attempt succeeded?
Want to see the full answer?
Check out a sample textbook solutionChapter 3 Solutions
The Heart of Mathematics: An Invitation to Effective Thinking
Additional Math Textbook Solutions
Finite Mathematics & Its Applications (12th Edition)
Excursions in Modern Mathematics (9th Edition)
Probability and Statistics for Engineers and Scientists
Mathematics All Around (6th Edition)
Using & Understanding Mathematics: A Quantitative Reasoning Approach (7th Edition)
Introductory Mathematics for Engineering Applications
- Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:CengageLinear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning
- College AlgebraAlgebraISBN:9781305115545Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage LearningAlgebra and Trigonometry (MindTap Course List)AlgebraISBN:9781305071742Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage Learning