02.08.2013 Views

15 Squares mod p

15 Squares mod p

15 Squares mod p

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Note: Since p is odd, if a p−1<br />

2 ≡ b p−1<br />

2 (<strong>mod</strong> p), for some a, b prime to p, then<br />

). (∗) reduces finding ( a<br />

p<br />

( a<br />

b )=(b p<br />

(i) a = −1<br />

(ii) a =2<br />

(iii) a = q, an odd prime = p<br />

We have already proved<br />

(i)<br />

(ii)<br />

<br />

−1<br />

p<br />

=(−1) p−1<br />

2 =<br />

) to the three cases<br />

<br />

1, if p ≡ 1(<strong>mod</strong>4)<br />

−1, if p ≡−1(<strong>mod</strong>4)<br />

<br />

2 1, if p ≡±1(<strong>mod</strong>8)<br />

=<br />

p −1, if p ≡±5(<strong>mod</strong>8)<br />

(iii) q: odd prime = p. <br />

q<br />

=?<br />

p<br />

10

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!