Let be the set of all positive integer divisors of How many numbers are the product of two distinct elements of
- A)
- B)
- C)
- D)
- E)
Answer
C
Key insight
Every divisor is 2 to some power times 5 to some power, both powers 0 to 5. Multiplying two of them adds the powers, giving an 11 by 11 grid.
Solution
Multiplying numbers adds their exponents, so write everything with exponents.
1. . Its divisors are the numbers where and are each one of . (For example .)
2. Multiply two divisors, and . The product is . Each total exponent is between and .
3. Every pair of totals from to can be reached (for example, ). So the possible products are with and each from to . That is numbers.
4. Now use "distinct". Can we reach with two different divisors? The two divisors are the same only if and . So we only need one exponent that can be split unevenly.
- can only be split as , and only as . Every from to can be split into two different parts (for example , ).
- The same holds for .
5. So fails only when both and are or . Those four products are
Each one can only be made by multiplying a divisor by itself.
6. The count is .
The answer is .
Why this works
Divisors of a number like correspond to pairs of exponents, and multiplying divisors adds those exponents. That turns the question into counting points on a grid. The word "distinct" only removes the corner points, where both exponents are forced to split evenly. Check such small exceptions carefully: all four corners count, not just and .
The trap
Answering 121 by forgetting that the two divisors must be different, or removing only 1 and 10^10 to get 119.
Concise solution
, so consists of the numbers with .
A product of two elements of has the form with . There are such numbers, and each one arises: split and with all parts in .
The question requires the two divisors to be distinct. An exponent can be split into two different parts unless (only ) or (only ). So is a product of two distinct divisors as long as at least one of lies strictly between and ; the exceptions are the four "corners" :
Hence numbers qualify. The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 1: Integers: The Basics (§1.4, §1.5)
- Introduction to Counting & Probability, Chapter 1: Counting Is Arithmetic
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.3)
- Intermediate Counting & Probability, Chapter 4: Constructive Counting and 1-1 Correspondences (§4.4, §4.5, §4.6)
Techniques
Map the objects to something easier to count · Count the complement and subtract from the total