The largest divisor of is itself. What is its fifth largest divisor?
- A)
- B)
- C)
- D)
- E)
Answer
C
Key insight
Divisors come in pairs that multiply to N, so the fifth largest divisor is N divided by the fifth smallest. The smallest divisors are 1, 2, 4, 5, 8.
Solution
1. Why think about small divisors? Every divisor of has a partner . For example, pairs with itself, and pairs with . The smaller one partner is, the bigger the other. So the largest divisors are divided by the smallest divisors, in order:
- largest: ,
- second largest: ,
- and so on.
2. Factor so we can tell which small numbers divide it:
So .
3. List the smallest divisors by testing :
- : yes. : yes. : no (no factor ). : yes. : yes. : no. : no. : yes.
So the five smallest divisors are .
4. The fifth largest divisor is therefore
The answer is .
Why this works
Finding big divisors directly is hard, but small divisors are easy to list by testing one at a time. Pairing each divisor with its partner turns one job into the other. Factor the number first so you know which small numbers really divide it; here the factor sneaks in between and .
Alternative approach
Look at the choices: they equal , , , and . The small divisors in order are , so is fifth, and the answer is .
The trap
Assuming the smallest divisors are 1, 2, 4, 8, 16 and answering N divided by 16, forgetting that 5 divides N and comes before 8.
Concise solution
Let .
Divisors pair up as and , so the -th largest divisor is divided by the -th smallest. The smallest divisors of , in order, are (then ); note do not divide .
The fifth smallest is , so the fifth largest divisor is
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 1: Integers: The Basics (§1.4, §1.5)
- Introduction to Number Theory, Chapter 2: Primes and Composites
- Introduction to Number Theory, Chapter 5: Divisor Problems (§5.2, §5.3)
- Introduction to Number Theory, Chapter 4: Prime Factorization (§4.2, §4.4)
Techniques
Set up the equation/formula and compute; no special trick needed