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

<record version="12" id="12">
 <title>quadratic reciprocity rule</title>
 <name>QuadraticReciprocityRule</name>
 <created>2001-08-13 10:23:16</created>
 <modified>2007-06-19 20:52:32</modified>
 <type>Theorem</type>
 <creator id="2414" name="alozano"/>
 <author id="2414" name="alozano"/>
 <author id="2727" name="mathcam"/>
 <author id="2" name="akrowne"/>
 <classification>
	<category scheme="msc" code="11A15"/>
 </classification>
 <synonyms>
	<synonym concept="quadratic reciprocity rule" alias="quadratic reciprocity"/>
 </synonyms>
 <related>
	<object name="EulersCriterion"/>
	<object name="CubicReciprocityLaw"/>
	<object name="QuadraticReciprocityForPolynomials"/>
	<object name="LegendreSymbol"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsthm}
\usepackage{amsfonts}
\usepackage{graphicx}
\usepackage{xypic}

\newtheorem*{thm}{Theorem}</preamble>
 <content>\begin{thm}[Law of Quadratic Reciprocity]
Let $p$ and $q$ be two distinct odd primes. Then:

$$ \left(\frac{q}{p}\right)\left(\frac{p}{q}\right)=(-1)^{(p-1)(q-1)/4} $$

where $\left(\frac{\cdot}{\cdot}\right)$ is the \PMlinkname{Jacobi}{JacobiSymbol}  symbol (or Legendre symbol).
\end{thm}

The following is an equivalent formulation of the Law of Quadratic Reciprocity: 

\begin{thm}[Quadratic Reciprocity (second form)]
Let $p,q$ be distinct odd primes. Then:
\begin{enumerate}
\item $\displaystyle \left(\frac{p}{q}\right) = \left(\frac{q}{p}\right)$ if one of $p$ or $q$ is congruent to $1$ modulo $4$;

\item $\displaystyle \left(\frac{p}{q}\right) = - \left(\frac{q}{p}\right)$ if both $p$ and $q$ are congruent to $3$ modulo $4$.
\end{enumerate}
\end{thm}</content>
</record>
