AMC 10 · 2017 · #17

Grade 7 arithmetic
combinations-basicsystematic-enumerationexponents caseworkcomplementary-counting ↑ Prerequisites: combinations-basic
📏 Medium solution 💡 3 insights
Problem
A positive integer is called monotonous if it is a single digit, or if its digits read left to right are strictly increasing or strictly decreasing. Count how many monotonous positive integers exist.

Pick an answer.

(A)
1024
(B)
1524
(C)
1533
(D)
1536
(E)
2048

AMC 10 2017 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

How to solve
Strategy Make a Systematic List

The phrase "how many" calls for Tool #2 (Make a Systematic List), but listing thousands of numbers by hand is hopeless, so Tool #16 (Change Focus) reframes the count: instead of building numbers digit by digit, choose which digits to use. Once a set of distinct digits is chosen, there is exactly one way to write them strictly increasing and exactly one way strictly decreasing — the order is forced. Tool #7 (Identify Subproblems) splits the work into the increasing case and the decreasing case, and Tool #5 (Look for a Pattern) supplies the count of subsets: a set of n items has 2ⁿ subsets.

1STEP 1

Choose the digits, not the number

A monotonous number is fixed by its digit-set and direction, each set ordering just one way — so count digit-sets, not numbers.

{2,3,5,7,8}→ 23578 (up) or 87532 (down)
2STEP 2

Count the increasing numbers

Increasing forbids 0 (it would have to lead), leaving digits 1–9; every nonempty subset gives one number, so 2⁹-1=511.

2⁹-1=512-1=511
3STEP 3

Count the decreasing numbers

Decreasing lets 0 ride at the tail, so all digits 0–9 are usable; drop the empty set and the lone {0}, leaving 2¹⁰-2=1022.

2¹⁰-2=1024-2=1022
4STEP 4

Combine without double counting

Adding gives 511+1022=1533, but the 9 single-digit numbers sit in both lists, so subtract them: 1533-9=1524 — choice (B).

511+1022-9=1533-9=1524 → (B)
Answer
1524
The total 1524 is one of the answer choices and matches a quick estimate: each direction is roughly 2¹⁰≈ 1000 subsets before trimming, so a sum near 1500 is expected. A small-length check agrees: there are 9 one-digit monotonous numbers, and the two-digit ones are C(9, 2)=36 increasing plus C(10, 2)=45 decreasing =81, exactly the count of two-element digit-sets. The subset structure holds, so 1524 is trustworthy.
💡Key takeaway

Pick which digits to use and the order is forced, so just count the digit-sets: 511 going up plus 1022 going down, minus the 9 single digits counted twice, equals 1524 — choice (B).

  • Choose the digits, not the number
  • Count the increasing numbers
  • Count the decreasing numbers
  • Combine without double counting