Results 1 to 2 of 2

Math Help - fermat's little theorem application

  1. #1
    Newbie
    Joined
    Apr 2007
    Posts
    2

    fermat's little theorem application

    let p be an odd prime number, and suppose that p-1 is not divisible by 3. prove that, for every integer a, there is an integer x, such that
    x^3 = a (mod p)

    My approach is to use fermat's little theorem's proof, and get a^p=a(mod p)
    from there we can compare a^p=a(mod p) to x^3 = a (mod p), so for every enteger a, there is an integer x, such that a=x.

    What do you guys think?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Global Moderator

    Joined
    Nov 2005
    From
    New York City
    Posts
    10,616
    Thanks
    10
    Quote Originally Posted by MathIsFun View Post
    let p be an odd prime number, and suppose that p-1 is not divisible by 3. prove that, for every integer a, there is an integer x, such that
    x^3 = a (mod p)
    I solved it with a little bit of group theory .
    Attached Thumbnails Attached Thumbnails fermat's little theorem application-picture17.gif  
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Application of Fermat's last theorem
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: March 31st 2011, 01:24 PM
  2. Replies: 4
    Last Post: January 10th 2011, 09:51 AM
  3. Fermat's little theorem
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: May 17th 2009, 07:28 AM
  4. Replies: 1
    Last Post: March 9th 2009, 01:51 PM
  5. Help with Fermat's Little Theorem
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: March 3rd 2008, 05:14 PM

Search Tags


/mathhelpforum @mathhelpforum