PART 1 MODULE 1

INTRODUCTION

How To Use This Text

As you should know, Hacking Mathematics is available on the World Wide Web at
[Link]

The various modules of this printed version of the text all have a similar structure. First,
the course material is presented via examples and associated defining facts. Some of the
examples show detailed, worked-out solutions, while most do not. The detailed solutions
to these examples can be found in the web-page version of the text.

Toward the end of each module in the print version is a collection of practice exercises
for that module. If you wish to do well on quizzes and tests, you should try to do all of
these practice exercises, and you should ask your instructor for help with the exercises
that you cannot solve correctly.

After the practice exercises you will find "Answers to Linked Examples." This shows the
correct answers (but not detailed solutions) to the examples from the beginning part of
the module.

Finally, you will find the "Answers to Practice Exercises" for that module.

It is important that you understand that the web-page version of the text is much more
content-rich than this print version. For one thing, it contains links to detailed solutions
for ALL of the examples (but not for the practice exercises). If you are studying on your
own, you should find that the web-page version of the text is more helpful than the print
version (except that only the print version has the practice exercises).

Finally, throughout the text there are references to "the companion web site." The
companion web site for this text is [Link]

1
 HACKING MATHEMATICS PART 1

PART 1 MODULE 1
Set Mathematics
Sets, Elements, Subsets
Any collection of objects can be considered to be a set.
We can define particular sets by listing the objects in each set. It is conventional to use
set braces when doing so.
Examples of sets:
{a, b, c, d, e, f}
{4, 9, 2, 7}
{Larry, Moe, Curly}
{cat, dog}
{1, 2, 3, 4, 5, 6, 7, ...}
{the people in this room}

NAMES FOR SETS

We will typically use upper case letters for the names of sets.
Let
A = {a, b, c, d, e, f}
B = {4, 9, 2, 7}
C = {Larry, Moe, Curly}
D = {cat, dog}
N = {1, 2, 3, 4, 5, 6, 7, ...}
F = {the people in this room}

Note: the set {1, 2, 3, 4, 5, 6, 7, ...} is very familiar to mathematicians and students of
mathematics. It is usually called the set of natural numbers.

2
 PART 1 MODULE 1

ELEMENTS OR MEMBERS OF SETS

The contents of a set are called its elements or members.
We say "9 is an element of B"
"cat is an element of D"
Notation:
9B
cat  D

Likewise:
6 is not an element of B 6B
dog is not an element of A dog  A

The CARDINALITY of a set is the number of elements in the set.

In general the cardinality of a set S is denoted n(S).
For example, the cardinality of set B is 4.
Notation:
n(B) = 4
Likewise n(A) = 6
n(D) = 2
n(F) is _____
n(N) is infinity?

SET EQUALITY
In any area of mathematics, a key goal is to determine when two objects that may look
different from one another are actually the same object. In set mathematics, equality is
defined in terms of the contents of sets:
Two sets are said to be equal if they contain exactly the same elements.

Examples
{a, b, c} = {b, c, a}
{4, 2, 7, 9} = B

3
 HACKING MATHEMATICS PART 1

On the other hand:

{1, 2, 3, 4} B
{Larry, Moe} C

A formal definition of set equality is this:

Sets S and T are equal if every element of S is an element of T and every element of T is
an element of S.

SET-BUILDER NOTATION
is a formalistic way of describing the elements of a set without listing them all. It is
useful in some cases where a less formal description might be ambiguous. Here is an
example of set-builder notation:

EXAMPLE 1.1.1
F = {x|x is a person in this room}
We read this as follows:
"F is the set of all x such that x is a person in this room"

Notice that in set-builder notation the construction “{x|x...” is associated with the phrase
“the set of all x such that...” This phrase is then followed by a description or
characteristic that categorizes all the elements of the set. It has nothing to do with
whether to symbol “x” is one of the elements of the set.

More examples of set-builder notation:

N = {x|x is a positive integer}
"N is the set of all x such that x is a positive integer"
New set:
E = {x|x is a positive even number}
List the elements of E.

4
 PART 1 MODULE 1

SUBSETS
Let A = {a, b, c, d, e, f}
B = {4, 9, 2, 7}
C = {Larry, Moe, Curly}
D = {cat, dog}
E = {2, 4, 6, 8, 10, ...}
N = {1, 2, 3, 4, 5, 6, 7, ...}
F = {x|x is a person in this room}
G = {b, c, f}

Notice, for instance, that every element of G is also an element of A.

In a case like this we say "G is a subset of A"
Notation:
GA
Likewise,
BN

A formal definition of the word subset is this:

For sets S and T, S is a subset of T if every element of S is also an element of T.
This means that S is contained within T.

Example
{cat}  D
A  {a, b, c, d, e, f, g, h}
F{x|x is a person in this building}

Formally: S is not a subset of T if there is at least one element of S that is not an element
of T.

5
 HACKING MATHEMATICS PART 1

EXAMPLE 1.1.2
Referring to the sets listed earlier, determine whether each statement is true or false.
1. 7 B

2. n(A) = a

3. B  N

4. dog  D

5. {7}B

6. {6, 8, 10}  E

7. {6, 8, 10}{6, 8, 10}

Exercise #7 above illustrates a general fact about subsets:

Every set is a subset of itself.

6
 PART 1 MODULE 1

PROPER SUBSETS
If S is a subset of T but is not equal to T, we say that S is a proper subset of T.
Notation: S  T

Examples:
{2, 9}  B {1, 3, 5, 7, 9...}  N {dog, cat}  D

The last example illustrates this basic fact:

No set is a proper subset of itself.

COMPLEMENTS, THE UNIVERSAL SET, AND THE EMPTY SET

Consider the set S = {Moe, Larry}

Suppose we want to complete the following exercise:
List all of the elements that are NOT in S.

Are we supposed to list...

...the names of all film performers except Moe and Larry?
...the names of all stooges except Moe and Larry?
...every object on Earth except Moe and Larry?

Unless we establish some boundaries on the scope of this exercise, we cannot make sense
of it.

To establish a frame of reference for a set problem, we can define a universal set (U) for
the problem:
For any set problem or discussion, a universal set (U) is a "larger" set that contains all
of the elements that may be of interest in the discussion; in particular, the universal set at
least contains all of the elements of all of the sets in the discussion.

Returning to the example at hand:

Let U = {Moe, Larry, Curly, Shemp, Curly Joe}

Then to list the elements that are not in S, we list those elements of U that are not in S:
{Curly, Shemp, Curly Joe}

This set is called the complement of S, and is denoted S.

THE EMPTY SET

There is a unique set that contains no elements. It is called the empty set or the null set
or the void set.
The empty set is usually denoted with one of these symbols: { } or 

7
 HACKING MATHEMATICS PART 1

EXAMPLE 1.1.3
Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
X = {2, 4, 6, 8, 10}
W = {x|x is an odd number}
Y = {3}
True or false:
1. X = W

2. YW

3. YW

4. X  U

5. { }  X

Exercises #4 and #5 above illustrate the following:

FACT
In any set problem, every set is a subset of U, and { } is a subset of every set.

WORLD WIDE WEB NOTE

For practice on problems involving sets, elements, subsets and the empty set, visit the
companion website and try THE SETS APPEALER.

THE NUMBER OF SUBSETS IN A FINITE SET

General observation: It makes sense to assume that the more elements a set has, the more
subsets it will have.

For finite sets, there is a strict relationship between the cardinality of a set and the
number of subsets . We can discover this relationship by filling in the following table:

S n(S) Subsets of S Number of

subsets
{}
{a}
{a,b}
{a, b, c}
{a, b, c, d}

{a, b, c, d, e}

8
 PART 1 MODULE 1

The completed table above suggests the following general fact:

THE NUMBER OF SUBSETS IN A FINITE SET

If n(S) = k, then the number of subsets in S is 2k.

EXAMPLE 1.1.4.A
Let A = {a, b, c, d, e, f} How many subsets does A have?

SOLUTION
Since n(A) = 6, A has 26 subsets. That is, A has 64 subsets (26 = 64).

EXAMPLE 1.1.4.B
Referring to set A above, how many proper subsets does A have?

SOLUTION
We already know that A has 64 subsets. Of those 64 subsets, the only one that is not a
proper subset is set A itself (recall that while every set is a subset of itself, no set is a
proper subset of itself). Thus, A has 63 proper subsets. This example suggests the
following general fact:

For any finite set, the number of proper subsets is one less than the number of subsets.

EXAMPLE 1.1.5
Let U = {1, 2, 3, 4, 5, 6, 7,...}
Let S = {x|x is less than 10}

1. How many subsets does S have?

2. How many proper subsets does S have?

WORLD WIDE WEB NOTE

For exercises involving the number of subsets and the number of proper subsets, visit the
companion website and try THE SUBSETIZER.

9
 HACKING MATHEMATICS PART 1

PRACTICE EXERCISES

1 – 17: Decide whether each statement is true or false.

Let U = { 1, 2, 3, 4, 5, 6, 7 } S = {1, 2, 4, 7}
T = {1, 2, 4, 5, 6, 7} V = {4, 5, 6}

1. S  T 2. n(S) = 7 3. 4V 4. T  V 5. S  T
6. {2, 4, 6} = {x|x is an even number} 7. T  { } 8. 7 T
9. T has 36 subsets 10. V has 7 proper subsets 11. { }  V
12. V = {x|x > 3} 13. V = {1, 2,3} 14. {7, 4, 2, 1} = S
15. {1}  T 16. {1}  T 17. V  {5, 6}

ANSWERS TO LINKED EXAMPLES

EXAMPLE 1.1.2
1. True 2. False 3. True 4. False 5. False 6. True
7. True

EXAMPLE 1.1.3
1. True 2. True 3. True 4. True 5. True

EXAMPLE 1.1.5
1. 512 2. 511

ANSWERS TO PRACTICE EXERCISES

1. True 2. False 3. False 4. False 5. True
6. True 7. False 8. True 9. False 10. True
11. True 12. False 13. False 14. True 15. True
16. True 17. False

10
 PART 1 MODULE 2

PART 1 MODULE 2
SET OPERATIONS, VENN DIAGRAMS

SET OPERATIONS
Let U = {x|x is an English-language film}
Set A below contains the five best films according to the American Film Institute.
A = {Citizen Kane, Casablanca, The Godfather, Gone With the Wind, Lawrence of
Arabia}

Set B below contains the five best films according to TV Guide.

B= {Casablanca, The Godfather Part 2, The Wizard of Oz, Citizen Kane, To Kill A
Mockingbird}

Set C below contains the five most passionate films according to the American Film
Institute.
C = {Gone With the Wind, Casablanca, West Side Story, An Affair To Remember, Roman
Holiday}.

Notice that some films appear on more than one of these lists.

SET INTERSECTION AND SET UNION

Casablanca and Citizen Kane are the films that are simultaneously in sets A and B. We
say that {Casablanca, Citizen Kane} is the intersection of A and B.

This is denoted:
A  B = {Casablanca, Citizen Kane}

Likewise,
A  C ={Gone With the Wind, Casablanca} B  C = {Casablanca}
In general, if S and T are sets then S  T = {x|x S and x T}.

A Venn diagram is a drawing in which geometric figures such as circles and rectangles
are used to represent sets. One use of Venn diagrams is to illustrate the effects of set
operations.

The shaded region of the Venn diagram below corresponds to S  T

11
 HACKING MATHEMATICS PART 1

Now suppose we merge all of the elements of A with all of the elements of B to form a
single, larger set:
{Citizen Kane, Casablanca, The Godfather, Gone With the Wind, Lawrence of Arabia,
The Godfather Part 2, The Wizard of Oz, To Kill A Mockingbird}

This new set is called the union of A with B, and is denoted: A  B

Likewise,
A  C = {Citizen Kane, Casablanca, The Godfather, Gone With the Wind, Lawrence of
Arabia, West Side Story, An Affair To Remember, Roman Holiday}
and
B  C = {Casablanca, The Godfather Part 2, The Wizard of Oz, Citizen Kane, To Kill A
Mockingbird, Gone With the Wind, Casablanca, West Side Story, An Affair To
Remember, Roman Holiday}.

Note that in listing the elements of the sets above, the order in which the films were listed
did not matter, and it doesn’t make sense to list the same film more than once within the
same set.

In general, for any sets S and T, S  T = {x|x S or x T}.

The shaded part of the Venn diagram below illustrates S  T

12
 PART 1 MODULE 2

SET INTERSECTION, SET UNION, SET COMPLEMENT: SUMMARY

The intersection of two sets denotes the elements that the sets have in common, or the
"overlap" of the two sets.
S  T = {x|x S and x T}.

The union of two sets merges the two sets into one "larger" set.
S  T = {x|x  S or x  T}.

The complement of a set consists of all elements in the universal set that are not in the
given set.
S = {x|x  S}.

EXAMPLE 1.2.1
For problems 1 - 10 refer to these sets:
U = {a, b, c, d, e, f} A = {a, c, e, f} B = {c, d, e} C = {e, f}

Find each of the following:

1. A

2. B

3. C

4. B  C

5. A  C

6. B  C

7. (A  B)

8. A  B

9. B  C

13
 HACKING MATHEMATICS PART 1

10. A  (B  C)

World Wide Web note:

For more practice exercises involving set operations, visit the companion web site and try
THE BIG OPERATOR.

Note: In problems 11 - 16 that follow, the sets A, B, C and U are not the same sets that
were used problems 1 - 10. These problems are to be solved in general, not by referring
to specific sets whose elements are known. We will produce a shaded region on the
standard Venn diagram shown below.

A B

11. On a Venn diagram, shade the region(s) corresponding to A  B.

12. On a Venn diagram, shade the region(s) corresponding to A  B.
13. On a Venn diagram, shade the region(s) corresponding to A  B.
14. On a Venn diagram, shade the region(s) corresponding to A  B.
15. On a Venn diagram, shade the region(s) corresponding to (A  B).
16. On a Venn diagram, shade the region(s) corresponding to A  B.

Solution to Example 1.2.1 #13

To shade the set we need to compare the Venn diagram for A with the Venn diagram for
B, and bear in mind the meaning of union.

We combine these two Venn diagrams using set union. This means that any region that is
shaded in either of the diagrams above will be shaded in A  B.

14
 PART 1 MODULE 2

EXAMPLE 1.2.2
Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
S = {2, 5, 7, 9}
V = {3, 4, 5, 6, 7}
T = {1, 3, 4, 5, 8, 9}
Find (S  T)

The results of exercises 15 and 16 in Example 1.2.2 above suggest the following facts:

DeMORGAN’S LAWS FOR SET MATHEMATICS

For any sets S, T:

(S  T) = S  T and (S  T) = S  T

In words:
"The complement of a union is the intersection of the complements."
"The complement of an intersection is the union of the complements."

15
 HACKING MATHEMATICS PART 1

EXAMPLE 1.2.3
1-6: On a standard three-circle Venn diagram like the one shown below, shade the
region(s) corresponding to the given set expression.

A B

C
U

1. (A  B)  C 2. A  (B  C) 3. (A  B)  C

4. (A  C)  B 5. (A  B)  C 6. A  (B  C)

SOLUTION FOR EXAMPLE 1.2.3 #4

The key to solving a problem like this is to employ a logical process in which, at any
step, we never do more than compare to simple objects using one simple rule.

In order to make a Venn diagram for (A  C)  B, we need to compare the Venn
diagram for A  C with the Venn diagram for B using the simple rule for union.
However, in order to do that, we must first make a Venn diagram for A  C. We do so
by comparing the Venn diagram for A with the Venn diagram for C, using the simple
rule for intersection.

Recall that the intersection of two objects contains the elements that the two objects have
in common. This means that in the figure for A  C we will shade any regions that are
simultaneously shaded in the figure for A and the figure for C. Also note that the figure
for A will shade everything inside of circle A, while the figure for C will shade
everything outside of circle C.

16
 PART 1 MODULE 2

Now that we know what A  C looks like, we compare it with B.

17
 HACKING MATHEMATICS PART 1

We compare this figure for B with the figure for A  C above, using union. Recall that
the union of two objects contains all of the elements from both objects. This means that
the shaded region for (A  C)  B will contain all shaded regions from A  C along
with all shaded regions from B.

WORLD WIDE WEB NOTE

For unlimited practice involving three-circle Venn diagram shading problems, visit the
companion web site and try MY COUSIN VENNY.

18
 PART 1 MODULE 2

PRACTICE EXERCISES
1 – 15: U = {b, c, d, e, f, g, h, i, j, k} S = {b, c, d, h, i, k}
T = {b, d, e, f, h} V = {b, d, e, f, g, i}
Find: 1. S 2. T 3. V 4. ST 5. ST 6. SV 7. SV
8. TV 9. TV 10. SV 11. SV 12. ST 13. ST
14. VT 15. VT
16. Let U = { b, c, d, e, f, g, h, i, j } V = {e} W = {c, f, g, j} Find (V 
W )
17. Let U = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 } T = {2, 3, 9} V = {8, 9, 10}
Find (T  V )
18. Let U = { 1, 2, 3, 4, 5, 6, 7, 8 } T = {2, 5} V = {1, 2, 3, 7, 8}
Find (VT )
19. U = {1, 2, 3, 4, 5, 6, 7} S = {2, 4, 5} T = {3, 5, 7}
V = {2, 3, 4, 5, 7} W = {1, 2, 3, 4, 6} Find (SV)  (W T)
20. U = {a, b, c, d, e, f, g} S = {a, b, c, d, e, g}
T = {a, b, f, g}V = {d} W = {a, c, d, e, g} Find [(SW)  T ]
21. Let U = { 1, 2, 3, 4, 5, 6, 7, 8, 9 } S = {1, 2, 5, 6, 7} T = {5, 6}
V = {1, 2, 3, 5, 6, 9} Find S( TV)
22 – 33: On a standard 3-circle Venn diagram, shade the region(s) corresponding to the
set:
22. (B  A)  C 23. (C  B)  A 24. C  (A  B )
25. (A  B)  (A  C) 26. (A  B)  C 27. (A  B)  C
28. (A  B )  (B  C ) 29. (C  A )  B 30. (B  C )  A
31. (B  C )  A 32. (A  C)  (A  B) 33. (A  C)  B

