Problem Set: Fundamental Counting Principle, Factorials, Permutations

Solve the following problems. Show your complete solutions.

1) List all the permutations of the letters {M, A, T, H}.
2) Jedi wants to buy one pencil, one ballpen, one gel pen and one fountain pen
from a stationery shop. If there are 5 varieties of pencil, 12 varieties of ballpen
10 varieties of gel pen, and 15 varieties of fountain pens. In how many ways
can he select?
3) How many unique 5-digit codes can be created from 9 digits {1, 2, 3, 4, 5, 6,
7, 8, 9} if:
a) repetition is not allowed?
b) repetition is allowed?
4) In a primary election, there are four candidates for mayor, five candidates for
city treasurer, and two candidates for secretary. In how many ways may voters
mark their ballots
a) if they vote in all three of the races?
b) if they exercise their right not to vote on any or all of the races?
5) Six children are to be seated in a row on a bench.
a) How many arrangements are possible?
b) How many arrangements are possible if the youngest child must sit at the
left-hand end and the oldest child must sit at the right-hand end?
If two of the children are twins, in how many ways can the children be
arranged if:
c) the twins are together?
d) the twins are not together?
6) In how many ways can a president, vice-president, secretary, and treasurer
be chosen from a group of 40 students?
7) How many arrangements of the letters of the word FORMULAS are possible
if:
a) all letters are used in the arrangement?
b) the three vowels must come together in in the arrangement?
c) the three vowels must not all come together in the arrangement?
8) In how many ways can 8 differently colored beads be threaded on a string?
9) At a dinner party 5 men and 5 women sit at a round table. In how many
ways can they sit if:
a) there are no restrictions?
b) men and women alternate?
c) Dave and Sarah must sit together?
d) Dave, Sarah, and Matthew must sit together?
10) The word TRICHOTILLOMANIA which means unexplained compulsion to pull out
one’s own hair is a 16-letter words. Find the number of distinguishable permutations
that can be made.