AMS 301 - Homework 8 Solutions

8.1.10
If we have A be the set of arrangements that end with an 8 and B be the set of arrangements that begin with a 3, we are looking for N (A B ). By Inclusion/Exclusion, this is equal to N N (A) N (B ) + N (A B ), which works out to 10! 9! 9! + 8! = 10! 2 9! + 8!.

8.1.12
a. If A is the set of sequences that contain THE and B is the set of sequences that contain AID, we are looking for N (A B ) = N (A) + N (B ) N (A B ). Gluing letters together, tell us that N (A) = N (B ) = 24! and N (A B ) = 22!. Therefore, the answer is 2 24! 22!. b. If A is the set of sequences that contain THE and B is the set of sequences that contain MATH, we are looking for N (A B ) = N N (A) N (B ) + N (A B ). Gluing letters together (note that the sequences are not independent, THE and MATH share letters), we get that this is equal to 26! 24! 23! + 22!.

8.1.18
We have that 280 = 23 5 7, so a number is relatively prime to 280 if and only if it is not divisible by 2, 5, or 7. That is, if A is the numbers divisible by 2, B is the numbers divisible by 5, and C is the numbers divisible by 7, we are looking for N (A B C ). Using inclusion/exclusion, this works out to N N (A) N (B ) N (C )+ N (A B )+ N (A C )+ N (B C ) N (A B C ). Working this out, we 280 280 280 280 280 280 get 280 280 2 5 7 + 25 + 27 + 57 257 , which yields 280 140 56 40+28+20+8 4 = 96.

8.2.2
Let A1 be the set of rolls that contain a 1, A2 be the rolls that contain a 2, and so on. Then, the question translates to nding N (A1 A2 A3 A4 A5 A6 ). By inclusion/exclusion, this works out to N N (A1 ) N (A2 ) . . . (this sum has 26 = 64 terms, so dont try to write them all out). To gure out the value, we use symmetry. Note that because the numbers in each of these sets dont change if we permute the values on the dice, there is no dierence between N (A1 ) and N (A2 ), and similarly between all of the singles, doubles, triples, quadruples, and quintuples, respectively. That is, because of symmetry, this sum of 64 terms reduces to N C (6, 1)N (A1 ) + C (6, 2)N (A1 A2 ) C (6, 3)N (A1 A2 A3 ) + C (6, 4)N (A1 A2 A3 A4 ) C (6, 5)N (A1 A2 A3 A4 A5 ) + C (6, 6)N (A1 A2 A3 A4 A5 A6 ). Now, we know that N (A1 ) = 59 because it is the number of possible outcomes that do not contain a 1. Similarly, N (A1 A2 ) = 49 , and so on. Therefore, we have that the answer is 69 C (6, 1)59 + C (6, 2)49 C (6, 3)39 + C (6, 4)29 C (6, 5)19 + C (6, 6)09 .

8.2.30
Let A be the set of arrangements that have adjacent as, B be the arrangements that have adjacent bs and C be the arrangements that have adjacent cs. Then, were looking for N (A B C ). This is a standard inclusion/exclusion, so were looking for N N (A) N (B ) N (C ) + N (A B ) + N (A C ) + N (B C ) N (A B C ). Using symmetry, this breaks down to N 3N (A) + 3N (A B ) N (A B C ). To gure out N (A), we try to use the standard gluing idea. Take a pair of as and glue them 8! ways. Note that every arrangement together, then arrange the letters a, aa, b, b, b, c, c, c in 1!1!3!3! 1

that contains adjacent as is found by this approach, but there are some that are counted twice. For example a, aa, b, b, b, c, c, c and aa, a, b, b, b, c, c, c are considered dierent arrangements according to this gluing approach. This bad situation occurs exactly when aaa appears in the arrangement, so 8! 7! to x our count, we just need to subtract the triples. Therefore, N (A) = 1!1!3!3! 1!3!3! . Now for N (A B ). In a similar vein to N (A), we glue a pair of as and a pair of b together 7! ways. Just like before though, weve counted too and then arrange the remaining letters in 1!1!1!1!3! many arrangements. The arrangements we overcounted are exactly the ones with triple as or with 6! 6! 5! triple bs. Using inclusion/exclusion on this tells us that we overcounted by 1!1!1!3! + 1!1!1!3! 1!1!3! , 6! 5! 7! meaning that N (A B ) = 1!1!1!1!3! 2 1!1!1!3! + 1!1!3! . The last term N (A B C ) is computed identically, but with a three term inclusion/exclusion calculation. That is, glue a pair of as, bs, and cs together, respectively, and then arrange the 6! letters in 1!1!1!1!1!1! ways. Our overcounting is exactly the arrangements with triple as, triple 4! 3! 5! 3 1!1!1!1! + 1!1!1! . Therefore, bs, or triple cs. This means we overcount by exactly 3 1!1!1!1!1! 5! 4! 3! 6! N (A B C ) = 1!1!1!1!1!1! 3 1!1!1!1!1! + 3 1!1!1!1! 1!1!1! . Putting it all together, we get that the number of arrangement with no pair of adjacent as, bs, or cs, is 9! 8! 7! 3( ) 3!3!3! 1!1!3!3! 1!3!3! 7! 6! 5! +3( 2 + ) 1!1!1!1!3! 1!1!1!3! 1!1!3! 5! 4! 3! 6! 3 +3 ) ( 1!1!1!1!1!1! 1!1!1!1!1! 1!1!1!1! 1!1!1!

N (A B C ) =