Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Modular Arithmetic and Diophantine Equations

  1. Oct 25, 2012 #1
    If one is solving a modular equation:

    [itex]4k \equiv 1 \: (\text{mod } n)[/itex]

    with n even, known, for k, then one needs to find the inverse of 4 modulo n:

    [itex] 4x - 1 = nc [/itex]
    [itex] 4x - nc = 1 [/itex]

    But this only has solutions iif (4,n) = 2 (n is even, but not a multiple of 4), which doesn't divide 1, so there is no inverse of 4 modulo n. Does this mean that there isn't a k that satisfies the original equation?

  2. jcsd
  3. Oct 25, 2012 #2


    User Avatar
    Science Advisor
    Homework Helper

    hi drewfstr314! :smile:

    that's right :smile:

    4k is even, and 1 (mod n) is odd (since n is even), so there's no solution …

    what is worrying you about that? :confused:
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Similar Discussions: Modular Arithmetic and Diophantine Equations
  1. Modular arithmetic (Replies: 11)

  2. Diophantine Equation (Replies: 1)

  3. Modular arithmetic (Replies: 1)

  4. Modular arithmetic (Replies: 4)

  5. Diophantine equation (Replies: 3)