College Mathematics for Business

Economics Life Sciences and Social

Sciences 13th Edition Barnett Solutions
Manual
Visit to download the full and correct content document: https://testbankdeal.com/dow
nload/college-mathematics-for-business-economics-life-sciences-and-social-sciences
-13th-edition-barnett-solutions-manual/
 EXERCISE 7-1 7-1

7 LOGIC, SETS, AND COUNTING

EXERCISE 7-1
2. 1, 2, 3, 4, 6, 8, 12, 24
4. 9, 18, 27, 36, 45
6. 11, 13, 17, 19
8. An odd integer has the form 2k +1. If 2k +1 and 2n +1 are odd integers, then
(2k  1)(2n  1)  4kn  2k  2n  1 which is odd.
10. Either 91 is prime or 91 is odd; true.
12. If 91 is prime, then 91 is odd; true.
14. If 91 is not odd, then 91 is not prime; true.

16. r  s: "29 + 28 + 27 > 987" and "9·102 + 8·10 + 7 = 987"; False

F T

18. ¬r: "29 + 28 + 27 is not greater than 987"; True

(r is False so ¬r is True)

20. s → r: "If 9·102 + 8·10 + 7 = 987, then 29 + 28 + 27 > 987"; False

T F

22. Conjunction, and is false. ( 3  0 is false.)

24. Negation: (3  0) . True.

26. Disjunction and false (9 is neither even nor is a prime number).

28. Conditional; False.

30. p: "Triangle ABC is isosceles"

q: "The base angles of triangle ABC are congruent."
It is given that p → q.
Converse: q → p: "If the base angles of triangle ABC are congruent, then triangle ABC is isosceles."
Contrapositive: ¬q → ¬p: "If the base angles of triangle ABC are not congruent, then triangle ABC is not
isosceles."

32. p: "g(x) is a quadratic function"

q: "g(x) is a function that is neither increasing nor decreasing"
It is given that p → q.
Converse: q → p: "If g(x) is a function that is neither increasing nor decreasing, then g(x) is a quadratic
function."
Contrapositive: ¬q → ¬p: "If g(x) is a function that is either increasing or decreasing, then g(x) is not a
quadratic function."

Copyright © 2015 Pearson Education, Inc.

7-2 CHAPTER 7 LOGIC, SETS, AND COUNTING

34. p: "n is an integer that is a multiple of 6"

q: "n is an integer that is a multiple of 2 and a multiple of 3"
It is given that p → q.
Converse: q → p: "If n is an integer that is a multiple of 2 and a multiple of 3, then n is an integer that is a
multiple of 6."
Contrapositive: ¬q → ¬p: "If n is an integer that is not a multiple of 2 or not a multiple of 3, then n is an
integer that is not a multiple of 6."

36. p q ¬q p  ¬q 38. p q ¬q p → ¬q
T T F T T T F F
T F T T T F T T
F T F F F T F T
F F T T F F T T
Contingency Contingency

40. p q p q q  (p  q) 42. p q p→q p  (p → q)

T T T T T T T T
T F F F T F F F
F T F T F T T F
F F F F F F T F
Contingency Contingency

44. p q p  q p → (p  q)
T T T T
T F T T
F T T T
F F F T
Tautology
46. p q p→q ¬q (p → q) → ¬q
T T T F F
T F F T T
F T T F F
F F T T T
Contingency
48. p q ¬p p q ¬p → (p  q)
T T F T T
T F F F T
F T T F F
F F T F F
Contingency

Copyright © 2015 Pearson Education, Inc.

 EXERCISE 7-1 7-3

50. p q ¬q p  ¬q q → (p  ¬q)
T T F T T
T F T T T
F T F F F
F F T T T
Contingency

52. p q ¬q p → ¬q p q (p → ¬q)  (p  q)
T T F F T F
T F T T F F
F T F T F F
F F T T F F

Contradiction

54. ¬p  p → q 56. p  q  p→q

p q ¬p p→q p q p q p→q
T T F T T T T T
T F F F T F F F
F T T T F T F T
F F T T F F F T

58. p q ¬p (p  ¬p) q
T T F F T
T F F F F
F T T F T
F F T F F

60. p q ¬p ¬p q q → (¬p  q) p q ¬(p  q)

T T F F F T F
T F F F T F T
F T T T T F T
F F T F T F T

