\documentclass[12pt,ifthen]{article}
\usepackage{amsmath}
\usepackage{hyperref}
\newcommand{\N}{{\sf N}}
\newcommand{\Q}{{\sf Q}}
\newcommand{\Z}{{\sf Z}}
\newcommand{\into}{{\rightarrow}}
\newcommand{\st}{\mathrel{:}}

\begin{document}

\centerline{\bf Homework 2, Morally Due Tue Feb 18, 2020 at 3:30PM}

\begin{enumerate}

\item
(0 points)
What is your name?  Write it clearly.
When is the midterm tentatively scheduled (give Date and Time)?
If you cannot make it in that day/time see me ASAP.

\item
(100 points)
For all $a\ge 3$ find a function $f_a$ such that the following holds,
and prove it.

{\it For every 2-coloring of $\binom{[f_a(k)]}{a}$ there exists
a homogeneous set of size $k$.}

Your function $f$ should  be a stack of some number of $2$'s, roughly $a$ of them.
Your proof should be by induction on $a$.

\end{enumerate}

\end{document}