← problem archive problem 47 hard number theory Show that if $k>1$ is an integer, then the equation $\tau(n)=k$ has infinitely many solutions.