Results 1 to 3 of 3

Thread: euler fhi function and power of a prime

  1. #1
    Newbie
    Joined
    Jul 2011
    Posts
    15

    euler fhi function and power of a prime

    if (n-1) is divisible by φ(n) then there is no prime p such that p^2|m.

    Thanks...
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Super Member PaulRS's Avatar
    Joined
    Oct 2007
    Posts
    571

    Re: euler fhi function and power of a prime

    I suppose you meant to say $\displaystyle p^2 | n$ .

    Let's proceed by contradiction, suppose on the contrary that there were a prime $\displaystyle p$ such that $\displaystyle p^2 | n$. Clearly $\displaystyle p\not | (n-1)$ since $\displaystyle n$ and $\displaystyle (n-1)$ are coprime, however $\displaystyle p^2 | n$ implies $\displaystyle p | \varphi ( n) $ $\displaystyle (*)$, and since $\displaystyle \varphi(n) | (n-1)$ we have that $\displaystyle p | (n-1)$ which is a contradiction. $\displaystyle \square$

    $\displaystyle (*)$ Check this by using the formula $\displaystyle \phi(n) = n \cdot \prod_{p|n} \left( 1 - \frac{1}{p} \right)$ , where the products runs over all primes dividing $\displaystyle n$.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Jul 2011
    Posts
    15

    Re: euler fhi function and power of a prime

    Thank you Paul for your nice proof...
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 3
    Last Post: Feb 17th 2011, 07:51 AM
  2. prime-power
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: Jan 21st 2009, 08:48 AM
  3. Prime-power factorization
    Posted in the Algebra Forum
    Replies: 5
    Last Post: Sep 17th 2008, 04:04 PM
  4. Euler Algebra and Prime numbers
    Posted in the Number Theory Forum
    Replies: 6
    Last Post: Sep 27th 2006, 12:47 PM

Search Tags


/mathhelpforum @mathhelpforum