Skip to main content
\( \def\negchoose#1#2{\genfrac{[}{]}{0pt}{}{#1}{#2}_{-1}} \newcommand{\mchoose}[2]{\left(\!\binom{#1}{#2}\!\right)} \newcommand{\cycle}[1]{\arraycolsep 5 pt \left(\begin{array}#1\end{array}\right)} \newcommand{\importantarrow}{\Rightarrow} \newcommand{\qchoose}[2]{\left[{#1\atop#2}\right]_q} \newcommand{\bp}{ \begin{enumerate}{\setcounter{enumi}{\value{problemnumber}}}} \newcommand{\ep}{\setcounter{problemnumber}{\value{enumi}} \end{enumerate}} \newcommand{\ignore}[1]{} \renewcommand{\bottomfraction}{.8} \renewcommand{\topfraction}{.8} \newcommand{\apple}{\text{🍎}} \newcommand{\ap}{\apple} \newcommand{\banana}{\text{🍌}} \newcommand{\ba}{\banana} \newcommand{\pear}{\text{🍐}} \newcommand{\pe}{\pear} \DeclareMathOperator{\Fix}{Fix} \DeclareMathOperator{\Orb}{Orb} \newcommand{\F}{\mathcal{F}} \newcommand{\alert}{\fbox} \def\d{\displaystyle} \def\course{Math 228} \newcommand{\f}[1]{\mathfrak #1} \newcommand{\s}[1]{\mathscr #1} \def\N{\mathbb N} \def\B{\mathbf{B}} \def\circleA{(-.5,0) circle (1)} \def\Z{\mathbb Z} \def\circleAlabel{(-1.5,.6) node[above]{$A$}} \def\Q{\mathbb Q} \def\circleB{(.5,0) circle (1)} \def\R{\mathbb R} \def\circleBlabel{(1.5,.6) node[above]{$B$}} \def\C{\mathbb C} \def\circleC{(0,-1) circle (1)} \def\F{\mathbb F} \def\circleClabel{(.5,-2) node[right]{$C$}} \def\A{\mathbb A} \def\twosetbox{(-2,-1.5) rectangle (2,1.5)} \def\X{\mathbb X} \def\threesetbox{(-2,-2.5) rectangle (2,1.5)} \def\E{\mathbb E} \def\O{\mathbb O} \def\U{\mathcal U} \def\pow{\mathcal P} \def\inv{^{-1}} \def\nrml{\triangleleft} \def\st{:} \def\~{\widetilde} \def\rem{\mathcal R} \def\sigalg{$\sigma$-algebra } \def\Gal{\mbox{Gal}} \def\iff{\leftrightarrow} \def\Iff{\Leftrightarrow} \def\land{\wedge} \def\And{\bigwedge} \def\entry{\entry} \def\AAnd{\d\bigwedge\mkern-18mu\bigwedge} \def\Vee{\bigvee} \def\VVee{\d\Vee\mkern-18mu\Vee} \def\imp{\rightarrow} \def\Imp{\Rightarrow} \def\Fi{\Leftarrow} \def\var{\mbox{var}} \def\Th{\mbox{Th}} \def\entry{\entry} \def\sat{\mbox{Sat}} \def\con{\mbox{Con}} \def\iffmodels{\bmodels\models} \def\dbland{\bigwedge \!\!\bigwedge} \def\dom{\mbox{dom}} \def\rng{\mbox{range}} \def\isom{\cong} \DeclareMathOperator{\wgt}{wgt} \newcommand{\vtx}[2]{node[fill,circle,inner sep=0pt, minimum size=4pt,label=#1:#2]{}} \newcommand{\va}[1]{\vtx{above}{#1}} \newcommand{\vb}[1]{\vtx{below}{#1}} \newcommand{\vr}[1]{\vtx{right}{#1}} \newcommand{\vl}[1]{\vtx{left}{#1}} \renewcommand{\v}{\vtx{above}{}} \def\circleA{(-.5,0) circle (1)} \def\circleAlabel{(-1.5,.6) node[above]{$A$}} \def\circleB{(.5,0) circle (1)} \def\circleBlabel{(1.5,.6) node[above]{$B$}} \def\circleC{(0,-1) circle (1)} \def\circleClabel{(.5,-2) node[right]{$C$}} \def\twosetbox{(-2,-1.4) rectangle (2,1.4)} \def\threesetbox{(-2.5,-2.4) rectangle (2.5,1.4)} \def\ansfilename{practice-answers} \def\shadowprops{{fill=black!50,shadow xshift=0.5ex,shadow yshift=0.5ex,path fading={circle with fuzzy edge 10 percent}}} \newcommand{\hexbox}[3]{ \def\x{-cos{30}*\r*#1+cos{30}*#2*\r*2} \def\y{-\r*#1-sin{30}*\r*#1} \draw (\x,\y) +(90:\r) -- +(30:\r) -- +(-30:\r) -- +(-90:\r) -- +(-150:\r) -- +(150:\r) -- cycle; \draw (\x,\y) node{#3}; } \newcommand{\card}[1]{\left| #1 \right|} \newcommand{\twoline}[2]{\begin{pmatrix}#1 \\ #2 \end{pmatrix}} \newcommand{\lt}{<} \newcommand{\gt}{>} \newcommand{\amp}{&} \)

IndexIndex

\(k\)-coloring, Paragraph
\(q\)-ary factorial, Activity
\(q\)-binomial coefficient, Activity
adjacent, Item
antecedent, Subsection
Bell Number, Definition
biconditional, Item
bijection, Paragraph
binomial coefficient
\(q\)-binomial, Activity
binomial coefficients, Section
binomial theorem
extended, Activity
bipartite, Paragraph Item
broken permutation, Paragraph
Brooks' Theorem, Theorem
Canadians, Paragraphs
cardinality, Item Paragraph
Cartesian product, Paragraph
cases, Paragraph
Catalan number
generating function for, Activity
chromatic index, Paragraph
chromatic number, Item Paragraph
circuit, Definition
closed formula
for a function, Paragraph
codomain, Paragraph
coefficient
multinomial, Activity
complement, Activity Paragraph
complement of a partition, Activity
complete graph, Paragraph Item
composition, Exercise
conclusion, Subsection
conditional, Item
conjugate of an integer partition, Activity
conjunction, Item
connected, Paragraph Item
connectives, Paragraph
and, Item
if and only if, Item
implies, Item
not, Item
or, Item
consequent, Subsection
contraction, Paragraph
contradiction, Paragraph
contrapositive, Item
proof by, Paragraph
converse, Item
convex, Paragraph
counterexample, Paragraph
cube, Activity
De Morgan's laws, Subsection
deduction rule, Paragraph
degree, Item
deletion, Paragraph
derangement, Paragraph Paragraphs
derangement problem, Paragraph
diagram
of a partition!Ferrers, Paragraph
of a partition!Young, Paragraph
difference, of sets, Paragraph
direct proof, Paragraph
disjunction, Item
Doctor Who, Paragraph
dodecahedron, Activity
domain, Paragraph
double negation, Subsection
empty set, Item
encomplement of a partition, Activity
Euler path, Item
existential quantifier, Subsection
extended binomial theorem, Activity
faces, Paragraph
factorial
\(q\)-ary, Activity
Ferrers diagram, Paragraph
Fibonacci numbers, Paragraph Activity
Four Color Theorem, Theorem
function, Paragraph
ordered, Paragraph
surjective!and Stirling Numbers, Activity
functions
onto!number of, Activity
generating function, Paragraph
product principle for, Activity
geometric series, Activity
girth, Paragraph
graph, Item
Hall's Marriage Theorem, Theorem
Hamilton path, Paragraph
hatcheck problem, Paragraph
hypothesis, Subsection
icosahedron, Activity
if and only if, Item
if…, then…, Item
implication, Item
inclusion and exclusion principle, Paragraph
for unions of sets, Paragraph
inclusive or, Paragraph
induced subgraph, Definition
induction, Paragraph Subsection
strong, Subsection
inductive hypothesis, Item
injection, Paragraph
integers, Item Item
intersection, Item Paragraph
isomorphic, Paragraph Definition
isomorphism, Definition
isomorphism class, Paragraph
Lah number, Paragraph
lattice path, Activity
law of logic, Example
linear recurrence, Paragraph
second order, Activity
logical equivalence, Subsection
logically valid, seelaw of logic
matching, Paragraph
matching condition, Lemma
menage problem, Activity
modus ponens, Paragraph
monochromatic, Paragraph
multigraph, Paragraph Item
multinomial coefficient, Activity
natural numbers, Item
necessary condition, Subsection
negation, Item
neighbors, Paragraph
NP-complete, Paragraph
octahedron, Activity
one-to-one, Paragraph
onto, Paragraph
onto functions
number of, Activity
ordered function, Paragraph
partial fractions
method of, Paragraph
partition of a set
type vector, Paragraph
partition of an integer, Paragraph
conjugate of, Activity
decreasing list, Activity
Ferrers diagram, Paragraph
into \(n\) parts, Paragraph
self conjugate, Activity
type vector, Activity
Young diagram, Paragraph
partitions of a set
number of, Definition
Pascal's triangle, [image]
perfect graph, Paragraph
permutation
broken, Paragraph
picture enumerator, Paragraph
picture enumerators
product principle for, Activity
Pigeonhole principle, Example
planar, Item Paragraph
Platonic solids, Activity
polyhedron, Paragraph
power set, Item Paragraph
prime numbers, Theorem Example
principle of inclusion and exclusion, Paragraph
for unions of sets, Paragraph
product principle, Subsection
picture enumerators, Activity
product principle for generating functions, Activity
proof by cases, Paragraph
proof by contradiction, Paragraph
proof by contrapositive, Paragraph
proposition, Paragraph
quantifiers, Subsection
exists, Subsection
for all, Subsection
range, Paragraph
rationals, Item
reals, Item
recurrence
constant coefficient, Activity Paragraph
second order, Activity Paragraph
recursively defined functions, Subsection
reference, self, seeself reference
second order recurrence, Activity
self reference, seereference, self
self-conjugate partition, Activity
series
geometric, Activity
set, Paragraph
set difference, Paragraph
statement, Paragraph
Stirling Number
second kind, Activity
strong induction, Subsection
subgraph, Definition Item
induced, Definition
subset, Paragraph
sufficient condition, Subsection
sum principle, Subsection Paragraph
surjection, Paragraph
surjections
number of, Activity
surjective function
counting, Activity
tautology, Paragraph
tetrahedron, Activity
trail, Definition
tree, Item
truth table, Subsection
truth value, Paragraph
type vector for a partition of an integer, Activity
type vector of a partition of a set, Paragraph
union, Item Paragraph
universal quantifier, Subsection
Venn diagram, Paragraph
vertex coloring, Item Paragraph
Vizing's Theorem, Theorem
Young diagram, Paragraph