\documentclass[12pt]{article}
\usepackage{amsmath,amssymb,graphicx,txfonts,multicol,picins}
\usepackage[setpagesize=false]{hyperref}
\usepackage[usenames,dvipsnames]{xcolor}
\usepackage[setpagesize=false]{hyperref}\hypersetup{colorlinks,
  linkcolor={blue!50!black},
  citecolor={blue!50!black},
  urlcolor=blue
}

\paperwidth 8in
\paperheight 10.5in
\textwidth 8in
\textheight 10.5in
\oddsidemargin -0.75in
\evensidemargin \oddsidemargin
\topmargin -0.75in
\headheight 0in
\headsep 0in
\footskip 0in
\parindent 0in
\setlength{\topsep}{0pt}
\pagestyle{empty}

\def\myurl{http://www.math.toronto.edu/~drorbn/}

\def\bbC{{\mathbb C}}
\def\bbF{{\mathbb F}}
\def\bbN{{\mathbb N}}
\def\bbQ{{\mathbb Q}}
\def\bbR{{\mathbb R}}
\def\bbZ{{\mathbb Z}}

\def\imagetop#1{\vtop{\null\hbox{#1}}}

\begin{document}

Name (Last, First): $\underline{\hspace{3in}}$ \hfill Student ID: $\underline{\hspace{2in}}$

\vskip 2mm

{\small
  \href{\myurl}{Dror Bar-Natan}:
  \href{\myurl/classes/}{Classes}:
  \href{\myurl/classes/\#1516}{2015-16}:
  \href{\myurl/classes/16-475-ProblemSolving}{MAT 475 Problem Solving Seminar}:
  \hfill\url{http://drorbn.net/16-475}
}

\vskip 3mm

{\large\bf Quiz 6} on March 3, 2016: ``Exploit Symmetry''. You have 25 minutes to solve 2 of problems 1--3 below. Please write on both sides of the page. \hfill {\bf Good Luck!}

\vskip 2mm

\noindent{\bf Problem 1.} Prove: You cannot colour the points of the plane with just three colours, so that no two points of distance 1 will be coloured with the same colour.

\parpic[r]{\includegraphics[width=1.6in]{../15-475-ProblemSolving/15Pennies.pdf}}
\noindent{\bf Problem 2} (Larson's 1.6.7). The faces of 15 pennies, packed as shown on the right, are each showing either H (for ``Head''), or T (for ``Tail''). Prove that there exist three pennies showing the same symbol and whose centres form the vertices of an equilateral triangle.
\newline
{\bf Bonus} (2 points, even if you didn't solve the above). If the pennies pattern of the above problem was continued to cover the entire plane, which of the 17 tiling patterns would it be (ignoring the H/T symbols)?
\newline
{\bf Problem 3} (Larson's 1.6.2e). Of all the $n$-gons which can be inscribed in a given circle, which has the greatest area?
\newline{\bf Problem 4} (no credit, yet the best solutions will be advertised). What is your favourite ``Exploit Symmetry'' problem?

\end{document}

