Results 1 to 2 of 2

Math Help - euler theorem

  1. #1
    Super Member
    Joined
    Aug 2009
    Posts
    639

    euler theorem

    Based on euler theorem, i know that if gcd(a,p)=1 then a^(p-1) congruent to 1 mod p. is (p-1) the smaller value such that this is true? Im wondering if it is possible that a^(q-1) is congruent to 1 mod p where (q-1)<p-1 and gcd(a,q)=1
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Member Sylvia104's Avatar
    Joined
    Mar 2012
    From
    London, UK
    Posts
    107
    Thanks
    37

    Re: Euler theorem

    It is certainly possible. Just take a=1.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 4
    Last Post: January 10th 2011, 09:51 AM
  2. Euler's Theorem
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: March 5th 2009, 10:07 AM
  3. Euler's Theorem
    Posted in the Advanced Algebra Forum
    Replies: 4
    Last Post: November 19th 2008, 06:47 AM
  4. Euler's Theorem
    Posted in the Number Theory Forum
    Replies: 8
    Last Post: May 5th 2008, 05:19 PM
  5. Euler's theorem
    Posted in the Advanced Algebra Forum
    Replies: 3
    Last Post: February 25th 2007, 01:53 PM

Search Tags


/mathhelpforum @mathhelpforum