Solve the following counting problems. In each case show the reasoning that led you
to the answer.
(a) A palindrome is a word that reads the same forwards and backwards. How many
seven-letter palindromes can be made from the English alphabet?
(b) How many bit strings of length 10 begin with three 0s or end with two 1s?
(c) How many bit strings of length 10 contain either five consecutive 0s or five consecutive
1s?
(d) How many truth tables are there for propositions with n variables?
(e) Suppose you have n beads, each of a different color, that you need to string into a
necklace? How many distinct necklaces can you make? (A necklace flipped over
remains the same and does not count as a distinct necklace.)
2007-11-18
13:34:32
·
2 answers
·
asked by
David
2
in
Science & Mathematics
➔ Mathematics