%%% Preamble starts here.
\documentclass{math215}

% Include any special packages you might use.  Uncomment the
% following to use Times as the default font insteand of
% TeX's default font of Computer Modern.
\usepackage{times,txfonts}

% The following commands set up the material that appears
% in the header.
\doclabel{Math 215: Homework 11}
\docauthor{Your name here}
\docdate{April 12, 2013}

% I've provided a file (math215extras.tex) with some commonly used extra 
% commands. If you've downloaded it, you can include it in your document
% by uncommenting the line below.  Feel free to make changes to that file.
\input{math215extras.tex}

%%%% Main document starts here.

\begin{document}

\begin{project}{6.27} Finish your work on this project.
Specifically, state and prove a proposition that
characterizes the set of $n\ge 2$ such that
$\Ints_n$ satisfies the cancellation property (Axiom 1.5).  You can
opt to prove either Axiom 1.5 or its equivalent version Proposition 1.26.
\end{project}

\begin{lemma}{6.B}  Suppose $a,b\in \Ints$, $g\in \Ints_{\ge 0}$,
and
\begin{itemize}
  \item[(1)] $g\mid a$ and $g\mid b$
  \item[(2)] For all $d\in\Ints$ such that $d\mid a$ and $d\mid b$, $d\mid g$.
\end{itemize}
Then $g=\gcd(a,b)$.
\end{lemma}
\begin{proof}
Your proof goes here.
\end{proof}
  
\begin{lemma}{6.C}  Suppose $p$ is prime and $a\in\Ints$.  
  Then either $p\mid a$ or $\gcd(p,a)=1$.
\end{lemma}
\begin{proof}
Your proof goes here.
\end{proof}

\begin{proposition}{6.30}
For all $k$, $m$, $n\in\Ints$, 
\[
\gcd(km,kn)=|k|\gcd(m,n)
\]
\end{proposition}

\end{document}