Results 1 to 3 of 3

Math Help - Proving on Euler's totient?

  1. #1
    Newbie
    Joined
    Aug 2012
    From
    manila
    Posts
    9

    Proving on Euler's totient?

    The Euler's totient φ is known to be multiplicative. Let f be de_ned by f(n) = φ (φ (n)). Is the
    function f multiplicative? Prove your answer.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Mar 2011
    From
    Tejas
    Posts
    3,384
    Thanks
    750

    Re: Proving on Euler's totient?

    f will be multiplicative if gcd(a,b) = 1 implies gcd(φ(a),φ(b)) = 1. can you think of a counter-example? look at f(15).
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Dec 2009
    Posts
    19

    Re: Proving on Euler's totient?

    @musngiburger

    since \varphi(n) is always even for n>2 gcd(\varphi(a),\varphi(b)) = 1 never true !!!!!!
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 4
    Last Post: September 30th 2011, 11:18 PM
  2. Euler's totient
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: June 30th 2010, 06:21 PM
  3. Reload this Page Euler's Totient Function Proving
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: February 1st 2010, 07:03 PM
  4. Euler Totient
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: October 11th 2009, 04:38 PM
  5. Euler Totient
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: January 29th 2009, 09:46 PM

Search Tags


/mathhelpforum @mathhelpforum