Results 1 to 3 of 3

Math Help - phi(n) divides n-1 implies n is prime

  1. #1
    Senior Member abhishekkgp's Avatar
    Joined
    Jan 2011
    From
    India
    Posts
    495
    Thanks
    1

    phi(n) divides n-1 implies n is prime

    Prove that if \phi(n)|(n-1) then n is prime, where \phi(n). is the Euler's totient function.

    I am able to show that n is square-free under the above condition.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member
    Joined
    Nov 2011
    From
    Crna Gora
    Posts
    420
    Thanks
    64

    Re: phi(n) divides n-1 implies n is prime

    Quote Originally Posted by abhishekkgp View Post
    Prove that if \phi(n)|(n-1) then n is prime, where \phi(n). is the Euler's totient function.

    I am able to show that n is square-free under the above condition.
    Lehmer's conjecture
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Senior Member abhishekkgp's Avatar
    Joined
    Jan 2011
    From
    India
    Posts
    495
    Thanks
    1

    Re: phi(n) divides n-1 implies n is prime

    Quote Originally Posted by princeps View Post
    Thank You. I did not know its an unsolved problem or I would not post it.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 3
    Last Post: October 8th 2011, 05:16 PM
  2. Replies: 2
    Last Post: May 1st 2011, 03:11 PM
  3. Replies: 2
    Last Post: February 5th 2011, 07:43 AM
  4. Proof of p implies (q implies p)
    Posted in the Discrete Math Forum
    Replies: 14
    Last Post: December 24th 2010, 05:09 AM
  5. gcd(a,30)=1 implies that 60 divides a^4+59
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: August 5th 2009, 04:20 PM

Search Tags


/mathhelpforum @mathhelpforum