College Algebra & Trigonometry, 2018a

7.4. GENERAL COMBINATORICS PROBLEMS 325
25) Find the number of ways of picking each of the following from a standard
deck of cards.
a) a king and a queen
b) a king or a queen
c) a king and a red card
d) a king or a red card
26) There are three bridges connecting two towns A and B. Between towns B
and C there are four bridges. A salesperson needs to travel from A to C via B.
Find:
a) the number of possible choices of bridges from A to C
b) the number of choices for a round trip from A to C and back to A
twice
c) the number of choices for a round trip if no bridge may be crossed
27) A sequence of digits in which each digit is 0 or 1 is called binary number.
Eight digit binary numbers are often referred to as “bytes.”
a) How many bytes are possible?
b) How many bytes begin with 10 and end with 01?
c) How many bytes begin with 10 but do not end with 01?
d) How many bytes begin with 10 or end with 01?