Show that for every odd number n there is a positive integer m such that n=τ(m^2)/τ(m) where τ is the number of divisors

Question

I feel that it has to be proved by induction but I am getting confuse with the different variables. I used the formula of τ where it is the product of (a_i +1) where a_i are the exponents of prime factors of m