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

<record version="9" id="183">
 <title>Legendre symbol</title>
 <name>LegendreSymbol</name>
 <created>2001-10-08 17:21:40</created>
 <modified>2008-01-25 16:50:41</modified>
 <type>Definition</type>
 <creator id="2414" name="alozano"/>
 <author id="2872" name="pahio"/>
 <author id="6075" name="rspuzio"/>
 <author id="2727" name="mathcam"/>
 <author id="3" name="drini"/>
 <classification>
	<category scheme="msc" code="11-00"/>
 </classification>
 <related>
	<object name="JacobiSymbol"/>
	<object name="EulersCriterion"/>
	<object name="QuadraticResidue"/>
	<object name="KroneckerSymbol"/>
	<object name="QuadraticReciprocityRule"/>
	<object name="QuadraticCongruence"/>
 </related>
 <keywords>
	<term>Legendre</term>
	<term>Character</term>
	<term>Jacobi</term>
 </keywords>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{graphicx}</preamble>
 <content>\textbf{Legendre Symbol.}\\
Let $p$ be an odd prime. The \emph{Legendre symbol} $\left(\frac{a}{p}\right)$ or $(a|p)$ is defined as:
\[
\left(\frac{a}{p}\right) =
\begin{cases}
1 &amp;\text{if }a \text{ is a quadratic residue }\pmod{p}\\
-1 &amp;\text{if }a \text{ is a quadratic nonresidue }\pmod{p}\\
0 &amp; \text{if } p \text{ divides }a
\end{cases}
\]

The Legendre symbol can be computed by means of Euler's criterion or Gauss' lemma.

Generalizations of this symbol are the Jacobi Symbol and the Kronecker symbol.</content>
</record>
