New Reply

Congruence Proof

 
Share Thread Thread Tools
Apr2-11, 04:31 AM   #1
 

Congruence Proof


Show that x^2 + y^2 + 1 ≡ 0 (mod p) is soluble for any odd prime p. Then show that x^2 + y^2 + 1 ≡ 0 (mod m) is soluble for any squarefree odd m.


In the early parts of the exercise, I have so far shown that x^2 ≡ y^2 (mod p) if and only if x ≡ +/- y (mod p).

I have also shown that there are precisely (p+1)/2 integers u in {0,1,...,p-1} such that u ≡ x^2 (mod p) for some x.

Though I am unsure as to how to further proceed. Any help you can offer in how to proceed would be very much appreciated!

Many thanks!
 
PhysOrg.com
PhysOrg
science news on PhysOrg.com

>> 'Whodunnit' of Irish potato famine solved
>> The mammoth's lament: Study shows how cosmic impact sparked devastating climate change
>> Curiosity Mars rover drills second rock target
New Reply
Thread Tools


Similar Threads for: Congruence Proof
Thread Forum Replies
Congruence proof Calculus & Beyond Homework 8
Proof of Congruence Transformation Linear & Abstract Algebra 3
Congruence sum proof Calculus & Beyond Homework 9
congruence proof Calculus & Beyond Homework 4
Congruence Class - Proof of a number divisble by 7 Linear & Abstract Algebra 0