Prove a case that is a little bit different from Fermat Numbers

30 Views Asked by At

Prove that for every integer $n\geq1$ the number $2^{2^n}$ has at least n distinct divisors.

I have no idea on how to do this. I cannot comprehend what the Wikipedia explanation says.