Results 1 to 4 of 4

Math Help - One Congruence Problem

  1. #1
    Member
    Joined
    Nov 2008
    Posts
    152

    One Congruence Problem

    I'm struggling with this one:

    How many incongruent solutions are there to the congruence x^5 + x - 6 = 0(mod 144)?

    I know I have to use Hensel's Lemma here. But the examples I've seen the mod is easily factored (e.g. 27 = 3^3, or 25 = 5^2) so those examples aren't exactly the same as what is presented here I'm guessing since 144 is 2^4 * 3^2
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor undefined's Avatar
    Joined
    Mar 2010
    From
    Chicago
    Posts
    2,340
    Awards
    1
    Quote Originally Posted by Janu42 View Post
    I'm struggling with this one:

    How many incongruent solutions are there to the congruence x^5 + x - 6 = 0(mod 144)?

    I know I have to use Hensel's Lemma here. But the examples I've seen the mod is easily factored (e.g. 27 = 3^3, or 25 = 5^2) so those examples aren't exactly the same as what is presented here I'm guessing since 144 is 2^4 * 3^2
    If you solve mod 2^4 and mod 3^2 then you can combine with the Chinese Remainder Theorem.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Member
    Joined
    Nov 2008
    Posts
    152
    OK but it's asking me how many incongruent solutions there are, so how does that work? There's not necessarily just one solution right?
    Follow Math Help Forum on Facebook and Google+

  4. #4
    MHF Contributor undefined's Avatar
    Joined
    Mar 2010
    From
    Chicago
    Posts
    2,340
    Awards
    1
    Quote Originally Posted by Janu42 View Post
    OK but it's asking me how many incongruent solutions there are, so how does that work? There's not necessarily just one solution right?
    Oh right, you only have to count the solutions, not find them.

    Well if you count n distinct (that is, incongruent) solutions mod 2^4 and m distinct solutions mod 3^2, then the number of distinct solutions mod 144 is nm by CRT.

    To be honest I've only worked a little bit with Hensel's lemma so if you have a hard time finding n and m I may not be of much help, in that case someone else will probably step in.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. [SOLVED] Congruence Problem
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: June 18th 2011, 09:23 PM
  2. congruence problem
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: December 14th 2009, 07:53 PM
  3. Congruence problem with gcd
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: May 9th 2009, 12:18 AM
  4. Another congruence problem
    Posted in the Number Theory Forum
    Replies: 10
    Last Post: April 3rd 2009, 05:14 PM
  5. Congruence Problem
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: March 9th 2009, 02:14 AM

Search Tags


/mathhelpforum @mathhelpforum