\documentclass[12pt]{article}

\usepackage[margin=0.7in]{geometry}

\usepackage{fancyhdr,lastpage}

\usepackage{amsmath,amsfonts,amssymb,amsthm}
\newtheorem{prop}{Proposition}
\newtheorem{thm}{Theorem}
\newtheorem{lem}{Lemma}
\newtheorem{conj}{Conjecture}
\newtheorem{cor}{Corollary}
\theoremstyle{definition}
\newtheorem{defn}{Definition}

\pagestyle{fancy}

\lhead{MATH 311-01}
\chead{Problem of the Day}
\rhead{YOUR NAME HERE}
\lfoot{}
\cfoot{Page \thepage\ of \pageref{LastPage}}
\rfoot{\textbf{due November 30, 2013}}
\begin{document}
\emph{There are eight different combinations of behaviors for
  relations which could be described by the three well-known
  properties: a relation could be either reflexive or non-reflexive,
  symmetric or non-symmetric, and transitive or non-transitive. For
  each of the eight possible combinations of properties, describe a
  relation which has that property. You may either name a set and a
  standard criterion/relation on that set (e.g. ``the set $\mathbb R$
  with the relation $<$'') or identify a finite set and then explicity
  write out the relation on that set as a set of ordered pairs.}

\end{document}