ANSWERS FOR LINKED EXAMPLES

EXAMPLE 1.2.1
1. {b, d} 2. {a, b, f} 3. {a, b, c, d} 4. {c, d, e, f} 5. {e, f}
6. {e} 7. {b} 8. {a, b, d, f} 9. {f} 10. {a, c, e, f}

14. AB 15. (AB)

19
 HACKING MATHEMATICS PART 1

16. AB

EXAMPLE 1.2.2 {2, 5, 6, 7, 9, 10}

EXAMPLE 1.2.3
1. 2.

3. 4. (A  C)  B

5. 6.

ANSWERS TO PRACTICE EXERCISES

1 – 10: U = {b, c, d, e, f, g, h, i, j, k} S = {b, c, d, h, i, k}

20
 PART 1 MODULE 2

T = {b, d, e, f, h} V = {b, d, e, f, g, i}
1. S ={e, f, g, j} 2. T={c, g, i, j, k} 3. V={c, h, j, k}
4. ST = {b, d, h} 5. ST= {b, c, d, e, f, h, i, k} 6. SV= {b, d, i}
7. SV= {b, c, d, e, f, g, h, i, k} 8. TV= {b, d, e, f} 9. TV= {b, d, e, f, g, h, i}
10. SV= {b, d, e, f, g, i, j} 11. SV= {e, f, g} 12. ST = {b, d, e, f, g, h, j}
13. ST = {e, f} 14. VT= {b, c, d, e, f, h, j, k} 15. VT= {h}
16. Let U = { b, c, d, e, f, g, h, i, j } V = {e} W = {c, f, g, j}
(V  W ) = { }
17. Let U = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 } T = {2, 3, 9} V = {8, 9, 10}
(T  V ) = {2, 3}
18. Let U = { 1, 2, 3, 4, 5, 6, 7, 8 } T = {2, 5} V = {1, 2, 3, 7, 8}
(VT ) = {2, 4, 5, 6}
19. U = {1, 2, 3, 4, 5, 6, 7} S = {2, 4, 5} T = {3, 5, 7}
V = {2, 3, 4, 5, 7} W = {1, 2, 3, 4, 6} (SV)  (W T) = {1, 3, 5, 6, 7}
20. U = {a, b, c, d, e, f, g} S = {a, b, c, d, e, g}
T = {a, b, f, g}V = {d} W = {a, c, d, e, g} [(SW)  T ] = {f}
21. Let U = { 1, 2, 3, 4, 5, 6, 7, 8, 9 } S = {1, 2, 5, 6, 7} T = {5, 6}
V = {1, 2, 3, 5, 6, 9} S( TV) = {3, 4, 5, 6, 8, 9}

22. (B  A)  C 23. (C  B)  A

24. C  (A  B ) 25. (A  B)  (A  C)

26. (A  B)  C 27. (A  B)  C

21
 HACKING MATHEMATICS PART 1

28. (A  B )  (B  C ) 29. (C  A )  B

30. (B  C)  A 31. (B  C )  A

22
 PART 1 MODULE 3

PART 1 MODULE 3
VENN DIAGRAMS AND SURVEY PROBLEMS

EXAMPLE 1.3.1
A survey of 64 informed voters revealed the following information:
45 believe that Elvis is still alive
49 believe that they have been abducted by space aliens
42 believe both of these things

1. How many believe neither of these things?

2. How many believe Elvis is still alive but don't believe that they have been
abducted by space aliens?

SOLUTION TO EXAMPLE 1.3.1

When we first read the data in this example, it may seem as if the numbers contradict one
another. For instance, we were told that 64 people were surveyed, yet there are 45 who
believe that Elvis is alive and 49 who believe that they've been kidnapped by space
aliens. Obviously, 45 + 49 is much greater than 64, so it appears that the number of
people who responded to the survey is greater than the number of people who were
surveyed. This apparent contradiction is resolved, however, when we take into account
the fact that there are some people who fall into both categories ("42 believe both of
those things").

A Venn diagram is useful in organizing the information in this type of problem. Since
the data refers to two categories, we will use a two-circle diagram.

Let U be the set of people who were surveyed.

Let E be the set of people who believe that Elvis is still alive.
Let A be the set of people who believe that they have been abducted by space aliens.
Then we have the following Venn diagram showing the relationship between sets
E, A and U:

23
 HACKING MATHEMATICS PART 1

We are told that there are 42 people who "believe both of these things."

This means that in the region of the diagram where set E intersects set A, we have 42
people:

We are also told that "45 believe that Elvis is still alive." This means that set E must
contain a total of 45 people. We have already placed 42 people in one region of set E, so
we must place 3 people in the other region of set E:

We are also told that "49 believe that they have been abducted by space aliens."
This means that set A must contain 49 people. Since 42 of them have already been place
in one part of circle A, we must have 7 people in the other part of circle A:

Finally, we are told that 64 people were surveyed. This means that there must be
a total of 64 people in this universe. So far, we have placed 52 people in three regions of
the universe. Therefore, there must be 12 people in the region that is outside of the two
circles:

24
 PART 1 MODULE 3

Now that we have organized the given information so that there is one number in each of
the four regions of the Venn diagram, we can use the diagram to answer the questions.

1. How many believe neither of these things?

If a person believes neither of these things, then the person isn't in set E and isn't in set A.
The diagram shows us that 12 people satisfy this description.

2. How many believe Elvis is still alive but don't believe that they have been abducted by
space aliens?
A person who fits this description is simultaneously inside of circle E yet outside of circle
A. The diagram shows us that there are 3 of these people.

EXAMPLE 1.3.2

A survey of used car salesmen revealed the following information:

24 wear white patent-leather shoes
28 wear plaid trousers
20 wear both of these things
2 wear neither of these things

1. How many were surveyed?

2. How many wear plaid trousers but don't wear white patent-leather shoes?

25
 HACKING MATHEMATICS PART 1

EXAMPLE 1.3.3
A survey of faculty and graduate students at the University of Florida's film school
revealed the following information:
51 admire Moe
49 admire Larry
60 admire Curly
34 admire Moe and Larry
32 admire Larry and Curly
36 admire Moe and Curly
24 admire all three of the Stooges
1 admires none of the Three Stooges

a) How many people were surveyed?

