Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
A set of n = 32761 pigeons flies home, each to one of m= 15 large pigeonhole communities. What is the smalles number of pigeons possible in the pigeonhole that contains the most number of pigeons? Give an exact integer. No credit for being close (that indicates a misunderstanding of the concept). Hint 1: In other words, determine the largest integer k such that n > km. Then, if you were distribute only km o the n pigeons evenly among the m pigeonholes, there would be k pigeons in each hole with some (fewer than m pigeons left over. After assigning any remaining pigeon(s), you are forced to have a pigeonhole with at least k + 1 pigeons, which is the smallest number of pigeons in the hole with the most pigeons. It may be helpful to draw a picture for small n and m as we did in class. Hint 2: The largest integer k such that n > km is equivalently the largest integer k such that > k. Since an even distribution among the m holes is impossible in this case (i.e., will not be an integer), this k is precisely [J. See the earlier question regarding the floor function.

A set of n = 32761 pigeons flies home, each to one of m= 15 large pigeonhole communities. What is the smalles number of pigeons possible in the pigeonhole that contains the most number of pigeons? Give an exact integer. No credit for being close (that indicates a misunderstanding of the concept). Hint 1: In other words, determine the largest integer k such that n > km. Then, if you were distribute only km o the n pigeons evenly among the m pigeonholes, there would be k pigeons in each hole with some (fewer than m pigeons left over. After assigning any remaining pigeon(s), you are forced to have a pigeonhole with at least k + 1 pigeons, which is the smallest number of pigeons in the hole with the most pigeons. It may be helpful to draw a picture for small n and m as we did in class. Hint 2: The largest integer k such that n > km is equivalently the largest integer k such that > k. Since an even distribution among the m holes is impossible in this case (i.e., will not be an integer), this k is precisely [J. See the earlier question regarding the floor function.

Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter1: Fundamental Concepts Of Algebra
Section1.2: Exponents And Radicals
Problem 90E
See similar textbooks
icon
Related questions
Question

make sure you are inputting your answers in the requested format.

A set of n = 32761 pigeons flies home, each to one of m= 15 large pigeonhole communities. What is the smallest number of pigeons possible in the pigeonhole that contains the most number of pigeons? Give an exact integer. No credit for being close (that indicates a misunderstanding of the concept). Hint 1: In other words, determine the largest integer k such that n > km. Then, if you were distribute only km of the n pigeons evenly among the m pigeonholes, there would be k pigeons in each hole with some (fewer than m) pigeons left over. After assigning any remaining pigeon(s), you are forced to have a pigeonhole with at least k + 1 pigeons, which is the smallest number of pigeons in the hole with the most pigeons. It may be helpful to draw a picture for small n and m as we did in class. Hint 2: The largest integer k such that n > km is equivalently the largest integer k such that > k. Since an even distribution among the m holes is impossible in this case (i.e., will not be an integer), this k is precisely [J. See the earlier question regarding the floor function.
Transcribed Image Text:A set of n = 32761 pigeons flies home, each to one of m= 15 large pigeonhole communities. What is the smallest number of pigeons possible in the pigeonhole that contains the most number of pigeons? Give an exact integer. No credit for being close (that indicates a misunderstanding of the concept). Hint 1: In other words, determine the largest integer k such that n > km. Then, if you were distribute only km of the n pigeons evenly among the m pigeonholes, there would be k pigeons in each hole with some (fewer than m) pigeons left over. After assigning any remaining pigeon(s), you are forced to have a pigeonhole with at least k + 1 pigeons, which is the smallest number of pigeons in the hole with the most pigeons. It may be helpful to draw a picture for small n and m as we did in class. Hint 2: The largest integer k such that n > km is equivalently the largest integer k such that > k. Since an even distribution among the m holes is impossible in this case (i.e., will not be an integer), this k is precisely [J. See the earlier question regarding the floor function.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra: Structure And Method, Book 1
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell
SEE MORE TEXTBOOKS