challset6sol

# challset6sol - Pigeon hole principle 1 3| At least n 1...

This preview shows pages 1–7. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Pigeon hole principle 1_ 3|! At least n+1 people are needed since we could take the n wives and have no married couple. The pigeonhole principle will show that n+1 will do. Assign to each person the set {person, person’s spouse}. For example, if Janet is married to Jim, both Janet and Jim are assigned the set {Janet Jim}. Now there are n such sets (i.e. pigeon holes). If we have n+1 pigeons and n pigeon holes, then at least one pigeon hole contains two pigeons. So at least one married couple is contained in any subset of n+1 people from the set of 11 married couples. If we tried to select n+1 people from a set ofn married couples without selecting a married couple then aﬁer we have selected the nth person we would have nobody left to choose from since after we select one person, the person’s spouse can’t be selected next. 2. If not then each person at the party has a different number of friends. No person can have more than 19 friends ( we will say that no person is a friend of him or herself). For each j = 0,1,2,...,l9 there exists a person who has j number of friends. However the person who has 19 friends is a friend of everybody at the party and hence a friend of the person who has no friends. This is a contradiction and there must be two people who have the same number of friends. Let the pigeon holes represent the number of wins that could have occurred for any one of the n players involved in the tournament. Since no player loses all the matches. there can only be n-l of these holes. Call the pigeons the n players that have participated in the tournament. If we distribute n pigeons into n-l holes then there must be a hole that has two pigeons in it. Therefore there must be two players who won the same number of games. l9 4.* First, any number smaller than 51 will not do since I can select 10 French books, 8 German books, 11 Russian books, 11 Spanish books and 11 Italian books and still not have 12 copies of a book in one language. This represents the worst case scenario. 52 books is the minimum required because if we select one more book then we will have 12 books of the same language. 5. Let each of the people at the party be represented by a vertex in a graph. If two people know each other, then we draw an edge between them. Now suppose that each person has 5 or more acquaintances at the party. We have a graph with each vertex having a degree of at least five. The sum of all the degrees of the vertices of this graph will be at least 100. From theorem 1 in section 1.3, twice the number of edges in the graph will be at least 100 as well. This means that the number of edges must be at least 50. This contradicts the fact that there are only 48 different pairs of people who know each other. Hence there must be at least one person with four or fewer acquaintances. 6.* The professor would need a set of at least 6 jokes since C(6,3)=20 and C(5,3)=10<12. If the professors set of jokes is less than 6, then there are fewer than 10 triples of jokes available to tell to the class. If each triple of jokes represent the pigeon holes and the years represent the pigeons, then by the pigeonhole principle there must be a year in which the same triple of jokes was told. 7. Look at the last digit of each number. If two numbers have the same last digit then their difference will contain 0 as the last digit. Any number with 0 as the last digit is divisible by 10. If the last digit of all seven numbers are ditferent then one pair of them must add to 10. The reason for this is that if we select seven distinct digits from 0,1,2,3,4,5,6,7,8,9 then at least one pair of them will add to 10. To prove this, look at all the pairs of digits which add up to 10, Le. {l,9},{2,8},{3,7}, {4,6}. Ifwe select 0, and 5 as part ofour 10. The key to this problem is to realize that every even integer can be written in the form 2iki where k, is an odd integer. All this means is that you can take any even number and divide it by a power of 2 and always get a odd quotient. For example divide 8 by 23 and we get 1 as the quotient and 0 as the remainder, i.e. 8=23x1+0( quotient l and remainder is 0). ‘ Now any set of 8 integers will have 8 odd numbers expressed either with a 21 or on its own. Since there only seven odd numbers in the set {1,2, . . . , 14}, an application of the pigeonhole principle tells us that two of these odd numbers must be the same and one of these two numbers will divide the other. 11. Suppose that in a subset of n integers between 2 and 2n (excluding 2 and Zn), every pair of integers has a common divisor between them. There are C(n,2)= n(n-1)/2 pairs of integers in a subset of n integers. The potential divisors for these pair of integers are 2,3,. . .,n. Call these n-l potential divisors the pigeonholes and the C(n,2) pairs of integers, the pigeons. Since C(n,2)=n/2 x(n-1), it follows from the pigeonhole principle, that one of the holes has at least n/2 pairs of integers in it. This means that there are n numbers that have 2 or 3 or... n as a common divisor. The common divisor could not be larger than 2 otherwise one of the numbers would exceed 2n. This means that 2 must be the common divisor and our subset of 11 numbers must be 2,4,...,2n. However, we only have n-2 even integers available. We arrive at a contradiction and we are forced to conclude that there must be a pair of integers which have no common divisor. 12. Let the numbers be a1,a2,. . .,a16 such that 15 a1 3 a2 3.5 a16 and a1+ag+. . . +a16=30. Let a16=15—k where k=0,1,. . . ,13. This implies that a.,+a2+...+al5=15+k. There must be at least 15-k 1’s in a1,a2,...a15. Hence a1=a2=...=a,5_k=l and a15-k+1+. ..+a15=2k. We have a subset which sums to 1,2,. ..,15-k and 29,28,...,15+k. Any number between lS—k and 15+k can be seven digits, then we are selecting the remaining ﬁve numbers from the digits where we have 4 pairs which add up to 10. From the pigeonhole principle we must select one of these pairs. If 0 is selected and 5 is not, then we are selecting 6 digits from the remaining digits in which 4 pairs add up to 10. Another application of the pigeonhole principle tells us that we must select a pair that adds up to 10. Same argument if 5 is selected and 0 is not. If 5 and 0 are not selected then we are selecting 7 digits from the digits where we have 4 pairs adding up to 10. From above we found 5 to be sufﬁcient for a selection of a pair that adds up to 10. So seven is more than enough. Getting back to our problem, we now know that there are two numbers that have a last digit ofO when we add them. That number will be divisible by 10. 8. Consider any arrangement of the digits 1,2,. . . , 10 on a circle. These digits occupy 10 positions. Relabel each position with the sum of the three integers centered around it. For example, If we have the arrangement, we replace each digit with the sum of the three digits centered around it. Replace l with 2+1+3=6. Replace 2 with 4+2+1=7, and so on. These sums will be our new labels. The sum ofthese labels is 3*(1+2+...+10)=165. By the pigeonhole principle, one of these labels must be an integer which exceeds 165/10 = 16.5. 9. Let the pigeons represent the 99 hours and let the pigeon holes represent the consecutive days, day 1—2, day 3-4, day 5-6, day 7-8, day 9-10, and day 11- 12. We have six pigeon holes because there are six pairs of consecutive days. Since 99=16x6 + 3, it follows from the pigeonhole principle that there must be pigeonhole with at least 17 pigeons in it. This pigeonhole will be the pair of consecutive days where the computer was used at least 17 hours. obtained by summing up lS-j 1’s and adding 2k to it from the subset that sums to 2k. For example 16-k is obtained by adding up 14-k 1’s with the subset summing to 2k. Hence there is a subset summing up to any integer from 1 to 29. 13.* Denote the printers Pj , j=l,2,..,10 and the computers Ci , i=1,2,...,15. In the following 15 x 10 matrix, an ijth entry of 1 means that computer Ci is connected to printer Pj. To ensure that any printing job can be accommodated, connect the ﬁrst printer to the ﬁrst six computers, then connect the second printer to the next six computers, and onward in this manner. C1 1 0 0 O 0 0 0 0 0 0 C2 1 1 0 0 O O 0 0 O 0 C3 1 1 1 0 0 0 0 0 0 0 C4 1 1 1 1 0 0 0 0 0 0 C5 1 1 l l 1 0 0 0 0 0 C5 1 1 1 l 1 1 0 0 0 0 C7 0 1 1 1 l l l 0 0 0 C3 0 0 1 1 1 1 l 1 0 0 C9 0 0 0 l l l l l 1 0 C10 0 0 0 0 l 1 l 1 1 1 C11 0 0 0 0 0 1 1 l l 1 C12 0 0 0 0 0 0 l l l 1 C13 0 0 0 0 0 0 O 1 1 1 0 0 O 0 0 0 0 0 1 1 0 O 0 0 0 0 0 0 0 1 There need to at least 24 connections. If not then one of the dummy printers, would be connected to at most 5 of the real printers. If each of the six computers calls upon this dummy printer, it couldn’t accommodate all the printing jobs. 15. Suppose one disk is smaller than the other, but they have an equal number of sectors. Both disks have 10 0’s and 10 1’5 on them. If the larger disk is ﬁxed in place, then there are 20 possible positions for the small disk such that each sector of the small disk is contained in a sector of the large disk. We ﬁrst count the total number of digit matches over all of the 20 possible positions of the disks. Since the large disk has 20 sectors with 10 0’3 and 10 1’3, each sector of the small disk will match digits in exactly 10 out of the 20 possible positions. Thus the total number of digit matches over all the possible positions equals the number of sectors of the smaller disk multiplied by 10, and this equals 200. Therefore the average number of digit matches per position is 200/20=10. By the pigeon hole principle there must be some position with at least 10 digit matches. 16. Let a1 be the number of games played on the ﬁrst day, a2 be the number of games played on the ﬁrst and second days, a3 the number of games played on the ﬁrst, second, and third days, and so on. The sequence of numbers al,a2,. . .a49 is a strictly increasing sequence since at least one game is played on each day. Moreover, a1 2 1 and the student never studies more than 11 hours in any one week, a49 g llx7=77. Hence we have ls a1<a2<. . . <a49g 77. The sequence a1+20, a2+20,. . .,a49+20 is also a strictly increasing sequence and 21 s a1+20<a2+20<a3+20<. . . <a49+205 97. Thus each of the 98 numbers a1,a2,. . .,a49, a1+20,a2+20,. . . ,a49+20 is an integer between 1 and 97. Since no two of the numbers abazmaw are equal and no two of the numbers a1+20, az+20, . . . ,a49+20 are equal, it follows from the pigeon hole principle that there must be and j and a k such that aj=ak+20. Therefore on days k+l, k+2,. . . ,j the student studied a total of 20 hours. 17. Let a1_ a2, ..., an2+1 be the sequence of n2+1 real numbers. We prove this as follows. We suppose there is no increasing subsequence of length n+1 and Show that there must be a decreasing subsequence of length n+1. For each k=1,2,. . . ,n2+1, let mk be the length of the longest increasing subsequence which begins at ak. Suppose mk g n for each k=1,2,. . .,n2+1, so that there is no increasing subsequence of length n+1. Since mk 21 for each k=1,2,...,n2+1, the numbers m1,m2,...,mn2+1 are n2+1 integers between 1 and n. Since n2+1 = n(n)+1, it follows from the pigeon hole principle that n+1 of the numbers m1,m2,...,m 2 are equal. Let n +1 m = m =...= m where k1 k2 kn+1 ls kl < k2 <...< kn+1 _<_ n2 +1. Suppose that for some i = 1,2,...,n, aki < akiﬂ. Then since ki < ki+1 we could take a longest increasing subsequence beginning with ak and i+1 put ak. in front to obtain an increasing subsequence starting with ak . This implies that 1 1 mk > Ink , but from above we know that they are equal. Hence we are forced to 1 1+1 conclude that :1k 2 21k . Since this is true for each i = 1,2,...,n., we have that i i+l a 2 a 2...2 a Z a , thus a ,a ,...,a is a decreasing subsequence of length n k1 k2 kn kn+1 kl k2 kn+1 18. We will prove that if there is no set of three mutual friends then there must be a set of three mutual strangers. It is sufﬁcient to prove this for a party of six people. Let {A,B,C,D,E,F} be a group of 6 people. Suppose that the people known to A are seated in room Y and the people not known to A are seated in room Z. A is not seated in either room so there are at least 3 people in either room Y or room Z. Suppose B,C,D are in room Y. If they are all mutual strangers then we are done. If not, then at least two of them know each other. Lets say B and C know each other. Now we have A, B, and C form a group of 3 mutual acquaintances. To complete our solution, suppose B,C,D are in room Z. If they are all mutual acquaintances , then we are done. If not then at least two of them don’t know each other. Lets say B and C don’t know each other. Now we have A, B and C form a group of 3 mutual strangers. ...
View Full Document

## This note was uploaded on 03/04/2012 for the course BIO 510 taught by Professor Miller during the Fall '06 term at Carnegie Mellon.

### Page1 / 7

challset6sol - Pigeon hole principle 1 3| At least n 1...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online