b) How many admire Curly, but not Larry nor Moe?

c) How many admire Larry or Curly?

d) How many admire exactly one of the Stooges?

e) How many admire exactly two of the Stooges?

SOLUTION
Step 1: Step 2:
We will organize the information in the "24 admire all three of the Stooges:"
following Venn diagram, where "M," "L," and
"C" represent the sets of those who admire
Moe, Larry and Curly, respectively:

Step 3: Step 4:

26
 PART 1 MODULE 3

"1 admires none of the Three Stooges:" "36 admire Moe and Curly:"

Step 5: Step 6:

"32 admire Larry and Curly: "34 admire Moe and Larry:"

Step 7: Step 8:

27
 HACKING MATHEMATICS PART 1

"60 admire Curly:" "51 admire Moe"

Step 9:

"49 admire Larry"

Now that we have one number in each of the diagram's eight regions, we use the numbers
to answer the given questions.

28
 PART 1 MODULE 3

a) How many people were surveyed?

We add all eight numbers.
5 + 10 + 7 + 12 + 24 + 8 + 16 + 1 = 83

b) How many admire Curly, but not Larry nor Moe?

These are the ones who are simultaneously inside of circle C yet outside of the other two
circles. The diagram shows that the answer is "16."

c) How many admire Larry or Curly?

Unless we specify otherwise, we always use the word "or" in the inclusive sense, so that
this means "admire Larry, or admire Curly, or admire both." Those who satisfy this
compound condition are underlined in the diagram below.

29
 HACKING MATHEMATICS PART 1

10 + 7 + 24 + 8 + 12 + 16 = 77

d) How many admire exactly one of the Stooges?

There are three possibilities: admires Moe but not Curly and not Larry, admires Larry but
not Curly and not More, or admires Curly but not Moe and not Larry. Those who satisfy
this compound condition are underlined in the diagram below.

5 + 7 + 16 = 28

30
 PART 1 MODULE 3

e) How many admire exactly two of the Stooges?

Again, there are three possibilities: admires Moe and Larry but not Curly, admires Moe
and Curly but not Larry, or admires Larry and Curly but not Moe. Those who satisfy this
compound condition are in the regions underlined below:

12 + 10 + 8 = 30

EXAMPLE 1.3.4
A survey of 39 guests on the Jerry Slinger show revealed the following:
10 punch
18 curse
19 make obscene gestures
3 punch and curse and gesture
12 curse but don't punch and don't gesture
4 curse and gesture
4 punch and gesture but don't curse

How many...
1. ...engage in none of the three activities?
2. ...punch and curse?
3. ...curse or gesture?
4. ...engage in exactly one of these activities?

31
 HACKING MATHEMATICS PART 1

EXAMPLE 1.3.5

A group incoming first-year students at Major University were surveyed in order to

determine the factors that influenced their decisions to choose to attend Major U. The
survey revealed the following information.
55 said "great football team" (F)
51 said "excellent party reputation" (P)
61 said "it was the only place that would accept me" (O)
9 said "great football team" but didn't say "excellent party reputation" and didn't say
"it was the only place that would accept me"
26 said "it was the only place that would accept me" and "great football team" and
"excellent party reputation"
31 said "excellent party reputation" and "great football team"
8 said only "excellent party reputation"
4 said none of the above reasons

A - C: How many said

A. "it was the only place that would accept me" and "excellent party reputation"?

B. "great football team" or "it was the only place that would accept me"?

C. "great football team" but not "excellent party reputation"?

D. How many were surveyed?

WORLD WIDE WEB NOTE

For unlimited practice involving Venn diagrams and survey situations visit the
companion web site and try The SURVEYOR.

32
 PART 1 MODULE 3

HOMEWORK EXERCISES

1. A number of deer were surveyed about activities that they enjoy. The results are
summarized in the Venn diagram below.

How many…
A. …enjoy running or staring into headlights?
B. …enjoy nibbling and running?
C. …enjoy exactly one of these activities?
D. …enjoy staring into headlights but not running?
E. …enjoy nibbling?

2. A survey of 50 Yugo drivers revealed the following: three drive Yugos because of the
comfort; four drive Yugos because of the reliability; one drives a Yugo for both of these
reasons.

A. How many drive Yugos for neither of these reasons?

B. How many drive Yugos because of the comfort but not because of the reliability?

33
 HACKING MATHEMATICS PART 1

3. 110 dogs were asked “Why do you like to eat garbage?”

89 said “It tastes great!”
87 said “It’s more filling!”
68 said “It tastes great!” and “It’s more filling!”

A. How many said “It’s more filling!” but didn’t say “It tastes great!”?
B. How many said neither of those things?

4. A number of whales were asked about things that they dislike.

19 dislike giant squids
6 dislike giant squids and pollution and Captain Ahab
24 dislike Captain Ahab
4 dislike pollution but don’t s dislike giant squids and don’t dislike Captain Ahab
11 dislike Captain Ahab and giant squids
3 dislike pollution and Captain Ahab but don’t dislike giant squids
20 dislike pollution
5 have no dislikes
A. How many whales were surveyed?
B. How many dislike at least one of those three things?
C. How many dislike Captain Ahab but don’t dislike giant squids?
D. How many dislike giant squids or pollution?

5. A number of classicists were asked to identify their favorite epic poets. The results
are summarized below.
62 appreciate Homer 40 appreciate Virgil 5 appreciate Gomer
2 appreciate Homer and Virgil and Gomer
3 appreciate Virgil and Gomer
20 appreciate Homer and Virgil
42 appreciate Homer and neither of the other two
12 appreciate none of these three epic poets
A. How many were surveyed?
B. How many don’t appreciate Gomer?
C. How many appreciate Homer or Gomer?
D. How many appreciate exactly one of the three epic poets?

34
 PART 1 MODULE 3

6. Fifty elephants were asked about things that they like.

8 like tigers 6 like ivory carvings 9 like mice
1 likes all three of these things 4 like tigers and ivory carvings
5 like tigers and mice 3 like mice and ivory carvings
A. How many like none of these things?
B. How like ivory carvings but don’t like tigers?
C. How many like fewer than two of these things?
D. How many like mice or ivory carvings?

7. The members of the Gainesville Film Critics Society were surveyed regarding their
cinematic heroes.
38 admire Moe 36 admire Larry 21 admire Curly
23 admire Moe and admire Larry 5 admire Larry and admire Curly
7 admire Moe and admire Curly
3 admire Moe and admire Larry and admire Curly
16 don't admire Moe and don't admire Larry and don't admire Curly
A. How many were surveyed?
B. How many admire at least one of the Stooges?
C. How many admire Moe or Larry?

8. A number of Yugo owners were surveyed regarding their favorite activities.

57 enjoy walking 65 enjoy waiting for tow trucks 60 enjoy hitchhiking
20 enjoy waiting for tow trucks and enjoy hitchhiking and enjoy walking
22 enjoy hitchhiking and enjoy walking
12 don't enjoy waiting for tow trucks and don't enjoy hitchhiking and don't enjoy walking
23 enjoy walking but don't enjoy hitchhiking and don't enjoy waiting for tow trucks
38 enjoy waiting for tow trucks and enjoy hitchhiking

A. How many were surveyed?

B. How many enjoy at least two of these activities?

9. 100 Neanderthals were surveyed regarding their favorite possessions.

13 own a bone and own a stick 32 own a stick
3 own a rock and own a bone and own a stick
30 own a rock 14 own a rock and own a bone
31 own a bone 12 own a rock and own a stick
How many own none of these things?

35
 HACKING MATHEMATICS PART 1

ANSWERS TO LINKED EXAMPLES

EXAMPLE 1.3.2 1. 34 2. 8
EXAMPLE 1.3.4 1. 5 2. 5 3. 33 4. 24
EXAMPLE 1.3.5 1. 5 2. 63 3. 18

ANSWERS TO HOMEWORK EXERCISES

1. A. 88 B. 29 C. 35 D. 43 E. 54
2. A. 44 B. 2
3. A. 19 B. 2
4. A. 41 B. 36 C. 13 D. 26
5. A. 96 B. 91 C. 65 D. 63
6. A. 38 B. 2 C. 40 D. 12
7. A. 79 B. 63 C. 51
8. A. 122 B. 52
9. 43

36
 PART 1 MODULE 4

PART 1 MODULE 4
THE FUNDAMENTAL COUNTING PRINCIPLE

EXAMPLE 1.4.1

Plato is going to choose a three-course

meal at his favorite restaurant. He must
choose one item from each of the following
three categories.
First course: Tofu Soup (TS); Seaweed
Salad (SS)
Second course: Steamed Tofu (ST); Baked
Tofu (BT); Fried Tofu (FT);
Third course: Tofu Cake (TC); Tofu Pie
(TP); Seaweed Delight (SD)
How many different three-course meals are
possible?

Solve this problem by listing every possible 3-course meal.

SOLUTION
We will list every possible 3-course meal:
1. TS-ST-TC 2. TS-ST-TP 3. TS-ST-SD 4. TS-BT-TC
5. TS-BT-TP 6. TS-BT-SD 7. TS-FT-TC 8. TS-FT-TP
9. TS-FT-SD 10. SS-ST-TC 11. SS-ST-TP 12. SS-ST-SD
13. SS-BT-TC 14. SS-BT-TP 15. SS-BT-SD 16. SS-FT-TC
17. SS-FT-TP 18. SS-FT-SD
We see that there are 18 different three-course meals.

However, there is an easier way to get at this answer. Notice that in order to choose a
three-course meal, we need to make three decisions:
1. Choose item for first course: There are 2 options.
2. Choose item for second course: There are 3 options
3. Choose option for third course: There are 3 options.
Now observe that (2)(3)(3) = 18.

This is not a coincidence. It is an illustration of the Fundamental Counting Principle.

37
 HACKING MATHEMATICS PART 1

The Fundamental Counting Principle (FCP)

To determine the number of different outcomes possible in some complex process:
1. Analytically break down the process into separate stages or decisions.
2. Count the number of options that are available at each stage or decision.
3. Multiply together all of the numbers from Step 2 above.

EXAMPLE 1.4.2
How many different three course meals are possible if Plato has already decided that he
won't have Baked Tofu and he will have Seaweed Delight?