Copyright © 2015 Pearson Education, Inc.

7-4 CHAPTER 7 LOGIC, SETS, AND COUNTING

p  (p → q) p q
62. p q p→q
T T T T T
T F F F F
F T T F F
F F T F F

64. p q p q p → (p  q) p→q
T T T T T
T F F F F
F T F T T
F F F T T

66. ¬p → q = ¬(¬p)  q By (4)

=p  q By (1)
68. ¬(¬p → ¬q) = ¬(q → p) By (7)
= ¬(¬q  p) By (4)
= ¬(¬q)  ¬p By (5)
=q  ¬p By (1)
70. No. The negation of a contradiction is true.
72. Yes. The statement “If 6 is divisible by 2, then 6 is divisible by 4” is false. However, its converse “If 6 is
divisible by 4, then 6 is divisible by 2” is true.

EXERCISE 7-2

2. No 4. Yes 6. Yes

8. T; In a set the order of listing elements is not important; set equality definition.

10. F; 1 is not an element of the set {10,11} 12. F; 0 is not an element of {6} .
14. T; Subset definition. 16. {1, 2, 4}  {4,8,16}  {1, 2, 4,8,16}
18. {1, 2, 4}  {4,8,16}  {4} 20. {3, 1}  {1,3}  
22. {3, 1}  {1,3}  {3, 1,1, 3} 24. {x | x 2  36}  {6, 6}

26. {x | x 4  16}  {2, 2}

28. {x |x is a month starting with M} = {March, May}
30. U = {7, 8, 9, 10, 11} and A = {7, 11}. Then A' = {8, 9, 10}.

Copyright © 2015 Pearson Education, Inc.

 EXERCISE 7-2 7-5

