Results 1 to 3 of 3

Math Help - existence of proof in connection to x^2 = y^2 mod n

  1. #1
    Newbie
    Joined
    Oct 2008
    Posts
    5

    existence of proof in connection to x^2 = y^2 mod n

    Let x^2 be less than some integer N. Has anyone proved whether or not there are solutions to y^2 = x^2 mod N for all x^2 <= N?

    For example, if N = 27 are there solutions to all of these congruences:

    y^2 = 4 mod 27
    y^2 = 9 mod 27
    y^2 = 16 mod 27
    y^2 = 25 mod 27
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Member
    Joined
    Aug 2008
    Posts
    120
    Yes namely 2 ,3, 4 and 5 but if you mean two solutions than the answer is also yes because -2, -3, -4, -5 are also solutions.

    However there may be even more solutions because Z27 is not a field. If We are working in a field then the polynomial x^2-4 can have at most two roots but in Z_27 it can have more.

    EG 1 has 4 square roots in Z8 but only two in Zp for prime p.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Oct 2008
    Posts
    5
    Er, forgot to add -- x != y and y^2 > N.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 15
    Last Post: July 16th 2011, 01:22 PM
  2. Replies: 5
    Last Post: October 19th 2010, 11:50 AM
  3. [SOLVED] Existence proof
    Posted in the Number Theory Forum
    Replies: 6
    Last Post: September 23rd 2010, 10:18 AM
  4. existence proof, how to start?
    Posted in the Trigonometry Forum
    Replies: 1
    Last Post: April 12th 2010, 10:34 PM
  5. proof of existence of z in x < z < y
    Posted in the Differential Geometry Forum
    Replies: 3
    Last Post: May 24th 2009, 11:54 AM

Search Tags


/mathhelpforum @mathhelpforum