- #1

ak_89

- 5

- 0

1. Prove that the prime divisors, p cannot equal 3, of the integer n

^{2}-n+1 have the form 6k+1. (Hint: turn this into a statement about (-3/p) )

2. Show that if p is congruent to 1 (mod 4), then x

^{2}is congruent to -1 (mod p) has a solution given by the least residue (mod p) of ( (p-1)/2)!

I honestly have no idea how to start. I would greatly appreciate some help.

Thanks