Results 1 to 2 of 2

Thread: Euler's theorem

  1. May 22nd 2012, 08:21 PM #1
    Fernando
    Fernando is offline
    Junior Member
    Joined
    Mar 2012
    From
    Bogota D.D
    Posts
    30

    Euler's theorem

    Hi everyone.

    If p and q are differents primes and a^p \equiv b^p \pmod{p} show that

    a^p \equiv b^p \pmod{p^2}

    Thanks.
    Follow Math Help Forum on Facebook and Google+
  2. June 6th 2012, 02:02 AM #2
    Sarasij
    Sarasij is offline
    Junior Member Sarasij's Avatar
    Joined
    Jun 2011
    From
    India
    Posts
    42
    Thanks
    2

    Re: Euler's theorem

    I don't understand your question...where is "q" coming in here ?
    Follow Math Help Forum on Facebook and Google+
« Calculation 300 digit Sophie Germain prime number | Relation between Fibonacci Numbers and Pythagorean Triples »

Similar Math Help Forum Discussions

  1. abstract algebra [primitive root mod n, euler theorem, fermat theorem]
    Posted in the Advanced Algebra Forum
    Replies: 4
    Last Post: January 10th 2011, 08:51 AM
  2. How to use Euler's theorem ?
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: April 7th 2010, 09:04 AM
  3. Euler's Theorem
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: March 5th 2009, 09:07 AM
  4. Euler's Theorem
    Posted in the Advanced Algebra Forum
    Replies: 4
    Last Post: November 19th 2008, 05:47 AM
  5. Euler's theorem
    Posted in the Advanced Algebra Forum
    Replies: 3
    Last Post: February 25th 2007, 12:53 PM

Search Tags


/mathhelpforum @mathhelpforum