This problem is smaller constant version of ARML 2010 T-5. Divisor counting function gives the incremented exponent product of prime factorization as the total number divisors. Math people King Squirrel and José Carlos Santos explored the origin/proof of this important number theoretic combinatorics result August 2018
Негізгі бет Find the smallest natural number n such that n^n has at least 720 divisors, comparable to ARML
Пікірлер: 9