Results 1 to 2 of 2

Math Help - incongruent solutions

  1. #1
    Member
    Joined
    Apr 2010
    Posts
    133

    incongruent solutions

    Show that the congruence x^2≡1 (mod 2^k) has exactly four incongruent solutions, namely x≡(+-)1 or (+-)(1+2^(k-1)) (mod 2^k), when k>2. Show that when k=1 there is one solution and that when k=2 there are two incongruent solutions.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor chiph588@'s Avatar
    Joined
    Sep 2008
    From
    Champaign, Illinois
    Posts
    1,163
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. incongruent integers
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: October 8th 2009, 05:43 PM
  2. incongruent primitive roots
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: November 9th 2008, 10:14 AM
  3. incongruent integers
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: November 9th 2008, 10:00 AM
  4. incongruent solutions to (mod n)
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: June 4th 2008, 03:28 PM
  5. 2^n is incongruent to 1 (mod n)
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: January 13th 2007, 02:11 PM

Search Tags


/mathhelpforum @mathhelpforum