%\documentclass[a4paper,twoside,draft]{article}
\documentclass[a4paper,twoside,draft]{amsart}

\title{Number-theory exercises, IV}
\author{David Pierce}
\date{\today}

\address{Mathematics Dept\\
Middle East Technical University\\
Ankara 06531, Turkey}

\email{dpierce@metu.edu.tr}
\urladdr{http://www.math.metu.edu.tr/~dpierce}


\usepackage{amssymb,amsmath,amsthm}
%\usepackage{amscd}     % commutative diagram
%\usepackage[mathscr]{euscript}
\usepackage{url}
\usepackage{verbatim}  % allows a comment environment:

%\usepackage{parskip}   % paragraphs not indented, but separated by spaces

\usepackage{eco}  % gives old-style numerals

\input{abbrevs}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%  Theorem-like environments  %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

%\swapnumbers


%\newtheorem{theorem}{Theorem}
%\newtheorem{axdef}[theorem]{Axiom and definition}
%\newtheorem{lemma}[theorem]{Lemma}

\theoremstyle{definition}

%\newtheorem{definition}[theorem]{Definition}
%\newtheorem{parag}[theorem]{}
%\newtheorem{ex}[theorem]{Exercise}
\newtheorem{ex}{Exercise}

\theoremstyle{remark}

%\newtheorem{remarks}[theorem]{Remarks}
%\newtheorem{remark}[theorem]{Remark}

%\newcommand{\rmk}[1]{\marginpar[\flushright#1]{\flushleft#1}}

\begin{document}
  \maketitle\thispagestyle{empty}

  \begin{ex}
    Prove that the following are equivalent:
    \begin{enumerate}
      \item
Every even integer greater than $2$ is the sum of two primes.
\item
Every integer greater than $5$ is the sum of three primes.
    \end{enumerate}
  \end{ex}

  \begin{ex}
    Infinitely many primes are congruent to $-1$ \emph{modulo} $6$.
  \end{ex}

  \begin{ex}
    Find all $n$ such that
    \begin{enumerate}
      \item
$n!$ is square;
\item
$n!+(n+1)!+(n+2)!$ is square.
    \end{enumerate}
  \end{ex}

  \begin{ex}
    Determine whether $a^2\equiv b^2\pmod n\implies a\equiv b\pmod
    n$. 
  \end{ex}

  \begin{ex}
    Compute $\sum_{k=1}^{1001}k^{365}\pmod 5$.
  \end{ex}

  \begin{ex}
    $39\divides 53^{103}+103^{53}$.
  \end{ex}

  \begin{ex}
  Solve  $6^{n+2}+7^{2n+1}\equiv x\pmod{43}$.
  \end{ex}

  \begin{ex}
    Determine whether $a\equiv b\pmod n\implies c^a\equiv c^b\pmod
    n$. 
  \end{ex}

  \begin{ex}
    Determine $r$ such that $a\equiv b\pmod r$ whenever $a\equiv
    b\pmod m$ and $a\equiv b\pmod n$. 
  \end{ex}

  \begin{ex}
    Solve the system
    \begin{equation*}
      \begin{cases}
	x\equiv 1\pmod{17},\\
	x\equiv 8\pmod{19},\\
	x\equiv 16\pmod{21}.
      \end{cases}
    \end{equation*}
  \end{ex}

  \begin{ex}
    The system
    \begin{equation*}
    \begin{cases}
      x\equiv a\mod n\\
      x\equiv b\mod m
    \end{cases}
    \end{equation*}
has a solution if and only if $\gcd(n,m)\divides b-a$.
  \end{ex}

%\bibliographystyle{plain}
%\bibliography{../../../TeX/references}

%\layout


\end{document}