Let & denote the phi function
Show that if m and n are not relatively prime, then &(m)&(n) < &(mn)
Follow Math Help Forum on Facebook and Google+
Well, if then they must have a common prime divisor .
Let and be the greatest powers of p dividng and respectively, then is the greatest power of p dividng .
But then and you can finish it off by remembering is multiplicative.
View Tag Cloud