$\tau(n)\phi(n)\ge n$

363 Views Asked by At

how to prove $\forall n \in \Bbb N$ $$\tau(n)\phi(n)\ge n$$

$\tau(n)$ is number of positive divisor of $n$

my efford: if $n=p$ is prime then $\tau(p)=2,\phi(p)=p-1,2p-2\ge p$ but how prove for composite number?

1

There are 1 best solutions below

0
On BEST ANSWER

Do it for powers of primes and the multiplicative property will give you the rest.