Results 1 to 2 of 2

Math Help - Euler Phi Function

  1. #1
    Junior Member
    Joined
    Sep 2008
    Posts
    46

    Euler Phi Function

    Let phi(n) be the number of integers less than or equal to n that are relatively prime to n.

    Prove or Disprove:
    If phi(m)|phi(n), then m|n.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Global Moderator

    Joined
    Nov 2005
    From
    New York City
    Posts
    10,616
    Thanks
    9
    Quote Originally Posted by mndi1105 View Post
    Let phi(n) be the number of integers less than or equal to n that are relatively prime to n.

    Prove or Disprove:
    If phi(m)|phi(n), then m|n.
    Take m=2 and n=3.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Euler function
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: November 30th 2011, 09:53 AM
  2. Euler Function phi(n)
    Posted in the Number Theory Forum
    Replies: 22
    Last Post: May 29th 2010, 07:29 AM
  3. Euler's phi function
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: April 8th 2010, 02:58 PM
  4. Euler's phi function
    Posted in the Advanced Math Topics Forum
    Replies: 12
    Last Post: January 12th 2010, 05:10 AM
  5. Euler phi-Function
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: March 11th 2009, 06:11 PM

Search Tags


/mathhelpforum @mathhelpforum