MAT2612_2022

SOLUTIONS to REVIEW QUESTIONS: LESSON on CHAPTER 3

Question 1

 3  9  9.8
    3.  108
 2  2  2

Question 2
See example 3.1.1 in Study Guide. Answer: 12
Question 3
Three cases to consider:

 4
(i) 3B ' s and 1 other: choose 3 positions for the 3B ' s in    4 ways.
 3

3 choices for the remaining position.

Hence, in total 4 x 3 = 12 ways (using multiplication principle).
(ii) 2 B ' s and 2 other:

 4 4.3
  .3.2  .6  36 ways.
 2 2

(iii) 1B and 3 other:

 4
  .3.2.1  4.6  24 ways.
1
In total
12  36  24  72 words.

Question 4
Possibilities:
(i) b  g  b  g  b in 3 x 2 x 2 x 1 x 1 = 12 ways, or

(ii) b  g  b  b  g in 3 x 2 x 2 x 1 x 1 = 12 ways, or

(iii) g  b  b  g  b in 2 x 3 x 2 x 1 x 1 = 12 ways.

In total there are 12 + 12 + 12 = 36 ways.

Open Rubric
Question 5
6!
 6.5.4  120 (KBR Theorem 3.1.5).
3!

Question 6

B _____ ES , all letters distinct with exactly three vowels:

4 positions

 4
For the remaining 4 positions choose 2 positions for the remaining two vowels in   ways.
 2

The first of these can be filled in 4 ways and the second in 3 ways. In total 4 x 3 ways.
For the 2 non-vowel positions there are 19( 26  5  2) letters to choose from.

So, these 2 positions can be filled in 19.18 ways.

In total

 4
  .4.3.19.18
 2
4.3
 .4.3.2.9.19
2
 23.32.2.32.19
 24.34.19

Question 7

3S ' s, 2 A ' s,1B,1Y .

The 4-letter word can have:

(3 S ' s and 1 from { A, B, Y }) or (2 S ' s and 2 A ' s ) or (2 S ' s , 1 A and 1 other ( B or Y )) or

(2 S ' s , 0 A and 2 other) or (1 S , 2 A ' s and 1 other) or (1 S , 1 A and 2 other) or

(0 S , 2 A ' s and 2 other).
Therefore,
The number of 4-letter words that can be formed is

 4  4   4  2   4  4  3   4  3   4
  .3        .2    .2.1     .2     .2    .2.1
 3  2   2  1   2  1  2   1  1   2
 12  6  24  12  24  24  12
 114
2
Question 8
Consider the complement, that is, the 2 A ' s are adjacent. The number of such arrangements
5!
is
2!
6!
The number of arrangements without any restriction is .
2!2!
Hence, the number of arrangements with the A ' s non-adjacent is

6! 5! 5!  6 
    1  5.4.3(2)  120
2!2! 2! 2!  2 

Question 9
Partitions of X  {a, b, c, d} with a, b in the same block:

X ,{{a, b},{c},{d}},{{a, b, c},{d}},{{a, b, d},{c}},{{a, b},{c, d }}

So, the number of partitions = 5.

Question 10
The total number of possible outcomes = 6 x 6 = 36
The set of relatively prime (the GCD of the numbers is 1) outcomes:
A  {(1,1), (1, 2), (1,3), (1, 4), (1,5), (1, 6), (2,1), (2,3), (2,5), (3,1), (3, 2),
(3, 4), (3,5), (4,1), (4,3), (4,5), (5,1), (5, 2), (5,3), (5, 4), (5, 6), (6,1), (6,5)}

23
Hence, probability = .
36

Question 11
The number of ways to choose 6 light bulbs from 15 is C (15,6) .

Choose one defective in C (5,1) ways and then 5 from the 10 non-defective light bulbs in
C (10,5) ways. So, by the multiplication principle there are C (5,1) C (10,5) ways to choose
six light bulbs with exactly one defective.

3
Therefore, probability =
C (5,1)C (10,5)
C (15, 6)

Question 12

The possible sums are 2,3,...,9,10 . These can be obtained in 52 ways.

The primes between 2 and 10 are 2,3,5, 7 .

Now
2  11
3  1 2  2 1
5  1 4  4 1  2  3  3  2
7  25  5 2  3 4  43
So, there are 11 ways to get a sum that is a prime number between 2 and 10.
The probability is therefore,
11
.
25

Question 13
We have that
P( A  B)  P( A)  P( B)  P( A  B) (Theorem 3.4.3 in Study Guide)

P(( A  B)c )  3  P( A  B)  1  3  12
15 15 15
So,
P ( A  B )  P ( A)  P ( B )  P ( A  B )
6 8  12 2
15 15 15 15