Results 1 to 3 of 3

Math Help - euler function and theorem

  1. #1
    Junior Member
    Joined
    Oct 2007
    Posts
    32

    euler function and theorem

    Prove that each prime divisor of 2p−1, where p is a prime, is greater
    than p. (Notice that it follows from this problem that the number of primes
    is infinite!)
    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 anncar View Post
    Prove that each prime divisor of 2p−1, where p is a prime, is greater
    than p. (Notice that it follows from this problem that the number of primes
    is infinite!)
    Not true, let p = 5 then 2p-1 = 9 but the divisors of 9 are not greater than 5.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Junior Member
    Joined
    Oct 2007
    Posts
    32
    sorry. Its 2^p - 1. Thats 2 raised to the power 'p'
    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. Replies: 1
    Last Post: October 23rd 2010, 04:12 PM
  3. Euler's Theorem and Function
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: March 6th 2009, 11:47 AM
  4. Euler's Phi Function and Chinese Remainder Theorem
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: June 2nd 2008, 05:52 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