32. n ( A)  17  52  69 . 34. n ( A  B )  52
36. n(U )  100, n( B )  61, n( B ')  100  61  39 38. n( A  B ')  17
40. n[(A B ) ']  100  52  48 42. n( A ' B ')  n[( A  B ) ']  100  78  22
44. n( A  A ')  0
46. (A) {x |x  R and x  T} = R  T ("and" translated as  , intersection) = {1, 3, 4}  {2, 4, 6} = {4}
(B) R  T  {1,3, 4}  {2, 4,6}  {4}
48. Q  R = {2, 4, 6}  {3, 4, 5, 6} = {2, 3, 4, 5, 6}; P  (Q  R) = {1, 2, 3, 4}  {2, 3, 4, 5, 6} = {2,3,4}
50. T’ = {n  N | n ≥ 1,000} which is infinite.
52. H  T = {n  N | 100 < n < 1,000} which is finite.
54. H  T = N which is infinite.
56. P’ = {n  N | n is not prime} which is infinite.
58. (E  P)’ = {n  N | n is odd but not prime} which is infinite.
60. E and P are not disjoint since both contain number 2, which is even and prime.
62. E and E’ are disjoint since by definition of E’, E and E’ cannot have common elements.
64. False. Here is an example. Let A = {1, 2}, B = {1, 2, 3}. Then A  B, but A  B = {1, 2, 3} ≠ A = {1, 2}.

66. True. A  B = A can be represented by the Venn

B
diagram. From the Venn diagram, we see that A  B.
A

68. True. If A =  , then the set of all elements belonging to A and to any other set B will have no elements, i.e.
A  B= .
70. True. Since A  B , if x   A , which implies x  A ' , so B '  A .
 B , then x 
72. True. Let A be any set. Then A contains all the elements (none) of the empty set  . Therefore,   A for
any set A. In particular,    .
74. Let A = {a1, a2, …, an}, and let B  A. We like to find out how many subsets B exist.
For a1, we have a1  B or a1  B;
for a2, we have a2  B or a2  B;

for an, we have an  B or an  B.
Therefore, to count the number of subsets of A is the same as performing n operations each of which can be
performed in 2 ways. Thus, all n operations, one after the other, can be performed in 2n ways.
76. n ( S )  14  21  35 78. n ( B )  66  21  87

80. n( A  F )  19 82. n( B  S )  21

84. n ( A  F )  n ( A)  n ( F )  n ( A  F )  33  85  19  99

86. n( B  S )  n( B )  n( S )  n( B  S )  87  35  21  101

Copyright © 2015 Pearson Education, Inc.

7-6 CHAPTER 7 LOGIC, SETS, AND COUNTING

88. n( F  S )  n( F )  n( S ) since F  S  . n( F  S )  85  35  120

90. All subsets of {P, V1, V2, V3} that represent exactly 3 votes are
{P, V1}, {P, V2}, {P, V3}, {V1, V2, V3}.

92. From the given Venn diagram 94. From the given Venn diagram:
A  B = {AB - , A B + } A  B = {A - , A + , AB - , AB + , B - , B + }

96. From the given Venn diagram: 98. From the given Venn diagram:
(A  B  Rh)' = {O- } Rh'  A = {A- , AB- }

EXERCISE 7-3

2. 124  73  87  x, x  160  124, x  36 4. 7 x  51  45  x, 8 x  96, x  12

6. 12( x  5)  x  122  29, 12 x  60  x  93, 11x  33, x  3

8. (A) (B) Multiplication Principle

O1: 1st letter
N1: 3 letters
O2: 2nd letter
N2: 2 letters

Thus, there are N1·N2 = 3·2 = 6 words.

6 words

10. (A) Tree Diagram (B) Multiplication Principle

O1: 1st Coin
N1: 2 ways
O2: 2nd Coin
N2: 2 ways
O3: 3rd Coin
N3: 2 ways

Thus, there are

8 ways N1·N2·N3 = 2·2·2 = 8 ways

12. (A) Multiplication Principle (B) Addition Principle

O1: Selecting a history course N1 + N2 + N3 + N4 + N5 = 10 ways
N1: 2 ways
O2: Selecting a science course
N2: 3 ways
O3: Selecting a mathematics course
N3: 2 ways

Copyright © 2015 Pearson Education, Inc.

 EXERCISE 7-3 7-7

O4: Selecting a philosophy course

N4: 2 ways
O5: Selecting an English course
N5: 1 way
Thus, there are N1·N2·N3·N4·N5 = 2·3·2·2·1 = 24 ways

14.
No letter repeated: Letters repeated
O1 : select first letter; N1 : 7 ways O1 : select first letter; N1 : 7 ways
O2 : select second letter; N 2 : 6 ways O2 : select second letter; N 2 : 7 ways
O3 : select third letter; N 3 : 5 ways O3 : select third letter; N 3 : 7 ways
O4 : select fourth letter; N 4 : 4 ways O4 : select fourth letter; N 4 : 7 ways
Multiplication principle: N1 N 2 N 3 N 4  840 Multiplication principle: N1 N 2 N 3 N 4  2, 401

Adjacent letters different

O1 : select first letter; N1 : 7 ways
O2 : select second letter; N 2 : 6 ways
O3 : select third letter; N 3 : 6 ways
O4 : select fourth letter; N 4 : 6 ways
Multiplication principle: N1 N 2 N 3 N 4  1,512

16. Let A = set of "expensive" colleges,

B = set of "far from home" colleges.
Then n(A) = 6, n(B) = 7, n(A  B) = 2
(A) n(A'  B') = n(U) – n(A  B) = n(U) – [n(A) + n(B) – n(A  B)]
= 14 – [6 + 7 – 2] = 3
(B) O1: Selecting a college for the first two years
N1: n(A'  B') = 3 ways
O2 : Selecting a college after the first two years
N 2 : n(A'  B) = n(B) – n(A  B) = 7 – 2 = 5 ways
Multiplication Principle is now used to obtain N1 N 2  15 ways.

18. n( A  B )  15 is given.
A = (A  B')  (A  B), and so
n(A) = n(A  B') + n(A  B).
Thus, n(A  B') = n(A) – n(A  B) = 45 – 15 = 30.

B = (A'  B)  (A  B)
n(B) = n(A'  B) + n(A  B)
Thus, n(A'  B) = n(B) – n(A  B) = 35 – 15 = 20

n(A'  B') = n(U) – n(A  B) = 100 – (30 + 15 + 20) = 100 – 65 = 35

7-8 CHAPTER 7 LOGIC, SETS, AND COUNTING

20. n(A  B) = n(A) + n(B) – n(A  B)

120 = 70 + 90 – n(A  B)
Thus, n(A  B) = 40
n(A'  B') = n(U) – n(A  B) = 200 – 120 = 80
n(A  B') = n(A) – n(A  B) = 70 – 40 = 30
n(A'  B) = n(B) – n(A  B) = 90 – 40 = 50

22. n(A  B') = n(B') – n(A'  B') = n(B') – [n(A') + n(B') – n(A'  B')]
= n(A'  B') – n(A') = 95 – 35 = 60
n(A  B) = n(A) – n(A  B') = n(U) – n(A') – n(A  B')
= 120 – 35 – 60 = 25
n(A'  B) = n(B) – n(A  B) = n(U) – n(B') – n(A  B)
= 120 – 75 – 25 = 20
n(A'  B') = n(A') + n(B') – n(A'  B') = 35 + 75 – 95 = 15

24. n( A  B ')  n( A)  n( A  B )  57  36  21
n( A  B )  36
n ( A ' B )  n ( B )  n ( A  B )  0
n( A ' B ')  n (U )  n ( A  B )  180  21  36  123

26. n(A  B) = 35, n(A  B') = n(A) – n(A  B) = 55 – 35 = 20

n(A'  B) = n(B) – n(A  B) = 65 – 35 = 30
n(A  B) = n(A) + n(B) – n(A  B) = 55 + 65 – 35 = 85
n(A'  B') = n((A  B)') = n(U) – n(A  B) = 100 – 85 = 15

Therefore, A A ' Totals

B 35 30 65
B' 20 15 35
Totals 55 45 100

28. n(A  B) = n(A) + n(B) – n(A  B)

110 = 80 + 70 – n(A  B)
Thus, n(A  B) = 150 – 110 = 40
n(A'  B) = n(B) – n(A  B) = 70 – 40 = 30
n(A  B') = n(A) – n(A  B) = 80 – 40 = 40
n(A'  B') = n(U) – n(A  B) = 200 – 110 = 90

Therefore, A A' Totals

B 40 30 70
B' 40 90 130
Totals 80 120 200
 EXERCISE 7-3 7-9

30. n(A'  B) = n(A') – n(A'  B') = 81 – 63 = 18

n(A  B') = n(B') – n(A'  B') = 90 – 63 = 27
n(B) = n(U) – n(B') = 180 – 90 = 90
n(A  B) = n(B) – n(A'  B) = 90 – 18 = 72
Thus, A A ' Totals
B 72 18 90
B' 27 63 90
Totals 99 81 180

32. n(A  B) = n(A ) + n(B ) – n(A  B) = 175+125 – 300 = 0

A A' Totals
B 0 125 125
Thus,
B' 175 0 175
Totals 175 125 300

34. (A) False. If A and B are non-empty, disjoint sets, then n ( A  B )  0  n( A)  n ( B ).

(B) True. In general, n(A  B) = n(A) + n(B) – n(A  B).
If n(A  B) = n(A) + n(B), then n(A  B) = 0 and hence A and B are disjoint (no common element).

36. Using the Multiplication Principle:

O1: Choose bread O3: Choose vegetable
N1: 3 kinds N3: 2 kinds

O2: Choose meat

N2: 5 kinds

Thus, there are

N1·N2·N3 = 3·5·2 = 30 possible sandwiches.

38. Counting upper and lower case letters and ten digits, there are 62 possible choices for each of the five
characters. Therefore there is a total of 625  916,132,832 possible passwords

40. (A) Number of three-digit combinations, no digit repeated.

O1: Selecting the first digit O3: Selecting the third digit
N1: 10 ways N3: 8 ways

O2: Selecting the second digit

N2: 9 ways

Thus, there are

N1·N2·N3 = 10·9·8 = 720
possible combinations
7-10 CHAPTER 7 LOGIC, SETS, AND COUNTING

(B) Number of three-digit combinations, allowing repetition.

O1: Selecting the first digit O3: Selecting the third digit
N1: 10 ways N3: 10 ways

O2: Selecting the second digit

N2: 10 ways

Thus, there are

N1·N2·N3 = 10·10·10 = 103 = 1,000
possible combinations
(C) Number of three-digit combinations, if successive digits must be
different.
O1: Selecting the first digit O3: Selecting the third digit
N1: 10 ways N3: 9 ways
O2: Selecting the second digit
N2: 9 ways
Thus, there are
N1·N2·N3 = 10·9·9 = 10·92 = 810 possible combinations

42. (A) 5-digit ZIP code numbers.

O1: Selecting the first digit O4: Selecting the fourth digit
N1: 10 ways N4: 10 ways

O2: Selecting the second digit O5: Selecting the fifth digit
N2: 10 ways N5: 10 ways
O3: Selecting the third digit
N3: 10 ways
Thus, there are
N1·N2·N3·N4·N5 = 10·10·10·10·10 = 100,000
possible 5-digit ZIP code numbers.
(B) No repeated digits are allowed.
In this case, N1 = 10, N2 = 9, N3 = 8, N4 = 7, and N5 = 6.
Thus, there are N1·N2·N3·N4·N5 = 10·9·8·7·6 = 30,240 possible
5-digit ZIP code numbers with no repetitions.

44. In general n(A  B  C) = n(A) + n(B) + n(C) – n(A  B) – n(B  C) – n(A  C) + n(A  B  C).
If C  A  B, then n(A  B) = n(A  B  C) and hence n(A  B  C) = n(A) + n(B) + n(C) – n(B 
C) – n(A  C). Obviously, this includes the special case A  B =  .

46. If A and B are to be disjoint then they cannot have common elements and hence y must be 0.

48. If A  B = U, then (A  B)ꞌ =  (empty set) and hence w must be 0.

 EXERCISE 7-3 7-11

50. Let P = the number of students who play piano, and

G = the number of students who play guitar.
Then n(P) = 13, n(G) = 16, n(P  G) = 5 and n(U) = 30.
Note that
n(P  G) = n(P) + n(G) – n(P  G) = 13 + 16 – 5 = 29 – 5 = 24
n(P'  G') = n(U) – n(P  G) = 30 – 24 = 6.
52. Let O = the number of players who played offense last year, and
D = the number of players who played defense last year.
Then n(O) = 16, n(D) = 17, n(O'  D') = 12 and n(U) = 40.
n(O  D) = n(U) – n(O'  D') = 40 – 12 = 28
n(O  D) = n(O) + n(D) – n(O  D)
28= 16 + 17 – n(O  D)
Thus, n(O  D) = 33 – 28 = 5, i.e. 5 players from last year played both offense and defense.

54. O1: Selecting from plant A O2: Selecting from plant B

N1: 6 ways N2: 8 ways
Thus, there are N1·N2 = 6·8 = 48 possible ways to select a vice– president from each plant. If selection is
made without regard to plant, then for the first VP, there are 14 ways (6 + 8 = 14) and for the second VP,
there are 13 ways. Thus, 14·13 = 182 ways.

56. Here we have O1 = choose one of the four cities and N1= 4; 02 = choose one of the remaining three cities,
and N2 = 3; 03 = choose one of the two remaining cities and N3 = 2; and finally, O4 = choose the
remaining city and N 4 = 1. Then N1 N 2 N 3 N 4  4(3)(2)(1)  24.

58. Let V = the number of small businesses that own a video-conferencing system, and
P = the number of small businesses that own projection equipment.
Then n(V )  250, n( P )  420, n(V P )  180 , and n(U )  800.
(A) n(V  P )  n(V )  n( P )  n(V  P)  250  420  180  490 i.e. there are 490 small businesses that
own either a video-conferencing system, projection equipment, or both.
(B) n(V ' P ')  n(U )  n(V  P )  800  490  310
(C) n( P  V ')  n( P )  n( P V )  420  180  240

60. Let I = the number of customers who use high speed internet;
P = the number of customers who use digital phone.
Then n( I )  3, 770, n( P)  3, 250, n( I ' P ')  4,530 , and n(U )  10, 000 ,
First, n( I  P)  n(U )  n( I   P )  10, 000  4,530  5, 470
Then n( I  P )  n( I )  n( P )  n( I  P)
5, 470  3, 770  3, 250  n( I  P )
n( I  P )  1,550

Therefore, 1,550 customers use both high speed internet and digital phone.
7-12 CHAPTER 7 LOGIC, SETS, AND COUNTING

62. (A) 367,000 people

(B) 118 + 102 = 220, so 220,000 people
(C) Let A1 = number of workers age 20-24,
A2 = number of females below minimum wage
Then n(A1) = 644, n(A2) = 993, n(A1  A2) = 202. So, 202,000 people
Thus, n(A1  A2) = 644 + 993 – 202 = 1,435. So, 1,435,000 people
(D) Males at minimum wage = 734. So, 734,000 people.
Females at minimum wage = 1,056. So, 1,056,000 people.
Thus, workers at minimum wage = 734 + 1,056 = 1,790. So, 1,790,000 people.

64. (A) Tree Diagram (B) Multiplication Principle

O1: first child
N1: 2 ways
O2: second child
N2: 2 ways
O3: third child
N3: 2 ways
Thus, there are
N1·N2·N3 = 2·2·2 = 8 ways.

66. Let A = number of people who voted for him in his first election; and
B = number of people who voted for him in his second election.
Then n(A) = 12,457, n(B) = 15,322 and n(A  B) = 9,345.
Now, n(A  B) = n(A) + n(B) – n(A  B) = 12,457 + 15,322 – 9,345 = 18,434

EXERCISE 7-4

12  10  8 8765
2.  2 10  20 4.  7  2  5  70
642 4  3  2 1
11 10  9   3  2 1
6.  11  10  9  990 8. 10!  10·9·8·7·6·5·4·3·2·1  3, 628,800
8  7   3  2 1

10. (7  2) !  9 !  9·8·7·6·5·4·3·2·1  362,880 12. 7! 2!  5040  2  5042

10! 10·9·8·7·6(5!) 10! 10! 3, 628,800

14.   30, 240 16.    252
5! 5! 5!(10  5)! 5!5! (120)(120)

601! 601·600·599! 15! 15!

18.   360, 600 20. 15 C10    3,003
599! 599! 10!(15  10)! 10!5!

10! 10!
22. 10 P7    604,800
(10  7)! 3!

365 P25 365! 1 365! 1 365  364  363    342  341
24.       0.4313
365 25
(365  25)! 365 25
340! 36525
36525
 EXERCISE 7-4 7-13

 26!   26·25·24  23 

    26·25·24  23
C
26 4 4!22!   24
26.     0.0552
52 C4  52!   52·51·50  49  52·51·50  49
   
4!48!   24

(n  1)! (n  1)n(n  1)(n  2)! (n  1)n(n  1)

28.  
3!(n  2)! 6(n  2)! 6

(n  3)! (n  3)(n  2)(n  1)!

30.   (n  3)(n  2)
(n  1)! (n  1)!

32. Combination: the order of selection is not important.

34. Permutation: The order of selection of books--for his father, mother, younger sister, and older brother.

36. Neither.

38. The number of finishes (1st, 2nd, 3rd, 4th, 5th) of the 50 people is the number of permutations of 50 objects
5 at a time. This is:

50! 50! 50  49  48  47  46  45!

50 P5  = =
(50  5)! 45! 45!
= 50·49·48·47·46 = 2.5425 × 108

9! 9! 9  8  7  6!
40. (A) Permutation: 9 P3    = 504
(9  3)! 6! 6!
9! 9!
(B) Combination: 9 C3  = = 84
3!(9  3)! 3!6!
 9 P3 504 
 or 9C3  3!  6  84 

42. The factorial function x! grows much faster than exponential function 2x, which in turn grows much faster
than the square function x2.
(Check these 3 functions for x = 1, 2, …, 8 and see the growth.)

44. There are 13 club cards in a standard 52-card deck:

13!
6-card hands only clubs: 13 C6   1,716
6!(12  6)!

46. There are only 4 queens in a standard 52-card deck. Therefore there are 0 5-card hands consisting entirely
of queens.

13!
48. O1: Selecting 3 hearts from 13 hearts, N1  13C3   286
3! 10!
13!
O2: Selecting 4 diamonds from 13 diamonds: N 2  13C4   715
4! 9!
N1  N 2  286  715  204, 490
7-14 CHAPTER 7 LOGIC, SETS, AND COUNTING

50. O1: Selecting a suit from 4 suits, N1  4

13!
O2: Selecting 4 cards from 13 cards: N 2  13C4   715
4! 9!
N1  N 2  4  715  2,860

52. O1: Selecting a delegate and an alternate from the 1st department
N1: 12 P2
O2: Selecting a delegate and an alternate from the 2nd department
N2: 15 P2
O3: Selecting a delegate and an alternate from the 3rd department
N3: 18 P2

Thus, there are N1·N2·N3 = 12 P2 · 15 P2 · 18 P2 = 8,482,320 ways.

54. For r  1, r !  1, so n Pr  n Cr .

56. By definition, it is true that

n !  n(n  1)(n  2)    3  2

If n > 3, then n ≥ 22 and each of the remaining (n – 2) factors is ≥ 2. Therefore

n(n – 1)(n – 2) …  3  2 > 22  2
   2 = 22 · 2n-2 = 2n
2 
n  2 times

58. It is false. Take n = 3 and r = 2. Then

3! 6
n C r = 3C 2 = = = 3 and
2!(3  2)! 2
3! 6
n C r 1 = 3 C 3 = = =1
3!(3  3)! 6
Clearly 3 C 2 is not less than 3 C 3 .

60. It is false. Take n = 3, r = 2. Then

3! 6
n Pr = 3 P2 = = =6
(3  2)! 1
3! 6
n Pn  r = 3 P1 P3,1 = = =3
(3  1)! 2

62. (A) A line segment joins two distinct points. Thus, the total number of
line segments is given by:
5! 5! 5  4  3! 5  4
5C 2 =    = 10
2!(5  2)! 2!3! 2 1  3! 2 1

(B) Each triangle requires three distinct points. Thus, there are
5! 5!
5C 3 =  = 10 triangles.
3!(5  3)! 3!2!
 EXERCISE 7-4 7-15

7! 7!
64. 7 P3    210
(7  3)! 4!
9! 9!
66. (A) Combination: 9C 4 =  = 126
4!(9  4)! 4!5!
(B) Both Jim and Mary must be on the committee. Thus, we need to
choose 2 from the remaining 7 people,
7! 7!
i.e. 7 C 2 =  = 21
2!(7  2)! 2!5!
(C) Either Jim or Mary (but not both) must be on the committee.
The number of ways that Mary (but not Jim) will be on the committee is the number of combinations
of 7 (= 9 – 2, Mary and Jim) objects 3 at a time: 7 C 3 .
The number of ways that Jim (but not Mary) will be on the committee is 7 C 3 .
Thus, the number of ways we can choose a 4– person committee so that either Mary or Jim (but not
both) will be on the committee is
7! 7!
2 · 7C3 = 2 · =2· = 70
3!(7  3)! 3!4!

68. For many calculators k = 168, but for yours it may be different.

70. 17 C 8 = 17 C 9 = 24,310

30! 30!
72. (A) Combination: 30 C 4 =  = 27,405
4!(30  4)! 4!26!
(B) No defective calculators chosen: We need to choose the 4 calculators from the 30 – 6 = 24 non-
24! 24!
defective ones. The number of selections is 24 C 4 =  = 10,626
4!(24  4)! 4!20!

74. (A) There are 14 + 8 + 6 = 28 employees combined. The number of ways that 12 employees out of 28
can be laid off is the number of combinations of 28 objects 12 at a time,
28! 28!
28 C 12 =  = 30,421,755
12!(28  12)! 12!16!
(B) O1: Lay off 5 from the central office
N1: 14 C 5

O2: Lay off 4 from the north office

N2: 8C 4

O3: Lay off 3 from the south office

N3: 6C 3

Thus, there are

14! 8! 6!
14 C 5 · 8 C 4 · 6 C 3 = · ·
5!(14  5)! 4!(8  4)! 3!(6  3)!
= 2,802,800 ways
7-16 CHAPTER 7 LOGIC, SETS, AND COUNTING

76. (A) O1: Selecting 3 from A

N1: 15 C 3

O2: Selecting 1 from B

N2: 20 C 1

15! 20!
Thus, there are 15 C 3 · 20 C 1 = · = 9,100 ways.
3!(15  3)! 1!(20  1)!
(B) O1: Selecting 2 from A
N1: 15 C 2

O2: Selecting 2 from B

N2: 20 C 2

Thus, the number of selections is: 15 C 2 · 20 C 2 = 19,950

(C) All from A: 15 C 4 = 1,365

(D) 4 people regardless of department.

There are 15 + 20 = 35 and we need to select 4 out of 35.
The number of selections is: 35 C 4 = 52,360

(E) At least 3 from department A:

This means the number of ways that exactly 3 people can be chosen from A and 1 from B (case (A)
above) PLUS the number of ways that 4 people can be chosen from A (case (C) above). Thus, the
number of selections is: 9,100 + 1,365 = 10,465.
8!
78. Combination: 8 C 5 = = 56
5!(8  5)!

80. Permutation: 6 P6 = 6! = 720