Solutions to x^2==22(mod103) in Z103

  • Thread starter clueles
  • Start date
In summary, to find the number of solutions in z103 for the equation x^2==22(mod103), you need to determine the value of the Legendre symbol \left(\frac{22}{103}\right). This can be done using the 3-part Law of Quadratic Reciprocity, which involves calculating the Legendre symbol for -1, 2, and the quotient of p and a.
  • #1
clueles
15
0
find the number of solutions in z103

x^2==22(mod103)
 
Physics news on Phys.org
  • #2
Have you seen quadratic reciprocity?
 
  • #3
no i haven't
 
  • #4
Legendre symbol?
 
  • #5
The Legendre symbol [tex]\left(\frac{a}{p}\right)[/tex] is defined as 1 if [tex]x^2\equiv a\pmod p[/tex] has solutions, and -1 otherwise. (It's undefined or 0 if [tex]p\mid a[/tex].)

Thus for [tex]x^2\equiv22\pmod{103}[/tex] you're trying to decide the value of the Legendre symbol [tex]\left(\frac{22}{103}\right)[/tex].

Here's the 3-part Law of Quadratic Reciprocity:

[tex]\left(\frac{-1}{p}\right)=(-1)^{\frac{p-1}{2}}[/tex]

[tex]\left(\frac{2}{p}\right)=(-1)^{\frac{p^2-1}{8}}[/tex]

[tex]\left(\frac{a}{p}\right)=(-1)^{\frac{(p-1)(a-1)}{4}}\left(\frac{p}{a}\right)[/tex]

(If you're using a definition that doesn't include 0, you can move the two Legendre symbols to the same side for aesthetics.)
 

FAQ: Solutions to x^2==22(mod103) in Z103

What is the definition of a "solution" in this context?

A solution in this context refers to a number that, when squared, is equivalent to 22 modulo 103 in the set of integers modulo 103 (also known as Z103).

How many solutions are there to this equation?

In the set of integers modulo 103, there are either two solutions or no solutions to this equation. This is because the set of integers modulo 103 has a total of 103 elements, and for any given number, there can only be two possible square roots modulo 103.

How can I find the solutions to this equation?

There are a few methods for finding solutions to this equation in Z103. One approach is to use trial and error, plugging in different numbers and checking if their square is equivalent to 22 modulo 103. Another method is to use modular arithmetic and algebraic manipulation to simplify the equation and find the solutions.

Can there be more than one solution for a given number in Z103?

No, there can only be a maximum of two solutions for a given number in Z103. This is because of the nature of modular arithmetic - for any given number, there can only be two possible square roots modulo 103.

Are there other ways to represent the solutions to this equation?

Yes, instead of using the set of integers modulo 103, the solutions to this equation can also be represented using congruence notation. For example, if x is a solution, then x ≡ ± √22 (mod 103). This notation indicates that x is equivalent to either the positive or negative square root of 22 modulo 103.

Similar threads

Replies
12
Views
2K
Replies
3
Views
1K
Replies
1
Views
1K
Replies
1
Views
947
Replies
6
Views
2K
Back
Top