\documentclass[11pt]{article}
\usepackage{jeffe,handout,multicol,tikz,kgm}

\newcommand{\kgmcomment}[1]{}
\renewcommand{\gcd}{\mathrm{gcd}}

\begin{document}
\headers{Math373}{Homework 2}{Due Fri, Jan. 24, 2014}

%\makeatletter
%\def\@oddfoot{\hfill \tikz \node[draw] {over} ; }
%\makeatother

%\newcommand{\seq}[1]{\left\langle #1\right\rangle}

\makeatletter
\def\@oddfoot{}
\makeatother

\noindent
\textbf{Directions:} Solve the following problems.  All written work must be your own.  See the course syllabus for detailed rules.

\begin{enumerate}

\item Let $a$, $a'$, $b$, $b'$, and $m$ be integers such that $a\equiv a' \pmod{m}$ and $b\equiv b' \pmod{m}$.  Prove that $a+a'\equiv b+b' \pmod{m}$.

\end{enumerate}
\end{document}
