\documentclass{article}
\usepackage{amsmath, amssymb, amsthm}
\usepackage[margin=0.5in]{geometry}
\usepackage{hyperref}
\usepackage{tikz}
\newcommand{\scs}[1]{\begin{scshape}#1\end{scshape}}
%\newcommand{\inv}{^{-1}}
\newcommand{\ZZ}{\mathbb{Z}}
\newcommand{\NN}{\mathbb{N}}
\newcommand{\RR}{\mathbb{R}}
\newtheorem{proposition}{Proposition}
\theoremstyle{definition}
\newtheorem{definition}{Definition}
\newtheorem{problem}{}
\newcommand{\prob}[1]{\begin{problem}#1\end{problem}} %\vfill}
\newcommand{\dfn}[1]{\begin{definition}#1\end{definition}}
\newcommand{\abs}[1]{\left| #1 \right|}
\newcommand{\m}[1][n]{\left(\text{mod}\ #1\right)}
\begin{document} \pagestyle{empty} \begin{flushleft}
%\scs{Name(s):}
\scs{Math 301 \hfill Final Problems \hfill April 27, 2015}
\vspace{.05in}
\scs{Instructions:} Solve two of these problems for your final portfolio entry and write them nicely along with one other problem from homework, exam 2, or a worksheet.
Your final portfolio should be one PDF document consisting of 8 solutions.
See the \href{http://web02.gonzaga.edu/faculty/axon/301/syllabus.pdf}{syllabus} and \href{http://www.people.vcu.edu/~rhammack/BookOfProof/Contrapositive.pdf}{section 5.3} of \underline{The Book of Proof} for some suggestions and guidelines for writing.
The final portfolio is due by email by 12:00 pm (noon) on Friday, May 8.
\dfn{
A figure in the plane is {\em convex} if for any two points in the figure, the line segment connecting the two points lies within the figure.
}
\prob{
A well known theorem of geometry states that the sum of the interior angles of a triangle must be $180^{\circ}$.
\begin{itemize}
\item[a) ] Determine the sum of the interior angles of any convex quadrilateral.
\item[b) ] Determine the sum of the interior angles of any convex pentagon.
\item[c) ] Let $n$ be a natural number greater than 2.
Make a conjecture about the sum of the interior angles of a convex figure with $n$ sides.
Prove your conjecture.
\end{itemize}
}
\prob{
Prove that for any $n \in \NN$, a set with $n$ elements has $\frac{n(n-1)}{2}$ two-element subsets.
}
\prob{
Let $n \in \NN$ and $a,b \in \ZZ$.
Prove that if $a \equiv b \m$, then $a^k \equiv b^k \m$ for every $k \in \NN$.
}
\prob{
Prove that the sum of the cubes of any 3 consecutive natural numbers is divisible by 9.
}
\prob{
For which natural numbers $n$ is $n^2 < 2^n$?
Prove that you are correct.
}
\prob{
Consider the equation \begin{equation} \label{eqn1}
x^5 + x^4 + x^3 + x^2 + 1 = 0
\end{equation}
\begin{itemize}
\item[a) ] Prove that equation \ref{eqn1} has at least one real solution.
\item[b) ] Prove that equation \ref{eqn1} has no rational solution.
\end{itemize}
}
\prob{
The game of Chomp is played on an $m \times n$ array of squares with the top left square missing (an example of a possible board is shown below).
Two players take turns picking a square and removing it along with all squares below it, to the right of it, or both.
The player who chomps the last square wins.
Prove that the player who plays first must have a winning strategy regardless of the dimensions of the board.
Hint: there is a simple non-constructive proof (and no one seems to know the actual winning strategy).
}
\end{flushleft}
\begin{center}
\begin{tikzpicture}
\draw (0,0) -- (6,0) -- (6,3) -- (1,3) -- (1,2) -- (0,2) -- (0,0);
\draw (0,1) -- (6,1);
\draw (0,2) -- (6,2);
\foreach \x in {1,2,3,4,5} \draw (\x,0) -- (\x,3);
\end{tikzpicture}
\end{center}
\end{document}