\documentclass[12pt]{amsart}
\
\setlength{\parsep}{3pc}
\setlength{\itemsep}{0.2in}
\
\usepackage{fullpage}
\usepackage{psfig}
\
\title[Problem Set 5 Solutions]{ArsDigita University\\Month 2:
Discrete
Mathematics\\Professor Shai Simonson\\Problem Set 5 Solutions  Combinatorics And
Counting}
C
\begin{document}
\
\maketitle
\
\begin{enumerate}
\item {\bf Given ten points in the plane with no three colinear,}
\begin{enumerate}
\item {\bf How many different segments joining two points are there?}
$$
{10 \choose 2} = 45
$$
\item {\bf How many ways are there to choose a directed path of length two through
three distinct points?}
t
We can choose a directed path of length two uniquely by choosing the
starting point, the middle point, and the end point.
There are $10
\cdot 9 \cdot 8 = 720$ such paths.
\
\item {\bf How many different triangles are there?}
\
There are ${10 \choose 3} = 120$ triangles.
Note that each triangle corresponds to
six directed paths of length two  we can choose which two edges and the
direction.
\item {\bf How many ways are there to choose 4 segments?}
$${45 \choose 4} = 148,995$$
\item {\bf If you choose 4 segments at random, what is the chance that some three
form a triangle?}
f
The number of ways to choose four segments that include a triangle is
$$
{10 \choose 3} \cdot 42 = 5,040
$$
We first pick the three vertices that will form the triangle, then choose any one
of the 42 remaining segments.
The probability that we have picked such ana
rrangement when picking four segments at random is therefore $\frac{5,040}{148,995}
\approx 3.38\%$.
\end{enumerate}
\
\medskip
\
\item {\bf Forty equally skilled teams play a tournament in which every team plays
every other team exactly once, and there are not ties.}
e
\begin{enumerate}
\item {\bf How many different games were played?}
$$
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document{40 \choose 2} = 780
$$
\item {\bf How many different possible outcomes for these games are
there?}
t
Each of the 780 games has two possible outcomes, so the total
number of different outcomes is
$$2^{780}$$.
\item {\bf How many different ways are there for each team to win a different
number of games?}
n
If each team wins a different number of games, this corresponds to a unique
ordering of the teams.
There are $40!$ such orderings.
\end{enumerate}
\
\medskip
\
\item {\bf Let $C(n,k)$ be the number of ways to choose $k$ objects from a set of
$n$.
Prove by a combinatorial argument:}
\begin{enumerate}
\item {\bf $C(n,0)+C(n,1)+\ldots+C(n,n)=2^n$}
\
On the left hand side, we have the total number of subsets of a set of
size $n$, which is the sum of the number of possible subsets of each
size.
On the right hand side, we have the size of the power set of a
set of $n$ elements.
These are equal.
s
\item {\bf $C(n,m)C(m,k) = C(n,k)C(nk,mk)$}
\
To choose a subset $S_m$ of size $m$ and an ``inner'' subset $S_k
\subset S_m$ of size $k$ from an original set $S_n$ of $n$ members, we
may proceed by first choosing $S_m$, then choosing members of the
``inner'' subset $S_k$ from among $S_m$ (the left hand side).
This is the end of the preview. Sign up
to
access the rest of the document.
 Spring '09

Click to edit the document details