\documentclass[10pt]{article}

\usepackage[margin=1in]{geometry}
\usepackage[small]{titlesec}
\usepackage{palatino, mathpazo}
\usepackage{inconsolata}
\usepackage{amsmath, amssymb, amsthm}
\usepackage{enumerate}
\usepackage{graphicx}
\usepackage[normalem]{ulem}


\newcommand{\ds}{\displaystyle}
\newcommand{\Z}{\mathbb{Z}}
\newcommand{\N}{\mathbb{N}}
\newcommand{\R}{\mathbb{R}}
\newcommand{\C}{\mathbb{C}}
\newcommand{\E}{\mathbb{E}}
\newcommand{\Var}{\operatorname{Var}}
\renewcommand{\P}{\mathbb{P}}
\newcommand{\PP}{\mathcal{P}}

\setlength{\parindent}{0pt}
\setlength{\parskip}{1.5ex}

\title{\sc Math 2100 / 2350 -- Homework 5}
\author{
	Fall 2020\\[10pt]
	due Wednesday, \textbf{November 11},
	\underline{on D2L, by the beginning of class}\\[10pt]
	Sections 2.3, 2.4, 2.5
}
\date{}
\begin{document}
\maketitle

\begin{center} 
	\emph{This homework assignment was written in \LaTeX{}. You can find the source code on the course website.}
\end{center}

\textbf{Instructions:} This assignment is due on D2L at the \emph{beginning} of class. It must be typed in Latex (other formats such as Word are not acceptable). \textbf{You must submit the .pdf file, but you do not have to submit the .tex file unless I ask for it} Any pictures can be drawn by hand and added to the Latex file with the ``$\backslash$includegraphics'' command (see how I do it in this document). Please write the questions in the correct order. Explain all reasoning.

\textbf{Note:} \emph{\underline{You no longer need to include your scratch work with each proof.}}

\begin{enumerate}	
	\item Prove that for all positive integers $n \geq 2$, the number $2^{3n}-1$ is not prime. (\emph{Hint:} Proving something stronger makes this exercise easier. Prove that $7$ divides $2^{3n}-1$ for all $n \geq 2$.)

	\item Prove that for all positive integers $n \geq 4$,
	\[
		n! > 2^n.
	\]
	
	\item Suppose you have an unlimited supply of $5$-cent and $8$-cent stamps at your disposal. Find the smallest value of $N$ so that the statement ``You can use just combinations of these stamps to make $n$ cents in postage for all $n \geq N$'' is true, and prove the statement by induction. (It may help to think about having multiple base cases that cover not just the first case, but the first few.)

		\item Prove that for all positive integers $n$,
	\[
		1^3 + 2^3 + \cdots + n^3 = (1 + 2 + \cdots + n)^2.
	\]

	\item Prove that at a completely full Milwaukee Bucks game at the Fiserv Forum, there \emph{must} be at least two people that have both the same birthday \emph{and} the same first initial. (Note: you will have to look up the capacity of the arena!)

	\item Use the pigeonhole principle to prove that given any five integers, there will be two that have a sum or difference divisible by 7.
	
	\item Prove that if any five points other than $(0,0)$ are placed on the coordinate plane, then there are two points, call them $A$ and $B$, such that the angle formed by the rays from $(0,0)$ to $A$ and from $(0,0)$ to $B$ is acute.
		
	\item Use a proof by contradiction to prove that an even perfect square cannot have the form $4k+2$.

	\item Prove that if $a + b + c \geq 35$, then either $a \geq 10$, $b \geq 12$, or $c \geq 13$.

	


\end{enumerate}
\end{document}


