Number Theory - square-free integers & tau.

[Jamers328]

If n is a square-free integer, prove that Tau(n) = 2^r, where r is the number of prime divisors of n.

I know what a square-free integer is... n=p1,p2,...pr. There are no exponents on square-free integers. Anyway, I still have no idea what to do, or where to start with this proof.

Also, sorry I did not know how to write the tau symbol on this forum.

Thank you for your help!

 

[daon]

What does \(\displaystyle \L \tau\(n\)\) represent?

 

[Jamers328]

Thank you for your reply, I solved this problem.

Help no longer needed.