Results 1 to 3 of 3

Thread: Euler totient function

  1. February 1st 2010, 04:00 AM #1
    wauwau
    wauwau is offline
    Newbie
    Joined
    Dec 2009
    Posts
    19

    Euler totient function

    let n,a be positive integers p be prime with a<p

    if n \equiv a\mod(p^3) is squarefree

    then

    \phi(n) \not\equiv a \mod(p^2)
    Follow Math Help Forum on Facebook and Google+
  2. February 1st 2010, 09:22 AM #2
    wonderboy1953
    wonderboy1953 is offline
    Banned
    Joined
    Oct 2009
    Posts
    772

    Question

    Is this a problem or your observation?
    Follow Math Help Forum on Facebook and Google+
  3. February 1st 2010, 09:33 AM #3
    wauwau
    wauwau is offline
    Newbie
    Joined
    Dec 2009
    Posts
    19

    This is to prove!!!

    Show that
    if...
    then...
    Follow Math Help Forum on Facebook and Google+
« how to solve this in natural numbers? | n^3 mod 6 = n mod 6 »

Similar Math Help Forum Discussions

  1. Euler's totient function
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: November 5th 2010, 01:04 AM
  2. Euler Totient Function
    Posted in the Number Theory Forum
    Replies: 9
    Last Post: June 3rd 2010, 05:38 PM
  3. Euler's totient function
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: July 12th 2009, 06:11 PM
  4. Euler's totient function
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: December 8th 2008, 08:53 PM
  5. Euler totient function
    Posted in the Advanced Algebra Forum
    Replies: 2
    Last Post: March 25th 2007, 07:10 AM

Search Tags


/mathhelpforum @mathhelpforum