Results 1 to 2 of 2

Math Help - indices and ax^n congruent to b mod m

  1. #1
    Junior Member
    Joined
    Sep 2008
    Posts
    55

    indices and ax^n congruent to b mod m

    let a, b be integers such that gcd(a,m) = gcd(b,m) = 1, let n, m be positive integers, let g be a primitive root modulo m.

    Find the necessary and sufficient condition on the index of a (mod m) (denoted I(a) ) and the index of b (mod m) (denoted I(b) ) for the congruence equation ax^n congruent to b (mod m) to have integer solutions.

    I have:

    ax^n congruent to b mod m iff

    I(ax^n) = I(b), which is true iff

    I(ax^n) congruent to I(b) mod (phi(m)) (Phi(m) refers to euler's phi function)

    i.e. I(a) + nI(x) congruent to I(b) mod (phi(m))

    i.e. nI(x) congruent to I(b) - I(a) mod (phi(m))

    which has solutions iff gcd(n, phi(m)) divides ( I(b) - I(a) )

    is this correct, or is there some further conclusion I can draw? Thanks!
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Super Member fardeen_gen's Avatar
    Joined
    Jun 2008
    Posts
    539
    Looks correct to me!
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Is S_3 congruent to D_3?
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: September 29th 2011, 07:24 PM
  2. Congruent triangles
    Posted in the Geometry Forum
    Replies: 1
    Last Post: March 28th 2010, 03:18 PM
  3. x^6 congruent to 1 (mod 19)
    Posted in the Number Theory Forum
    Replies: 10
    Last Post: March 2nd 2010, 06:54 PM
  4. Congruent Triangles
    Posted in the Geometry Forum
    Replies: 6
    Last Post: November 25th 2008, 10:09 PM
  5. congruent mod 9
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: January 11th 2007, 07:07 PM

Search Tags


/mathhelpforum @mathhelpforum