Results 1 to 3 of 3

Thread: mod121

  1. #1
    Super Member dhiab's Avatar
    Joined
    May 2009
    From
    ALGERIA
    Posts
    582
    Thanks
    3

    mod121

    Solve in Z : $\displaystyle x^{2}+3x+5\equiv 0 (mod121)$
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Super Member Bacterius's Avatar
    Joined
    Nov 2009
    From
    Wellington
    Posts
    927
    Hello, Dhiab,

    Solution : $\displaystyle x^2 + 3x + 5$ never divides $\displaystyle 121$, so this equation has no solutions in $\displaystyle \mathbb{Z}$

    Proof : $\displaystyle x^2 + 3x + 5 \equiv (x \pmod{121})^2 + 3(x \pmod{121}) + 5 \pmod{121}$. Apply an exhaustive search on $\displaystyle x \in [0,120]$ (since values wrap around beyond this interval), and prove that none of the values of the quadratic modulo $\displaystyle 121$ are divisible by $\displaystyle 121$.

    Sorry, didn't come up with anything smarter yet
    Follow Math Help Forum on Facebook and Google+

  3. #3
    MHF Contributor

    Joined
    Apr 2005
    Posts
    19,728
    Thanks
    3010
    $\displaystyle 121= 11^2$. Obviously $\displaystyle (121)^2+ 3(121)+ 5$ is congruent to 5 (mod 121) and any other number that divides 121 must also divide 11. So it is sufficient to do an "exhaustive search" of numbers in [0, 10].
    Follow Math Help Forum on Facebook and Google+

Search Tags


/mathhelpforum @mathhelpforum