Chapter 6: Q30E (page 433)
How many different strings can be made from the letters in MISSISSIPPI, using all the letters?
Short Answer
The total number of 34650 strings can be made from the letters MISSISSIPPI
Chapter 6: Q30E (page 433)
How many different strings can be made from the letters in MISSISSIPPI, using all the letters?
The total number of 34650 strings can be made from the letters MISSISSIPPI
All the tools & learning materials you need for study success - in one app.
Get started for freeOne hundred tickets, numbered \(1,2,3, \ldots ,100\), are sold to \(100\) different people for a drawing. Four different prizes are awarded, including a grand prize (a trip to Tahiti). How many ways are there to award the prizes if
a) there are no restrictions?
b) the person holding ticket \(47\) wins the grand prize?
c) the person holding ticket \(47\) wins one of the prizes?
d) the person holding ticket \(47\) does not win a prize?
e) the people holding tickets \(19\) and \(47\) both win prizes?
f) the people holding tickets \(19\;,\;47\)and \(73\) all win prizes?
g) the people holding tickets \(19\;,\;47\;,\;73\) and \(97\) all win prizes?
h) none of the people holding tickets \(19\;,\;47\;,\;73\) and \(97\) wins a prize?
i) the grand prize winner is a person holding ticket \(19\;,\;47\;,\;73\) or \(97\)?
j) the people holding tickets 19 and 47 win prizes, but the people holding tickets \(73\) and \(97\) do not win prizes?
Find the value of each of these quantities:
a) P (6,3)
b) P (6,5)
c) P (8,1))
d) P 8,5)
e) P (8,8)
f) P (10,9)
Show that for all positive integers nand all integers kwith .
13. A book publisher has 3000 copies of a discrete mathematics book. How many ways are there to store these books in their three warehouses if the copies of the book are indistinguishable?
How can you find the number of bit strings of length ten that either begin with 101 or end with 010 ?
What do you think about this solution?
We value your feedback to improve our textbook solutions.