2018 AMC 10A Problem 17
Let be a set of integers taken from with the property that if and are elements of with , then is not a multiple of . What is the least possible value of an element in ?
Show solution without answering
Key insight
A small smallest number bans all its multiples, and leftover pairs like 4 and 8 still clash. Smallest 2 or 3 allows only 5 numbers.
Solution
This asks for the least possible smallest number, so there are two halves: show that , and cannot be the smallest number, and show that can.
Part 1: the smallest number cannot be , or .
- Smallest number . Every number is a multiple of , so nothing else could join . Impossible.
- Smallest number . Then are all multiples of and are ruled out. The other five members must come from . That is exactly five numbers, but is a multiple of , so they cannot all be used. At most four join , giving at most numbers. Not enough.
- Smallest number . Then are ruled out, and are too small. The other five members must come from . But is a multiple of , so at most one of and can be used. Likewise at most one of and . So at most of these numbers (one from , one from , plus and ), and at most numbers in all. Not enough.
Part 2: the smallest number can be .
4. Take . Check each number against the smaller ones:
- are not multiples of .
- are not multiples of .
- are not multiples of .
- are not multiples of .
- is not a multiple of .
No number is a multiple of a smaller one, and has numbers. It works.
The smallest number cannot be below , and is possible.
The answer is .
Why this works
A small number is costly: every multiple of it is banned. After banning those, look for pairs among the leftover numbers where one is a multiple of the other ( and , and , and ). You can use only one number from each such pair, so counting pairs tells you the most you can pick. For a "least possible" question, always finish by showing a set that actually works.
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Test the candidates for the minimum from smallest to largest. ( is impossible since everything is a multiple of .)
Minimum . Then are excluded, leaving as candidates for the other five elements. But is a multiple of , so at most four of them can be used, giving a set of at most elements. Fails.
Minimum . Then are excluded (and are below the minimum), leaving . Within these, and , so at most one of and one of can be used: at most more elements, total . Fails.
Minimum . Exclude and ; choose from . Take . Check every pair: are not multiples of or ; and are not multiples of or ; is not a multiple of . Valid.
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 2: Basic Counting Techniques (§2.2)
- Introduction to Number Theory, Chapter 5: Divisor Problems (§5.2, §5.3)
- Introduction to Algebra, Chapter 20: Special Functions (§20.3)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.