A question about quadratic residues

  • Context: Undergrad 
  • Thread starter Thread starter yeland404
  • Start date Start date
  • Tags Tags
    Quadratic
yeland404
Messages
23
Reaction score
0
I need to prove that a be a odd integer that congruence X^2[itex]\equiv[/itex]a mod 2
is always solvable with exactly one incongruent solution modulo 2.
this question is linked with (b) let a be an odd integer. Prove that the congruence X^2[itex]\equiv[/itex]a mod 4 is solvable iff a[itex]\equiv[/itex]1 mod 4. in this case ,prove that X^2[itex]\equiv[/itex]a mod 4solutions has exactly two incongruent
solutions modulo 4.

these two seem to link with each other. And the proposition I learn is X^2[itex]\equiv[/itex]a mod p has either no solution or two solutions, but p there is an odd prime number. HOw to apply to the queations above?
 
You should be able to just check these by hand. For example does x^2=2 (mod 4) have any solutions? Just plug in 0,1,2,3 for x and see what you get
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
Replies
2
Views
4K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
9K