|
|
back to boardDifficulty is overrated Hint: you should only know fundamental theorem of arithmetic Re: Difficulty is overrated + Re: Difficulty is overrated It's easy if you know that number of divisors is (n_1+1)*(n_2+1)*...*(n_k+1), where n_i is power of prime that is included in number decomposition |
|
|