Free sample 1
Official problem 1 · Divisor counts and the least admissible integer
- Source locator
- Part A, official problem 1, paper PDF page 2
- Review note
- Independently derived; divisor partition and exponent exchange checked; official-key match · 2026-07-28
Problem summary
Determine the exponent of two in the least integer satisfying a fixed divisibility condition and an exact divisor-count condition.
Core idea
Factor the target divisor count, use the required divisibility to force three distinct prime factors, and assign the largest exponent to the smallest prime by an exchange argument.
Derivation
- 1For a prime factorisation with positive exponents, the divisor count is the product of one plus each exponent.
- 2The required divisibility forces the primes 2, 3, and 337, while 2022 = 2 x 3 x 337 permits exactly three positive exponent factors.
- 3The exponent multiset is therefore 336, 2, and 1.
- 4If a smaller prime carries a smaller exponent than a larger prime, swapping the two exponents decreases the integer.
- 5The least admissible integer is 2^336 x 3^2 x 337, so its exponent of two is 336.
Final answer
The requested exponent is 336.