SOLUTION
We will use the Fundamental Counting Principle.
1. Choose item for first course: 2 options
2. Choose item for second course: 2 options (since he won't choose Baked Tofu)
3. Choose item for third course: 1 option (since it has already been decided that he will
choose Seaweed Delight).
(2)(2)(1) = 4 different 3-course meals

The primary advantage to the use of the Fundamental Counting Principle becomes
apparent when we have more complicated decision processes. For example:

EXAMPLE 1.4.3
Referring to the situation in the previous example, suppose that the restaurant becomes
quite successful and so the operators decide to expand their menu. Now there are 5 items
for the first course, 7 items for the second course, 4 items for the third course, and a new
fourth course is added (the seltzer course, in which we choose between Bromo and Alka).
How many four-course meals are possible?

SOLUTION
To choose a 4-course meal requires that we make four decisions. There are 5 options, 7
options, 4 options and 2 options, respectively, for each of these decisions.
(5)(7)(4)(2) = 280 different 4-course meals.
It would be very cumbersome to try to solve this problem by listing every possible
outcome, since there are so many different outcomes.

38
 PART 1 MODULE 4

EXAMPLE 1.4.4

1. A student will schedule her classes next semester by choosing one course from each of
the following categories:
i. ARH3130, ARH3150, or ARH4110
ii. STA1013, CGS2030, MGF1107 or MAC1105.
iii. ENC1142, ENC1144, or ENC1145
iv. WOH1023, WOH1030, AMH1000, EUH2100 or AFH1000.
How many different 4-course combinations are possible?
A. 180
B. 27
C. 15
D. 16

2. How many 4-course combinations are possible if she knows that she can't take
ARH4110 and she will take STA1013?

EXAMPLE 1.4.5
Prior to the coin toss for a football game, the captains of the two teams meet at midfield.
Team A has 4 captains, and team B has 3 captains. Each captain of team A shakes hands
once with each captain of team B. Bill Gates has recently acquired the patent on
handshakes, so he wants to know how many handshakes occur, in order to collect his
royalty. How many handshakes occur?

39
 HACKING MATHEMATICS PART 1

EXAMPLE 1.4.6

There are 5 guys (including Gomer) on

Gomer's bowling team. After the beer
frame they will each choose one of the
following: Scud, Scud Lite, or Scud Ice.
How many outcomes are possible?
A. 60
B. 125
C. 15
D. 243
E. 120

EXAMPLE 1.4.7
In Florida, standard automobile license plate "numbers" used to follow the following
scheme: 3 letters -- 2 digits -- 1 letter
Examples: JKP47R
TRR39S
VWN22Y
ZQW05Z
How many different license plate codes were possible under this scheme?

40
 PART 1 MODULE 4

EXAMPLE 1.4.8
Gomer has to take a 5 question true/false quiz, but he hasn't studied. He will guess at each
problem. In how many different ways is it possible to answer the quiz questions? How
likely is it that he will get a score of 100%?

EXAMPLE 1.4.9
Gomer has to take a 25 question multiple-choice test, but he hasn't studied. He will guess
at each problem. For each problem the possible responses are A, B, C, or D. In how many
different ways is it possible to answer the test questions? How likely is it that he will get
a score of 100%?

41
 HACKING MATHEMATICS PART 1

EXAMPLE 1.4.10
Gomer is going to order a frozen tofu cone from I
Definitely Believe It's Tofu.
The following toppings are available:
1. carob chips
2. frosted alfala sprouts
3. seaweed sprinkles
4. rolled oats
5. rose hips

He may choose all, some or none of these toppings.

How many topping combinations are possible?

A. 5
B. 10
C. 25
D. 32
E. 120

42
 PART 1 MODULE 4

EXAMPLE 1.4.11
1. How many different 4-digit numbers can be formed using the following digits? (Note:
the first digit cannot be 0, or else the number would be a 3-digit number).
{0, 2, 3, 5, 8}

2. How many different 4-digit numbers that are multiples of 5 can we form?

EXAMPLE 1.4.12
Gomer is considering the purchase of a new super-cheap sport/utility vehicle, the Skuzuzi
Kamikaze. He must choose a vehicle, taking into account the following options:
i. Transmission: 4-speed standard transmission, 5-speed standard transmission, or
automatic transmission;
ii. Bumper: steel bumpers, vinyl bumpers or 2x4 boards bolted to the front and back;
iii. Top: hard-top, vinyl top convertible, or chicken wire stapled over the roll bar;
iv. Funerary accessory: complementary funeral wreath or cremation urn.

How many different vehicle option packages are possible?

43
 HACKING MATHEMATICS PART 1

EXAMPLE 1.4.13
Homer, Gomer, Plato, Euclid, Socrates, Aristotle, Homerina and Gomerina form the
board of directors of the Lawyer and Poodle Admirers Club. They will choose from
amongst themselves a Chairperson, Secretary, and Treasurer. No person will hold more
than one position. How many different outcomes are possible?
A. 336 B. 24 C. 512 D. 21

EXAMPLE 1.4.13 SOLUTION

Choosing a Chairperson, Secretary and Treasurer from among these 8 people requires us
to make three decisions. However (unlike in all of the previous examples) these three
decisions are not independent. For instance, the choice we make when we select the
chairperson affects which options are available when we go to choose the Secretary, since
the person selected to be Chairperson cannot also be selected to be Secretary.

i. Choose Chairperson: 8 options;

ii. Choose Secretary: 7 options (one person has already been chosen to be Chairperson);

iii. Choose Treasurer: 6 options (two people have already been chosen to be Chairperson
and Secretary, respectively).

According to the Fundamental Counting Principle the number of outcomes is:

(8)(7)(6) = 336.

44
 PART 1 MODULE 4

EXAMPLE 1.4.14
A couple is expecting the birth of a baby boy. They will name the child by choosing a
first name and middle name from this list of their favorite boys' names: Jacob, Jonah,
Joshua, Jeremy, James, Joseph. The first name will be different from the middle name.
How many different two-part names are possible? (Example: Joseph Jeremy, Jeremy
Joseph, and Joshua James are three different, valid two-part names; Jacob Jacob is not a
valid possibility.)
A. 36 B. 12 C. 30 D. 11

EXAMPLE 1.4.15
Erasmus is trying to guess the combination to his combination lock. The "combination" is
a sequence of three numbers, where the numbers range from 1 to 12, with no numbers
repeated. How many different "combinations" are possible if he knows that the last
number in the combination is either 1 or 11?
A. 264 B. 1320 C. 220 D. 288

EXAMPLE 1.4.15 solution

Choosing a three-number “combination” having no repeated numbers requires that we

make three dependent decisions. One of these decisions, however, has a special
condition attached to it (the third number must be either 1 or 11). When using the
Fundamental Counting Principle in a situation involving dependent decisions, if one
decision has a special condition, that decision must be treated first, because the
special condition overrides the other decisions. For example, that fact that the third
number must be 1 or 11 means that it is impossible for the “combination” to
simultaneously have 1 for the first number and 11 for the second number (since then
there would be nothing left for the third number).

Three dependent decisions:

1. Choose third number (two options);
2. Choose first number (11 options);
3. Choose second number (10 options).

According to the Fundamental Counting Principle the number of possible outcomes is

(2)(11)(10) = 220.

The correct choice is C.

45
 HACKING MATHEMATICS PART 1

EXAMPLE 1.4.16
Adam, Beth, Charles, Dawn, and Ernie are the five finalists in the fabulous Clearers
Publishinghouse sweepstakes. Through a random selection process, one of them will win
a pen-and-pencil set, one of them will win a one-year supply of cat food, and one of them
will win a brand new Chevy blazer (that is, a vinyl sports jacket with the words "Chevy"
embossed on the back). Nobody will win more than one prize.
How many different outcomes are possible?
A. 125 B. 15 C. 12 D. 60

EXAMPLE 1.4.17

The Shakesperean Insult-O-Matic

A B
dreadful fiend
unmanner'd dog
murderous hog
wrangling cacodemon
elvish-mark'd dissembler
abortive toad
rooting homicide
foul hedgehog
defused infection of a man
cursed villain
devilish lump of foul deformity
detested devil
poisonous minister of hell
bunchback'd beggar
bottled spider
slander of thy mother's
heavy womb

Suppose we want to form a three-part Shakespearean insult, such as "Thou dreadful,

wrangling, minister of hell" by choosing two adjectives from column A and one noun
phrase from column B. How many different insults are possible? (Assume, for instance,
that "Unmanner'd, elvish-marked, lump of foul deformity" is different from
"Elvish-marked, unmanner'd, lump of foul deformity.")

The vocabulary comes from Act I of King Richard III.

46
 PART 1 MODULE 4

EXAMPLE 1.4.18
Homer is going to buy a 1986 Yugo. He has shopped around, and has found that '86
Yugos are available with any combination of the following options: plush Corinthian
vinyl interior, padded steering wheel, tinted windows, bucket seats, motor, windshield.
How many different option packages are possible?

EXAMPLE 1.4.20
The Egotists' Club has 6 members: A, B, C, D, E, and F. They are going to line up, from
left to right, for a group photo. After lining up in alphabetical order (ABCDEF), Mr. F
complains that he is always last whenever they do things alphabetically, so they agree to
line up in reverse order (FEDCBA) and take another picture. Then Ms. D complains that
she's always stuck next to Mr. C, and that she never gets to be first in line. Finally, in
order to avoid bruised egos, they all agree to take pictures for every possible left-to-right
line-up of the six people. How many different photos must be taken?

SOLUTION

To arrange the six people in a line we need to make six dependent decisions:
1. Choose first person (6 options);
2. Choose second person (5 options)
3. Choose third person (4 options)
4. Choose fourth person (3 options)
5. Choose fifth person (2 options)
6. Choose last person (1 option)

According to the Fundamental Counting Principle the number of outcomes is

(6)(5)(4)(3)(2)(1) = 720.

Note that the number of ways to arrange 6 people is equal to 6 multiplied all of the
positive integers smaller than 6. Likewise it is easy to see that if there were 8 people
rather than 6 people, the number of ways to arrange them in a line would be
(8)(7) (6)(5)(4)(3)(2)(1)
and if there were 10 people instead of 6 or 8 the number of ways to arrange them in a
line would be (10)(9)(8)(7) (6)(5)(4)(3)(2)(1)

These products are called factorials.

(6)(5)(4)(3)(2)(1) is called “6 factorial” and is denoted 6!

(8)(7) (6)(5)(4)(3)(2)(1) is called “8 factorial” and is denoted 8!
(10)(9)(8)(7) (6)(5)(4)(3)(2)(1) is called “10 factorial” and is denoted 10!

47
 HACKING MATHEMATICS PART 1

In general, if n is a positive integer, then “n factorial” (denoted n!) is the product of n

multiplied by all of the positive integers smaller than n:
n! = (n)(n–1)(n–2)…(3)(2)(1)

Factorials are important in the theory of counting because n! is the number of ways to
arrange n objects.

WORLD WIDE WEB NOTE

For practice problems involving the Fundamental Counting Principle visit the companion
web site and try THE FUNDAMENTALIZER. (Some of those problems require the
methods of PART 1 MODULE 5, however.)

PRACTICE EXERCISES
1. A 'combination' lock has a dial bearing the numbers 1 through 16. How many
different 3-number 'combinations' are possible if there are no restrictions on the 3
numbers (example: 16-5-4, 5-16-4, 3-3-12 are three different, valid 'combinations').
A. 48 B. 4096 C. 3360 D. 256

2. Prior to the coin toss for a football game, the captains for the two teams meet at
midfield. One team has three captains and the other team has five captains. Each captain
from the first team shakes hands with each captain from the other team. How many
handshakes occur?
A. 30 B. 8 C. 15 D. 17

3. A seven-question quiz has four true/false questions followed by 3 multiple choice

questions. For each multiple choice question there are four possible answers. In how
many different ways is it possible to answer the seven questions?
A. 12 B. 80 C. 28 D. 1024

4. Socrates is going to buy a new motorcycle. The motorcycles that interest him come
with the following optional accessories: extra-noisy pipes, sidecar, trailer, training
wheels. How many different accessory combinations are possible?
A. 16 B. 8 C. 24 D. 10

5. When Euclid dresses up for goth night, he has to choose a cloak, a shade of dark
lipstick, and a pair of boots. He has two cloaks, 6 shades of dark lipstick, and 3 pairs of
boots. How many different combinations are possible?
A. 15 B. 24 C. 11 D. 36

48
 PART 1 MODULE 4

6. Harpo, Groucho, Chico, Zeppo, Gummo and Karl are running in a race. How many
different orders of finish are possible?
A. 36 B. 64 C. 720 D. 46656

7. Socrates, Euclid, Plato, Aristotle, Diogenes, and Democritus are going to choose from
amongst themselves one person to wax the floor and another person to scrub the toilet.
How many different outcomes are possible if Diogenes will not scrub the toilet?
A. 36 B. 720 C. 30 D. 25

8. Gomer is going to order a pizza for his cat, Fido. The following toppings are available
for cat pizzas: sparrow sprinkles, lizard lozenges, mousie munchies, butterfly bits, and
beetle bites. He may choose any combination of those toppings (this includes the
possibility that he may choose none of them). How many different toppping
combinations are possible?
A. 32 B. 25 C. 120 D. 3125

9. When Diogenes the used-car salesman gets dressed for work, he has to choose a
jacket, shirt, tie, belt, trousers and shoes. He has a plaid jacket, a checkered jacket, and a
pink jacket; a white long-sleeved shirt, a white short-sleeved shirt, a green short-sleeved
shirt and a yellow long-sleeved shirt; a striped tie, a polka-dotted tie, a checkered tie, and
a solid orange tie; a white patent-leather belt and a black patent-leather belt; black
trousers, brown trousers, gray trousers, plaid trousers and pin-striped trousers; brown
shoes, black patent-leather shoes, white patent-leather shoes, and sneakers.
How many different ensembles are possible today if he has already determined that he
won’t wear any stripes and he will wear everything that is white patent-leather?
A. 288 B. 144 C. 15 D. 16

10. There are eight finalists in the Miss Sopchoppy contest. How many different
outcomes are possible if one person will be selected First Runner-Up and another will be
Miss Sopchoppy?
A. 56 B. 64 C. 16 D. 256

11. Jethro has just purchased a hamster to be a companion for his gerbil, D.W. He is
going to name the hamster by choosing a first name and second name from this list of
names: Billy, Bobby, Bubba, Brett. The first name may or may not differ from the
second name. How many different two-part names are possible?
A. 8 B. 12 C. 16 D. 64

12. There are four Gators in a holding cell at the jail. They will be asked to arrange
themselves from left to right in a police line-up. How many different line-ups are
possible?
A. 16 B. 8 C. 24 D. 256

49
 HACKING MATHEMATICS PART 1

13. Aristotle is going to register for classes next term. He has to choose one class from
each of the following categories:
I. MGF1107, MAC1105, STA1014
II. REL2000, REL2121, REL2213
III. AFH1000, AMH1000, ASH3100, EUH2100
IV. LIT2020, LIT2081, LIT3043
How many different combinations of classes are possible if he has already decided that he
will take LIT3043 and he won’t take EUH2100 and he won’t take REL2000?
A. 108 B. 19 C. 24 D. 18

14. Harpo, Groucho, Chico, Zeppo, Gummo and Karl are the finalists in the fabulous
Clearers’ Publishinghouse sweepstakes. Two prizes will be awarded: the Grand Prize
and the Even Grander Prize. The prizewinners will be randomly selected (and it is
possible that one person may win both prizes). How many outcomes are possible?
A. 720 B. 128 C. 30 D. 36

15. Euclid needs to create a password for his internet account. To simplify things, he is
going to form a four-letter password by choosing letters from this set: {A, D, E, M, R, S,
T}. How many different passwords are possible if the second and fourth letters will be
vowels and the other two letters won’t be vowels (repeated letters are possible)?
A. 40 B. 100 C. 256 D. 14

16. Socrates is going to buy a new pencil sharpener. He finds that the following six
optional accessories are available: titanium bearings, fuel injection, CD rom, chromium
alloy blades, air bags, HEPA filter shavings collector. How many different accessory
combinations are possible?
A. 64 B. 36 C. 720 D. 12

50
 PART 1 MODULE 4

ANSWERS TO LINKED EXAMPLES

EXAMPLE 1.4.4 1. 180 2. 30
EXAMPLE 1.4.5 12
EXAMPLE 1.4.6 D
EXAMPLE 1.4.7 45,697,600
EXAMPLE 1.4.8 32 different ways to answer the 5 questions. The likelihood of
getting all five questions correct by guessing is 1 out of 32.
EXAMPLE 1.4.9 425 or roughly 1,126,000,000,000,000. The likelihood of getting all
25 questons right by guessing is 1 out of 1,126,000,000,000,000.
EXAMPLE 1.4.10 D
EXAMPLE 1.4.11 1. 500 2. 200
EXAMPLE 1.4.12 54
EXAMPLE 1.4.14 C
EXAMPLE 1.4.16 D
EXAMPLE 1.4.17 2912
EXAMPLE 1.4.18 64
EXAMPLE 1.4.19 D
EXAMPLE 1.4.20 620

ANSWERS TO PRACTICE PROBLEMS

1. B 2. C 3. D 4. A 5. D 6. C
7. D 8. A 9. B 10. A 11. C 12. C
13. D 14. D 15. B 16. A

51
 HACKING MATHEMATICS PART 1

PART 1 MODULE 5
FACTORIALS, PERMUTATIONS AND COMBINATIONS

n! "n factorial"

If nis a positive integer, then n!is nmultiplied by all of the smaller positive integers.

Also, 0! = 1

0! = 1
1! = 1
2! = (2)(1) = 2
3! = (3)(2)(1) = 6
4! = (4)(3)(2)(1) = 24
5! = (5)(4)(3)(2)(1) = 120
6! = (6)(5)(4)(3)(2)(1) = 720
7! = (7)(6)(5)(4)(3)(2)(1) = 5,040
8! = (8)(7)(6)(5)(4)(3)(2)(1) = 40,320
9! = (9)(8)(7)(6)(5)(4)(3)(2)(1) = 362,880
10! = (10)(9)(8)(7)(6)(5)(4)(3)(2)(1) = 3,628,800
n! is n multiplied by all of the positive integers smaller than n.

FACT:
n! is the number of different ways to arrange (permutations of) n objects.

EXAMPLE 1.5.1
There are four candidates for a job. The members of the search committee will rank the
four candidates from strongest to weakest. How many different outcomes are possible?

EXAMPLE 1.5.1 SOLUTION

If you were to use the Fundamental Counting Principle, you would need to make four
dependent decisions.
1. Choose strongest candidate: 4 options
2. Choose second-strongest candidate: 3 options
3. Choose third-strongest candidate: 2 options
4. Choose weakest candidate: 1 option

(4)(3)(2)(1) = 24

A shorter way to get this answer is to recognize that the problem is asking us to find the
number of ways to arrange (according to relative sutability for the job) four people. By
definition, the number of ways to arrange 4 things is 4!
4! = 24

52
 PART 1 MODULE 5

EXAMPLE 1.5.2
In how many ways is it possible for 15 students to arrange themselves among 15 seats in
the front row of an auditorium?

EXAMPLE 1.5.3
There are 8 greyhounds in a race. How many different orders of finish (first place through
eighth place) are possible?

EXAMPLE 1.5.4
1. The password for Gomer's e-mail account consists of 5 characters chosen from the set
{g, o, m, e, r} . How many arrangements are possible, if the password has no repeated
characters?

2. How many 5-character passwords are possible if a password may have repeated
characters?

53
 HACKING MATHEMATICS PART 1

EXAMPLE 1.5.5
Gomer has a 20 volume set of World Book Encyclopedia. The 20 volumes are arranged
in numerical order. His uncle Aristotle has challenged him to write down every possible
arrangement of the 20 books. Aristotle will pay Gomer $10,000 if he can compete the job
within 30 days. The only proviso is that if Gomer doesn't complete the job within 30
days, he will have to pay Aristotle 1 penny for every permutation that he has failed to list.

1. How many different arrangements are there?

2. Gomer is a fast worker. Assuming that he can write down 1 million arrangements per
second, how long will it take for him to complete the job?

EXAMPLE 1.5.6
Refer to the situation in the previous example.
Use the fundamental counting principle to answer this question:
If Gomer is going to choose 9 of the 20 books, and arrange them on a shelf, how many
arrangements are possible?

EXAMPLE 1.5.6 SOLUTION

We can't directly use n! to solve this problem, because in this case he is not arranging the
entire set of 20 books. At this point, we must use the Fundamental Counting Principle.
Gomer has to make 9 dependent decisions:
1. Choose first book: 20 options
2. Choose second book: 19 options
3. Choose third book: 18 options
4. Choose fourth book: 17 options
5. Choose fifth book: 16 options
6. Choose sixth book : 15 options
7. Choose seventh book: 14 options
8. Choose eighth book: 13 options
8. Choose ninth book: 12 options

According to the Fundamental Counting Principle, the number of different outcomes

possible is
(20)(19)(18)(17)(16)(15)(14)(13)(12) = 60,949,324,800 arrangements

There is another way to get the answer to this question, without having to enter nine
numbers into the calculator. It refers to a special formula involving n!:

54
 PART 1 MODULE 5

The PERMUTATION FORMULA

The number of permutations of n objects taken r at a time:

This formula is used when a counting problem involves both:

1. Choosing a subset of r elements from a set of n elements; and
2. Arranging the chosen elements.

Referring to EXAMPLE 1.5.6 above, Gomer is choosing and arranging a subset of 9

elements from a set of 20 elements, so we can get the answer quickly by using the
permutation formula, letting n = 20 and r = 9. (That is, the answer to this problem is the
number of permutations of 20 things taken 9 at a time.)

= 60,949,324,800

EXAMPLE 1.5.7
There are ten candidates for a job. The search committee will choose four of them, and
rank the chosen four from strongest to weakest. How many different outcomes are
possible?

55
 HACKING MATHEMATICS PART 1

EXAMPLE 1.5.8
There are 8 horses in a race. If all we are concerned with are the first, second and third
place finishers (the trifecta), how many different orders of finish are possible?

EXAMPLE 1.5.9
Suppose we are going to use the symbols {a, b, c, d, e, f, g, h} to form a 5-character
"password" having no repeated characters. How many different passwords are possible?

EXAMPLE 1.5.10
There are six greyhounds in a race: Spot, Fido, Bowser, Mack, Tuffy, William.
We are concerned about who finishes first, second and third. How many different 1st-
2nd-3rd orders of finish are possible?
A. 120 B. 216 C. 18 D. 15

56
 PART 1 MODULE 5

EXAMPLE 1.5.11
Homer, Gomer, Plato, Euclid, Socrates, Aristotle, Homerina and Gomerina form the
board of directors of the Lawyer and Poodle Admirers Club. They will choose from
amongst themselves a Chairperson, Secretary, and Treasurer. No person will hold more
than one position. How many different outcomes are possible?
A. 336 B. 24 C. 512 D. 21

ASSORTED EXAMPLES:
Many of the examples from PART 1 MODULE 4 could be solved with the permutation
formula as well as the fundamental counting principle. Identify some of them and verify
that you can get the correct solution by using P(n,r).
FACT:
Any problem that could be solved by using P(n,r) could also be solved with the FCP.
The advantage to using P(n,r) is that in some cases we can avoid having to multiply
lots of numbers.
Conversely, there are problems that can be solved with the FCP but can't be solved using
P(n,r).

57
 HACKING MATHEMATICS PART 1

EXAMPLE 1.5.12
Consider the set S = {a, b, c, d, e}.

1. How many different 3-letter code "words" can we form using the letters of set S
without using repeated letters? Examples: abc, bca, dec, cde, bda, adb are 6 different code
"words."

2. How many different 3-element subsets does S have?

Solution to #1
We can use the FCP, since forming one of these code words requires three decisions:
i. Choose first letter (5 options)
ii. Choose second letter (4 options)
iii. Choose third letter (3 options)
According to the FCP, the number of different outcomes is (5)(4)(3) = 60 code words.

We could also use the permutation formula, since forming a three letter code word
requires us to choose and arrange three elements from a set of five elements.

Solution to #2
The answer to this problem is not 60.
Although the code words "abc," "cba," and "bac" are all different from one another, the
subsets {a, b, c}, {c, b, a} and {b, a, c} are all the same as one another. This means that
the number of 3-element subsets must be fewer than 60.

We can list them all:

{a, b, c}
{a, b, d}
{a, b, e}
{a, c, d}
{a, c, e}
{a, d, e}
{b, c, d}
{b, c, e}
{b, d, e}
{c, d, e}

Although there are 60 different 3-element code words with no repeated letters, there are
only 10 different 3-element subsets.

There is a formula that allows us to get this result without having to list all of the possible
subsets.

We say "10 is the number of combinations of 5 elements taken 3 at a time."

58
 PART 1 MODULE 5

The COMBINATION FORMULA

The number of combinations of n things taken r at a time:

We use this formula when we are choosing a subset of r elements from a set of n
elements, and the order in which elements are chosen or listed is not significant.

EXAMPLE How many 5-element subsets are in the set S = {2, 3, 4, 5, 6, 7, 8, 9}?

SOLUTION We choose 5 elements from a set of 8 elements. The order in which we

select or list the elements is not important, so this is a combination problem.

= 56 different 5-element subsets

EXAMPLE 1.5.13
Recall this problem from earlier: There are six greyhounds in a race: Spot, Fido, Bowser,
Mack, Tuffy, William. How many different 1st-2nd-3rd place orders of finish are
possible? We saw that the answer was P(6,3) = 120.

New question: After the race, three dogs will be randomly chosen for veterinary
examination. How many different three-dog groups are possible?

59
 HACKING MATHEMATICS PART 1

EXAMPLE 1.5.14
A pizzeria is offering a special: for $6 you get a four-topping pizza. The choices for
toppings are pepperoni, sausage, olives, mushrooms, anchovies, peppers, and onions.
How many different 4-topping combinations are possible (assuming that no topping can
be repeated on a pizza)?

EXAMPLE 1.5.15 Classic example of combinations

1. The Florida Lotto Saturday night drawing used to work like this:

There are 49 ping-pong balls in a machine, each bearing a number from 1 to 49. The
machine randomly spits out 6 ping-pong balls. If the numbers on the ping-pong balls
match the six numbers that you chose, YOU WIN!

How many different outcomes are possible?

2. Now, the Lotto works like this: there are 53 balls instead of 49. How many outcomes
are possible under this new scheme?

60
 PART 1 MODULE 5

EXAMPLE 1.5.16
Poor choice of words: the device that we commonly call a combination lock would more
accurately be called a permutation lock or a fundamental counting principle lock.

Why? Because, for one of these locks, the correct

"combination" is determined not only by the numbers
that are selected, but also by the order in which they are
selected.

1. Suppose "combination" lock has a dial whose

numbers are 1 through 16. Assuming that repeated
numbers are allowed within a "combination,” how many
different 3-number "combinations" are possible? (For
example, 10-13-10, 8-12-2, 2-12-8 are three different
possibilities.)

2. How many possibilities would there be if repeated

numbers were not allowed?

GENERAL WARNING: Our everyday use of the word "combination" does not
always agree with the mathematical meaning of that word.

EXAMPLE 1.5.17
There are nine people on the Board of Directors of the Gomermatic Investment
Corporation (GIC). At the onset of their monthly board meeting, each person shakes
hands with each of the other people. How many handshakes occur?

61
 HACKING MATHEMATICS PART 1

EXAMPLE 1.5.18
1. Harpo, Groucho, Chico, Zeppo, Gummo, Karl, and Skid have won three tickets to the
opera. They will randomly choose three people from their group to attend the opera. How
many outcomes are possible?

2. Suppose that instead of choosing 3 people to attend the opera, they decide instead to
choose 4 people to not attend. How many outcomes are possible?

EXAMPLE 1.5.18 solution

1. There are 7 people from whom to choose, and we are choosing three of them.
Because all three people are receiving the same reward (they get to go to the opera), the
order in which they are chosen or listed is not important. (For instance, if Harpo,
Groucho and Chico go to the opera it’s the same as if Chico, Harpo and Groucho go to
the opera.) Thus, this is a combination problem.
C(7,3) = 35

2. Following the approach in #1 above, we should see that answer will be C(7,4).
Another way to get the answer is to understand that the answer to this problem should be
exactly the same as the answer to problem #1. Why? Because every time we select a
three person group to go to the opera, we are automatically choosing a four-person group
to not go to the opera. That is, for each of the 35 different 3-person groups in the answer
to #1, there is a corresponding 4-person group in the answer to #2. Thus there must be
exactly 35 4-person groups. Indeed, C(7,4) = 35.

EXAMPLE 1.5.19
Gomer has eight pet wolverines. He has won a gift certificate to Wally's Wolverine
World, that entitles him to one free wolverine massage, one free wolverine shampoo, and
one free wolverine manicure. Gomer will randomly select which wolverines receive the
treats described above.
1. How many different outcomes are possible, if we assume that no wolverine will
receive more than one treat?
A. 512 B. 256 C. 56 D. 336

2. How many different outcomes are possible, if we assume that it may be possible for a
wolverine to receive more than one treat?
A. 512 B. 256 C. 56 D. 336

62
 PART 1 MODULE 5

EXAMPLE 1.5.20
Euclid's Auto Body Shoppe is trying to unload some unwanted paint by offering the
following special deal: for $99 you get a two-tone paint job, using one color for the top
and a different color for the body. The available colors are: hot pink, puke green, Gator
orange, flaming chartreuse. How many different paint schemes are possible?
A. 8 B. 16 C. 12 D. 7

EXAMPLE 1.5.21
A jar contains a penny, a nickel, a dime, a quarter, a half-dollar, and a silver dollar. Three
coins are selected (without replacement) and their monetary sum is determined. How
many different monetary sums are possible? (Examples: dime, quarter, penny: 36¢;
nickel, half-dollar, dollar: $1.55.)
A. 36 B. 120 C. 60 D. 20

EXAMPLE 1.5.22
Is it A. P(8,3); B. C(8,3); C. 83; or D. 38 ?
There are 8 kittens in a pet shop:
1. Three kittens will be randomly selected and donated to a nursing home. How many
different three-kitten collections are possible?
2. One kitten will be chosen for a rabies vaccination, one kitten will be chosen for a
distemper shot, and one kitten will be declawed. In how many different ways can the
choice of kittens be made, if it is possible that more than one of these treatments may be
given to the same kitten?
3. One kitten will be chosen for a rabies vaccination, another kitten will be chosen for a
distemper shot, and a third kitten will be declawed. In how many different ways can the
choice of kittens be made?
4. Each kitten will be given either a red, blue, or green ribbon. How many outcomes are
possible?

63
 HACKING MATHEMATICS PART 1

EXAMPLE 1.5.23
Is it P(9,5), C(9,5) or 95?
Each item below can be answered with either A. P(9,5); B. C(9,5); or C. 95
Choose the correct answer in each case.
1. The number of 5-element subsets in a 9-element set = ____
2. The number of 5-symbol codes that can be formed using the symbols
{@, /, $,¿, &, ß, £, á, ? } if repeated symbols are allowed = _____.
3. The number of different ways to choose 5 people from a set of 9 and position them in 5
seats = _____.
4. The number of ways to choose a chairperson, associate chairperson, parliamentarian,
treasurer, and secretary from a list of 9 candidates = _____ (assuming that no person will
hold more than one office).
5. The number of different 5-person groups that can be chosen from a collection of 9
people = _____.
6. The number of 4-element subsets in a 9-element set = _____.

EXAMPLE 1.5.24
1. The heavy-metal band Death Maggot normally performs 10 songs during a concert.
One night, however, they found that they would only have enough time to perform 7
songs, due to the fact that their opening act got called back for three encores. If the band
randomly chooses 7 songs to play, how many different outcomes are possible? (All we
care about is which 7 songs are chosen.)

2. On the other hand, if they randomly choose 3 songs not to play, how many different
outcomes are possible?

3. Assuming that they are only going to play 7 songs from their 10-song repertoire, how
many different arrangements are possible?

WORLD WIDE WEB NOTE

For practice problems involving permutations, combinations or the fundamental counting
principle visit the companion website and try THE FUNDAMENTALIZER.

64
 PART 1 MODULE 5

PRACTICE EXERCISES
1. How many different outcomes are possible if a coin is tossed 5 times?
(examples: HTTHT, THTHT, and TTHTT are three different outcomes.)
A. 10 B. 32 C. 20 D. 25

2. Ships of the navy of Outer Tyrania communicate at sea via code signals transmitted by
flags, as follows: each ship has six flags (the same set of six flags is on every ship); a
code is formed by choosing three flags and arranging them, from top to bottom, on the
mainmast. How many different codes are possible? Example:

A. 120 B. 18 C. 40 D. 10

3. A couple is expecting the arrival of a baby girl. They'll name the child by choosing a
first and middle name from this list of their favorite girls' names: Ann, Beth, Carrie,
Donna, Edna. The first name will be different from the middle name. (Example: Ann
Beth, Beth Ann, and Edna Beth are three different names. Beth Beth is not a valid
name.) How many different names are possible?
A. 25 B. 32 C. 20 D. 10

4. Ships of the navy of Inner Tyrania communicate at sea via a method similar to the one
described in #2 above, except: each ship has seven flags, and the code is determined
exclusively by the 3 flags chosen, and not by the order in which they are arranged on the
mast. How many different codes are possible?
A. 35 B. 210 C. 343 D. 128

5. There are 8 teams in a football conference. Each team must play all of the other teams
one time. How many games will be played?
A. 16 B. 64 C. 56 D. 28

6. Al, Beth, Chuck, Dora, and Ed have won 3 tickets to the opera. They will randomly
choose which 3 of them get to attend the performance. How many different 3-person
groups are possible? (Note: you should realize that in this case, the outcome BCA, for
instance, is the same as the outcome CAB.)
A. 10 B. 20 C. 243 D. 60

6*. Groucho, Harpo, Chico, Zeppo and Gummo have won 2 tickets to the opera. They
will randomly choose which two of them have to attend. How many different 2-person
groups are possible? A. 10 B. 20 C. 243 D. 60

65
 HACKING MATHEMATICS PART 1

7. The uniform for a marching band consists of: 2 different hats, 2 different types of
shoe, 3 different jackets, and 3 kinds of trousers. How many different uniform
configurations are possible, assuming that a uniform configuration is determined by the
hat, shoe, jacket and trouser?
A. 10 B. 24 C. 36 D. 210

8. In how many different ways is it possible to answer an 8-question true/false quiz?

A. 28 B. 256 C. 56 D. 16

9. 6 diplomats, representing 6 different nations, meet for a peace conference. At the

outset, each diplomat shakes hands once with each other diplomat. How many
handshakes occur?
A. 12 B. 36 C. 64 D. 15

10. The ships of the navy of Middle Tyrania communicate via a method identical to that
described in #2 above, except that all six of the flags are arranged on the mast in order to
form a code. How many different codes are possible?
A. 120 B. 36 C. 720 D. 12

11. A 'combination' lock has a dial bearing the numbers 1 through 20. How many
different 3-number 'combinations' are possible if there are no restrictions on the 3
numbers (example: 19-5-1, 5-19-1, 3-3-12 are three different, valid 'combinations').
A. 6840 B. 8000 C. 60 D. 1140

12. Referring to #11 above, how many different possibilities are there if the only
restriction is that a 'combination' cannot have any repeated number (example: 5-17-5 is
not valid)?
A. 6840 B. 8000 C. 20!3! D. 20! - 3!

13. P(9,5) = the number of:

A. 5-element subsets in a 9-element set
B. ways for 5 people from a group of 9 to be arranged on a bench
C. 4-element subsets in a 9-element set
D. all of these

14. A couple is expecting the birth of a baby boy. They will name the boy by choosing a
first name and a middle name from this list of their favorite boys' names:
Billy, Bobby, Buster, Bubba. They have not ruled out the possibility that the child's first
and middle names will be the same (example: Billy Buster, Buster Billy, and Bubba
Bubba are three different, valid possibilites). How many different names are possible?
A. 12 B. 144 C.16 D. 64

15. Same as #14 above, except the first and middle names will be different.
A. 12 B. 144 C. 16 D. 6

66
 PART 1 MODULE 5

16. There are seven greyhounds running in a race. How many different
1st-2nd-3rd place orders of finish are possible?
A. 210 B. 243 C. 35 D. 18

17. There are seven greyhounds running in a race. After the race, three of the dogs will
be randomly selected for veterinary examination. How many different groups of 3 dogs
are possible?
A. 210 B. 243 C. 35 D. 18

18. A jar contains a penny, a nickel, a dime, a quarter, and a half-dollar and silver dollar.
Two coins are selected (without replacement) and their monetary sum is determined.
How many different monetary sums are possible? (Examples: dime, quarter: 35¢;
nickel, half-dollar: 55¢ .)
A. 36 B. 64 C. 30 D. 15

19. In a jail cell, there are 5 Democrats and 6 Republicans. Four of these people will be
chosen for early release. How many 4-person groups are possible?
A. 330 B. 7920 C. 150 D. 1,663,200

20. Same as #19, except that 2 Democrats and 2 Republicans will be chosen.
A. 160 B. 150 C. 50 D. 600

21. Same as #19, except 4 people will be chosen for a police line-up. How many
different line-ups are possible?
A. 330 B. 7920 C. 150 D. 1,663,200

22. Same as #21, except 2 Democrats and 2 Republicans will be chosen for a police line-
up, with the Democrats on the left and the Republicans on the right.
A. 160 B. 150 C. 50 D. 600

23. C(15,3) = the number of

A. ways to choose a President, Vice-President, and Secretary from a 15-member club.
B. 3-element subsets in a 15-element set. C. 12-element subsets in a 15-element set.
D. B & C are both correct. E. none of these.

24. In a pet shop, there are 6 kittens. One kitten will be declawed, another kitten will be
given a rabies vaccination, and yet another will be given a distemper shot. In how many
ways can the selection be made? (This means, for instance, that if Fluffy gets the
distemper shot, Buffy gets declawed and Whiskers gets the rabies vaccine, then this
selection differs from one where Buffy gets the distemper shot, Whiskers gets declawed
and Fluffy gets the rabies vaccine.)
A. 18 B. 20 C. 60 D. 120

25. In a pet shop, there are 6 kittens. Three kittens will be donated to a nursing home.
How many different 3-kitten groups are possible?
A. 18 B. 20 C. 60 D. 120

67
 HACKING MATHEMATICS PART 1

ANSWERS TO LINKED EXAMPLES

EXAMPLE 1.5.2 15!  1.31  1012
EXAMPLE 1.5.3 8! = 40,320
EXAMPLE 1.5.4 1. 5! = 120 2. (5)(5)(5)(5)(5) = 3125
EXAMPLE 1.5.5 1. 20!  2.43  1018 2. About 77,000 years
EXAMPLE 1.5.7 P(10,4) = 5,040
EXAMPLE 1.5.8 P(8,3) = 336
EXAMPLE 1.5.9 P(8,5) = 6720
EXAMPLE 1.5.10 A
EXAMPLE 1.5.11 A
EXAMPLE 1.5.13 C(6,3) = 20
EXAMPLE 1.5.14 C(7,4) = 35
EXAMPLE 1.5.15 1. C(49,6) = 13,983,816 2. C(53,6) = 22,957,480
EXAMPLE 1.5.16 1. 4096 2. 3360
EXAMPLE 1.5.17 C(9,2) = 36
EXAMPLE 1.5.19 1. P(8,3) = 336 2. (8)(8)(8) = 512
EXAMPLE 1.5.20 P(4,2) = 12
EXAMPLE 1.5.21 C(6,3) = 20
EXAMPLE 1.5.22 1. B 2. C 3. A 4. D
EXAMPLE 1.5.23 1. B 2. C 3. A 4. A
5. B 6. B
EXAMPLE 1.5.24 1. C(10,7) = 120 2. C(10,3) = 120 = C(10,7)
3. P(10,7) = 604800

ANSWERS TO PRACTICE EXERCISES

1. B 2. A 3. C 4. A 5. D 6. A
6*. A 7. C 8. B 9. D 10. C 11. B
12. A 13. B 14. C 15. A 16. A 17. C
18. D 19. A 20. B 21. B 22. D 23. D
24. D 25. B

68
 PART 1 MODULE 6

PART 1 MODULE 6
MISCELLANEOUS COUNTING PROBLEMS

EXAMPLE 1.6.1
Refer to the Shakesperean Insult-o-Matic from MODULE 1 (EXAMPLE 3.1.17).
Suppose we are going to form a three-part Shakespearean insult by choosing two
different adjectives from column A and one noun phrase from column B.
Assume that rearranging the order of the adjectives does not change the meaning of the
insult (for example, "You poisonous, dreadful toad" is the same as "You dreadful,
poisonous toad").
How many different three-part insults are possible?

SOLUTION
We can use the Fundamental Counting Principle to solve this problem. However, we
must take into account that the order in which the two adjectives are chosen or listed does
not matter.

There are 12 adjectives from which to choose, and we want to choose two of them. Since
order doesn't matter, the number of ways in which this can be done is C(14, 2) = 91.

There are 91 ways to choose 2 adjectives. Having chosen the 2 adjectives, there are 16
possible noun phrases with which they may be combined. The total number of way to
combine the two adjectives with a noun phrase is (91)(16) = 1456

EXAMPLE 1.6.2
Suppose there are 8 Representatives and 6 Senators on a congressional conference
committee. Three of each will be chosen to receive a birthday present, even though today
isn't their birthday. How many 6-person groups are possible? (Note: they will each
receive the same gift.)

69
 HACKING MATHEMATICS PART 1

EXAMPLE 1.6.3
There are 12 female aviators and 8 male aviators at Billy Bob's Blimp-o-Drome. Billy
Bob is going to choose a pilot and co-pilot for a special women-only flight, and another
pilot and co-pilot for a special men-only flight. How many combinations are possible?

EXAMPLE 1.6.4
Suppose that by show of hands, we find that 24 people in this room are 18 years old, and
20 people are 19 years old. If we ask the question, "How many are 18 or 19 years old?"
will the answer be (24)(20) = 480?

FACTS
In counting problems or probability problems, "AND" corresponds to
"MULTIPLY" while "OR corresponds to "ADD"

The second formula above assumes that A and B are mutually exclusive conditions.

70
 PART 1 MODULE 6

EXAMPLE 1.6.5
A couple is expecting the birth of a baby. If the child is a girl, they will choose her first
name and middle name from this list of their favorite girls' names: Betty, Beverly,
Bernice, Bonita, Barbie.
If the child is a boy, they will choose his first name and middle name from this list of
their favorite boys' names: Biff, Buzz, Barney, Bart, Buddy, Bert.
In either case, the child's first name will be different from the middle name. How many
two-part names are possible?
A. 50 B. 600 C. 61 D. 900

SOLUTION
In this case, the child's name will be either a girl's name or a boy's name, so the number
of possible names will be the number of possible girl's names plus the number of possible
boy's names.

Number of possible girl's names:

We form a two-part girl's name by making two dependent decisions.

1. Choose first name: 5 options.
2. Choose middle name: 4 options.
(5)(4) = 20 different two-part girl's names.

Number of possible boy's names:

We form a two-part boy's name by making two dependent decisions.

1. Choose first name: 6 options.
2. Choose middle name: 5 options.
(6)(5) = 30 different two-part boy's names.

Total number of two-part names

= number of girl's names + number of boy's names
= 20 + 30 =50

The correct choice is A.

71
 HACKING MATHEMATICS PART 1

EXAMPLE 1.6.6
The mathematics department is going to hire a new instructor. They want to hire
somebody who possesses at least four of the following traits:
1. Honest;
2. Trustworthy;
3. Loyal;
4. Gets along well with others;
5. Well-groomed;
6. Good handwriting
In how many ways is it possible to combine at least four of these traits?

EXAMPLE 1.6.7
Six Democrats and five Republicans are in a jail cell. Either three Democrats or three
Republicans will be chosen for a police line-up. How many different line-ups are
possible? (We assume that a line-up is determined not only by the people who are chosen,
but also by the order in which they are "lined-up.")
A. 990 B. 7200 C. 33 D. 180

72
 PART 1 MODULE 6

EXAMPLE 1.6.8
Six Democrats and 5 Republicans are in a jail cell. Either 3 Democrats or 3 Republicans
will be chosen to pick up trash alongside the highway. How many different 3-person
groups are possible?
A. 30 B. 200 C. 7200 D. 180

EXAMPLE 1.6.9
Gomer's Auto Body Shoppe is still trying to unload some surplus paint by offering the
following special deals:
For $99 you get a two-tone paint job, using one color for the car's top and a different
color for the body.
For $129 you get a three-tone paint job, using one color for the car's top, a different color
for the body, and a third color for the hub caps.
The available colors are:
1. hot pink
2. puke green
3. Gator orange
4. flaming chartreuse
How many different color schemes are possible?
A. 24 B. 36 C. 27 D. none of these

73
 HACKING MATHEMATICS PART 1

EXAMPLE 1.6.10
Gomer is going to order a frozen tofu cone. The following toppings are available:
granola crumbles
seaweed sprinkles
carob chips
frosted alfalfa sprouts
roasted soybeans

1. How many topping combinations are possible if he will choose either three or four
toppings?
A. 50 B. 10 C. 15 D. 21

2. How many combinations are possible if he may choose all, some or none of the items?

EXAMPLE 1.6.11
At the animal shelter there are seven new puppies and six new kittens.
Either three puppies or three kittens will be randomly chosen and donated to a local
nursing home. How many different three-animal collections are possible?

74
 PART 1 MODULE 6

EXAMPLE 1.6.12
A survey of glamorous celebrities revealed that
30 wear dark glasses
32 smoke cigars
28 wear dark glasses and smoke cigars
1 does neither of these things

1. How many wear dark glasses and don't smoke cigars?

A. 540 B. 2 C. 35 D. 3

2. How many wear dark glasses or smoke cigars?

FACT
When a counting problem (or probability problem) refers to two categories that
overlap (that is, categories that aren't mutually exclusive), the information can be
organized with a Venn diagram.

EXAMPLE 1.6.12 SOLUTION

The information refers to two overlapping categories: "wears dark glasses" and "smokes
cigars." We can organize the information in the following two-circle Venn diagram:

1. To answer the question "How many wear dark glasses and don't smoke cigars?" we
recognize that the diagram shows 2 people who are within the set "wear dark glasses" yet
are outside of the set "smoke cigars," so the answer is 2.

2. To answer the question "How many wear dark glasses or smoke cigars" we add all the
numbers in those two circles: 2 + 28 + 4 = 34

75
 HACKING MATHEMATICS PART 1

There is another fact that can be used to answer question #2 above (but not question #1)
without making the Venn diagram:

FACT
For categories or conditions A, B: n(A or B) = n(A) + n(B) - n(A and B)

Applying this fact to the question "How many wear dark glasses or smoke cigars?" we
have:

n(wear dark glasses or smoke cigars)

= n(wear dark glasses) + n(smoke cigars) - n(wear dark glasses and smoke cigars)
= 30 + 32 - 28 = 34.

EXAMPLE 1.6.13
Among a group of Gators, 26 are modest, 28 are charming, 24 are modest and charming,
864 are not modest and not charming.
How many are...
1. ...charming but not modest?
2. ...modest or charming?

76
 PART 1 MODULE 6

EXAMPLE 1.6.14
The editorial board of the National Requirer has decided to launch two new series of
investigative reports. One series will involve the theme
"Elvis ____ my ____!"
For this series, the writers will generate a story line by filling in the first blank with an
item from this list:
"loved"; "sang to"; "got sick on"; "smoked" and filling in the second blank with an item
from this list:
"fig tree"; "living room carpet"; "cat".

The other series will involve the theme "Aliens ____ my ____!"
The writers will generate a story line by filling in the first blank with an item from this
list: "attacked"; "rescued"; "probed";
and filling in the second blank with an item from this list:
"home town"; "trailer park"; "granny's arrest record"

How many story lines are possible?

EXAMPLE 1.6.15
Pizza Shack is offering the following special deal this month: for one low price ($6.99)
you can get a large pizza with up to 4 different toppings. There are 8 toppings from which
to choose. How many different topping combinations are possible?
A. 70 B. 1680 C. 163 D. 32

77
 HACKING MATHEMATICS PART 1

EXAMPLE 1.6.16
Homer pays big bucks to the Gomermatic Investment Corporation (GIC) to manage his
retirement account. Homer hired GIC on the basis of the following event:
Last January, Homer received an unsolicited mailing from GIC. The mailing listed seven
prominent stocks from the New York Stock Exchange. For each of the seven stocks, there
was a prediction as to whether or not that stock's value would increase by at least 5% as
of May 1.
When May 1 rolled around, Homer found that all seven predictions were correct. He
received a follow-up mailing from GIC, boasting of their spectacular ability to predict
stock market events. Based on this phenomenal performance at picking winners and
losers, Homer instantly signed up as a client of GIC.
What questions might have occurred to a less gullible investor?

WORLD WIDE WEB NOTE

For more practice problems visit the companion website and try THE
FUNDAMENTAIZER PART 2.

PRACTICE EXERCISES
1. In a pet shop, there are 8 puppies and 6 kittens. 3 puppies and 2 kittens will be
neutered. In how many ways can the 5 animals be selected?
A. 2002 B. 71 C. 840 D. 2400

2. 5 women and 4 men are trying out for the cheerleading team. If 2 women and 2 men
will be selected, how many different 4-person groups are possible?
A. 16 B. 60 C. 18 D. 80

3. A couple is expecting a baby. They don't yet know whether the child will be a boy, or
a girl. They will name the child by choosing a first name and middle name from either
of these two lists, depending upon the sex of the baby:
girls' names: Sally, Sue, Sara, Stephanie
boys' names: Josh, Jacob, Jonah, Jeremiah, John.
The child's first name will be different from the middle name. How many possible names
are there?
A. 240 B. 400 C. 41 D. 32

4. Carmen's Carry-Out offers two different menus to her customers: A customer may
choose a 3-course meal from either the Spanish Menu or the Oriental Menu, but the two
menus may not be mixed. The Spanish menu consists of 3 different appetizers, 4
different entrees, and 2 different desserts. The Oriental menu consists of 2 different
appetizers, 3 different entrees, and 3 different desserts. How many different 3-course
meals are possible?
A. 432 B. 42 C. 864 D. 84

78
 PART 1 MODULE 6

5. Referring to #5, how many different 3-course meals are possible if the two menus may
be combined?
A. 175 B. 1296 C. 72 D. 17

6. A survey of 100 Leon County voters, following the November, 2000 elections,
revealed the following data: 38 voted for Bush for President, 28 voted for McCollum for
U.S. Senator, and 25 voted for both Bush for President and McColluumfor Senator. How
many of those surveyed voted for at least one of the two candidates mentioned above?
A. 66 B. 63 C. 41 D. 91

7. Piggo's Pizza is offering a special deal: for $5 you get a large pizza with up to 4
toppings. The toppings available are: sardines, Spam, Hershey's Kisses, corn, peanuts,
pickles. No topping may be repeated on a single pizza. How many different topping
combinations are possible?
A. 10 B. 64 C. 57 D. 36

8. In #6 above, how many didn't vote for Bush?

A. 10 B. 72 C. 75 D. 62

9. A pet shop has 8 puppies and 6 kittens. Either 2 puppies or 3 kittens will be donated
to the Mary Kay Cosmetics Product Testing Labs. In how many ways can the selection
be made?
A. 112 B. 8064 C. 48 D. 560

10. In a jail cell, there are 8 Democrats and 6 Republicans. Either 4 Democrats or 4
Republicans will be selected to go out and pick up trash along the highway. How many
different 4-person groups are possible?
A. 1050 B. 85 C. 102 D. 1001

11. How many subsets are in a 12-element set? (Note: this is a question that you could
have answered prior to Test 1.)
A. 24 B. 144 C. 4096 D. 66

12. A basketball team has a home uniform and an away uniform. For the home uniform,
there is a choice of 3 different jerseys, 4 styles of trunks, 2 styles of shoes, and 2 styles
of stockings. For the away uniform, there is a choice of 2 styles of jersey, 2 styles of
trunks, 1 style of shoe, and 2 styles of stockings. All items in the home uniform are
different from those in the away uniform, and items from the two uniforms may not be
mixed. How many different uniform configurations are possible?
A. 384 B. 288 C. 54 D. 56

13. On a certain day, 20 customers purchased Burley Cigarettes from Moe's QuikShop.
Of the 20, 14 were bikers, 16 had tattoos, and 12 were bikers with tattoos. How many
were neither bikers, nor tattooed?
A. 18 B. 10 C. 2 D. 4

79
 HACKING MATHEMATICS PART 1

14. Refer to the situation in #7 above. How many different 3-topping combinations are
possible?
A. 24 B. 20 C. 12 D. 60

15. A new health-food-trash-food emporium, I Definitely Believe It's Tofu, has opened
next to Publix. Their specialty is the frozen tofu cone, with toppings. There are five
toppings from which to choose: carob chips, granola, prunes, sunflower seeds, or (of
course) seaweed sprinkles. A customer may order a cone with any combination of
toppings (or no toppings at all: au naturel). How many different possibilities are there?
A. 10 B. 120 C. 32 D. 25

16. Refer to the situation in #15 above. How many different topping combinations are
possible if at least 2 toppings will be chosen?
A. 6 B. 18 C. 26 D. 14

17. A wrestling promoter needs to select 2 wrestlers to fight in the main event for
Wrestlepalooza III. The main event will involve one of these two themes: Masked
Mayhem (featuring two masked wrestlers), or Whiskered Warfare (featuring two bearded
wrestlers). The promoter has eight masked wrestlers and seven bearded wrestlers from
whom to choose. In how many ways may he form a match for the main event?
A. 98 B. 49 C. 14 D. 588

18. Ships of the navy of the Democratic People's Republic of North Tyrania
communicate at sea, using flags to transmit coded messages according to the following
scheme: each ship has a set of 6 flags (the same six flags are on each ship). A code
message is formed by choosing some combination of the flags, and hanging them from
the mainmast. A code message is determined entirely by the flags chosen, and not by the
order in which they are arranged. Thus, a code message could involve no flags at all
("we are unable to come to the mast at this time; please leave your message at the beep")
or it could involve 1, 2, 3, 4 or 5 flags, or it could involve all 6 flags ("if it's my wife, I
ain't here"). How many different messages are possible?
A. 720 B. 120 C. 64 D. 36

80
 PART 1 MODULE 6

19. In #10 above, 4 Democrats and 4 Republicans will be selected. How many different
8-person groups are possible?
A. 1050 B. 85 C. 102 D. 1001

20. For his birthday, Gomer is going to invite some friends to a party at Chuck E.
Cheese’s. He has compiled a list of 10 of his closest friends, but he can only afford to
invite 6 of them. If he randomly chooses 6 friends from the list of 10, how many
different 6-person collections are possible?
A. 60 B. 5040 C. 210 D. 1,000,000

21. The board of directors of a lobbying group consists of 6 men and 5 women. Two
men and two women will be chosen to attend a conference in Sopchoppy. How many
different 4-person groups are possible?
A. 330 B. 150 C. 25 D. 600

22. Gomer is shopping for a cat. He wants a cat that possesses at least three of the
following traits: I. Has aloof personality; II. Has rodent breath; III. Has stripes; IV.
Purrs when happy; V. Twitches tail when angry. Assuming that a combination of traits
includes at least three of the traits, how many combinations of traits are possible?
A. 16 B. 10 C. 20 D. 32

23. There are 6 Democrats and 6 Republicans on the local zoning commision. They are
going to randomly choose a chairperson and treasurer from among themselves, subject to
the following agreements: both officeholders will belong to the same party, and no
person will hold more than one position. How many different outcomes are possible?
A. 132 B. 900 C. 30 D. 60

24. Select the answer that correctly completes the sentence.

P(14, 10) =
A. 24,024
B. the number of ways to choose 10 people from a group of 14 and assign them into 10
empty seats.
C. the number of 10-element subsets in a 14-element set.
D. the number of ten-letter passwords that can be formed using letters chosen from the
set S = {a,b,c,d,e,f,g,h,i,j,k,l,m,n}, if repeated letters are allowed.

25. In how many different ways is it possible to choose a Chairperson, Associate

Chairperson, and Parliamentarian from a list of 7 candidates, assuming that no candidate
can hold more than one position?
A. 210 B. 343 C. 16 D. 35

26. The Egotists' Club consists of 6 men and 7 women. They will send either 2 men or 2
women to the national Egotists' convention. How many different 2-person groups are
possible?
A. 42 B. 315 C. 72 D. 36

81
 HACKING MATHEMATICS PART 1

ANSWERS TO LINKED EXAMPLES

EXAMPLE 1.6.2 1120
EXAMPLE 1.6.3 7392
EXAMPLE 1.6.4 Since 24 are 18 years old and 20 are 19 years old, the number who
are either 18 or 19 years old is 24 + 20 = 48.
EXAMPLE 1.6.6 22
EXAMPLE 1.6.7 D
EXAMPLE 1.6.8 A
EXAMPLE 1.6.9 B
EXAMPLE 1.6.10 1. C 2. 32
EXAMPLE 1.6.11 55
EXAMPLE 1.6.13 1. 4 2. 30
EXAMPLE 1.6.14 21
EXAMPLE 1.6.15 C
EXAMPLE 1.6.16 What are the names and addresses of other people who were sent
this solicitation?

ANSWERS TO PRACTICE EXERCISES

1. C 2. B 3. D 4. B 5. A 6. C
7. C 8. D 9. C 10. B 11. C 12. D
13. C 14. B 15. C 16. C 17. B 18. C
19. A 20. C 21. B 22. A 23. D 24. B
25. A 26. D

82