Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Euler's criterion
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Examples== '''Example 1: Finding primes for which ''a'' is a residue''' Let ''a'' = 17. For which primes ''p'' is 17 a quadratic residue? We can test prime ''p'''s manually given the formula above. In one case, testing ''p'' = 3, we have 17<sup>(3 β 1)/2</sup> = 17<sup>1</sup> β‘ 2 β‘ β1 (mod 3), therefore 17 is not a quadratic residue modulo 3. In another case, testing ''p'' = 13, we have 17<sup>(13 β 1)/2</sup> = 17<sup>6</sup> β‘ 1 (mod 13), therefore 17 is a quadratic residue modulo 13. As confirmation, note that 17 β‘ 4 (mod 13), and 2<sup>2</sup> = 4. We can do these calculations faster by using various modular arithmetic and Legendre symbol properties. If we keep calculating the values, we find: :(17/''p'') = +1 for ''p'' = {13, 19, ...} (17 is a quadratic residue modulo these values) :(17/''p'') = β1 for ''p'' = {3, 5, 7, 11, 23, ...} (17 is not a quadratic residue modulo these values). '''Example 2: Finding residues given a prime modulus ''p'' ''' Which numbers are squares modulo 17 (quadratic residues modulo 17)? We can manually calculate it as: : 1<sup>2</sup> = 1 : 2<sup>2</sup> = 4 : 3<sup>2</sup> = 9 : 4<sup>2</sup> = 16 : 5<sup>2</sup> = 25 β‘ 8 (mod 17) : 6<sup>2</sup> = 36 β‘ 2 (mod 17) : 7<sup>2</sup> = 49 β‘ 15 (mod 17) : 8<sup>2</sup> = 64 β‘ 13 (mod 17). So the set of the quadratic residues modulo 17 is {1,2,4,8,9,13,15,16}. Note that we did not need to calculate squares for the values 9 through 16, as they are all negatives of the previously squared values (e.g. 9 β‘ β8 (mod 17), so 9<sup>2</sup> β‘ (β8)<sup>2</sup> = 64 β‘ 13 (mod 17)). We can find quadratic residues or verify them using the above formula. To test if 2 is a quadratic residue modulo 17, we calculate 2<sup>(17 β 1)/2</sup> = 2<sup>8</sup> β‘ 1 (mod 17), so it is a quadratic residue. To test if 3 is a quadratic residue modulo 17, we calculate 3<sup>(17 β 1)/2</sup> = 3<sup>8</sup> β‘ 16 β‘ β1 (mod 17), so it is not a quadratic residue. Euler's criterion is related to the [[Quadratic reciprocity|law of quadratic reciprocity]].
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
Euler's criterion
(section)
Add topic