Question from LongChallenge

#1


can anyone explain me how to tackle this question?

#2

There is a pattern that can be recognized by prime factorization.
A number can be reperesented in the form of primes as -:
(p1^a1 * p2^a2 …pk^ak ) -> And number of divisors will be ( 1 + a1 ) * ( 1+ a2 ) * …* (1 + ak).
So all you have to do is check whether X can have at least k primes with multiplicity. Here multiplicity means ->
8 -> have one prime as 2 with the power of 3.

Refer this for better understanding -:

#3

yeah i have gone through the editorial but the thing i didn’t get was like “check whether X can have at least k primes with multiplicity” this one.How do we know it exactly?

#4

Because of the pattern.
Try to run bruteforce for some values , and then you will see the pattern.