<?xml version="1.0" encoding="UTF-8"?>

<record version="3" id="8424">
 <title>cases when minus one is a quadratic residue</title>
 <name>1IsQuadraticResidueIfAndOnlyIfPequiv1Mod4</name>
 <created>2006-10-06 13:53:17</created>
 <modified>2006-10-07 10:49:15</modified>
 <type>Theorem</type>
<parent id="622">quadratic residue</parent>
 <creator id="2414" name="alozano"/>
 <author id="2414" name="alozano"/>
 <classification>
	<category scheme="msc" code="11A15"/>
 </classification>
 <related>
	<object name="EulersCriterion"/>
	<object name="ValuesOfTheLegendreSymbol"/>
 </related>
 <preamble>% this is the default PlanetMath preamble.  as your knowledge
% of TeX increases, you will probably want to edit this, but
% it should be fine as is for beginners.

% almost certainly you want these
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsthm}
\usepackage{amsfonts}

% used for TeXing text within eps files
%\usepackage{psfrag}
% need this for including graphics (\includegraphics)
%\usepackage{graphicx}
% for neatly defining theorems and propositions
%\usepackage{amsthm}
% making logically defined graphics
%\usepackage{xypic}

% there are many more packages, add them here as you need them

% define commands here

\newtheorem*{thm}{Theorem}
\newtheorem{defn}{Definition}
\newtheorem{prop}{Proposition}
\newtheorem{lemma}{Lemma}
\newtheorem{cor}{Corollary}

\theoremstyle{definition}
\newtheorem{exa}{Example}

% Some sets
\newcommand{\Nats}{\mathbb{N}}
\newcommand{\Ints}{\mathbb{Z}}
\newcommand{\Reals}{\mathbb{R}}
\newcommand{\Complex}{\mathbb{C}}
\newcommand{\Rats}{\mathbb{Q}}
\newcommand{\Gal}{\operatorname{Gal}}
\newcommand{\Cl}{\operatorname{Cl}}</preamble>
 <content>\begin{thm}
Let $p$ be an odd prime. Then $-1$ is a quadratic residue modulo $p$ if and only if $p\equiv 1 \mod 4$.
\end{thm}
\begin{proof}
Let $p$ be an odd prime. Notice that $p$ is congruent to either $1$ or $3$ modulo $4$. By the definition of the Legendre symbol, we need to verify that 
$\displaystyle \left(\frac{-1}{p}\right) = 1$ if and only if $p\equiv 1 \mod 4$. By Euler's criterion $$\left(\frac{-1}{p}\right)\equiv (-1)^{(p-1)/2} \mod p.$$
Finally, note that the integer $\displaystyle \frac{p-1}{2}$ is even if $p\equiv 1 \mod 4$ and odd if $p\equiv 3 \mod 4$.
\end{proof}</content>
</record>
