Euler totient function

Printable View

February 1st 2010, 04:00 AM
wauwau

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)$
February 1st 2010, 09:22 AM
wonderboy1953

Question

Is this a problem or your observation?
February 1st 2010, 09:33 AM
wauwau

This is to prove!!!

Show that
if...
then...

All times are GMT -8. The time now is 07:13 AM.

Copyright © 2005-2013 Math Help Forum. All rights reserved.

Copyright © 2005-2013 Math Help Forum. All rights reserved.