AMC 10 Step by Step

2020 AMC 10A Problem 22

P21-25~6 minPrint

For how many positive integers n≤1000n \le 1000 is ⌊998n⌋+⌊999n⌋+⌊1000n⌋\left\lfloor \dfrac{998}{n} \right\rfloor+\left\lfloor \dfrac{999}{n} \right\rfloor+\left\lfloor \dfrac{1000}{n}\right \rfloor not divisible by 33 ? (Recall that ⌊x⌋\lfloor x \rfloor is the greatest integer less than or equal to xx .)

Log in to save your progress.
Show solution without answering

Key insight

The three floors are equal, so their sum is a multiple of 3, unless n divides 999 or 1000. Count those divisors, leaving out n = 1.

Solution

First see how the three floors compare. Try an example: n=7n = 7. Then 9987≈142.6\frac{998}{7} \approx 142.6, 9997≈142.7\frac{999}{7} \approx 142.7, 10007≈142.9\frac{1000}{7} \approx 142.9. All three floors are 142142, and the sum 3×1423 \times 142 is a multiple of 33.

  1. When does the floor go up? As the top goes 998→999→1000998 \to 999 \to 1000, the floor of (top ÷n\div n) goes up by 11 only when the top hits a multiple of nn. So the three floors are all equal unless nn divides 999999 or nn divides 10001000.
  2. Case: nn divides neither. All three floors equal some qq. The sum is 3q3q, a multiple of 33. Not counted.
  3. Case: nn divides 999999 but not 10001000. Example n=37n = 37: floors 26,27,2726, 27, 27. The floor steps up at 999999, so the floors are q−1,q,qq - 1, q, q and the sum is 3q−13q - 1. Not a multiple of 33. Counted.
  4. Case: nn divides 10001000 but not 999999. Example n=8n = 8: floors 124,124,125124, 124, 125. The sum is 3q−23q - 2. Not a multiple of 33. Counted.
  5. Case: nn divides both. Two numbers in a row share no common factor except 11, so n=1n = 1. The sum is 998+999+1000=2997=3×999998 + 999 + 1000 = 2997 = 3 \times 999, a multiple of 33. Not counted.
  6. Count the divisors. 999=33×37999 = 3^3 \times 37 has 4×2=84 \times 2 = 8 divisors. 1000=23×531000 = 2^3 \times 5^3 has 4×4=164 \times 4 = 16 divisors. Leave n=1n = 1 out of each list: 7+15=227 + 15 = 22. All of these are at most 10001000, as the problem requires.

The answer is (A) 22\boxed{\textbf{(A)}\ 22}.

Why this works

Floors of nearby fractions with the same bottom are almost always equal, and three equal numbers always add to a multiple of 33. So the only interesting nn are the ones where the floor "steps up", and that happens exactly at divisors. Then it is a divisor count, with one special number (n=1n = 1) to watch.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

As mm increases by 11, ⌊m/n⌋\lfloor m/n \rfloor increases only when mm becomes a multiple of nn. So the three floors for m=998,999,1000m = 998, 999, 1000 are all equal unless nn divides 999999 or 10001000.

Case 1: nn divides neither. All three floors equal some qq, the sum is 3q3q, divisible by 33. Not counted.

Case 2: n∣999n \mid 999 but n∤1000n \nmid 1000. Then ⌊999/n⌋=⌊1000/n⌋=q\lfloor 999/n \rfloor = \lfloor 1000/n \rfloor = q and ⌊998/n⌋=q−1\lfloor 998/n \rfloor = q - 1. Sum 3q−13q - 1: not divisible by 33. Counted.

Case 3: n∣1000n \mid 1000 but n∤999n \nmid 999. Then ⌊1000/n⌋=q\lfloor 1000/n \rfloor = q and the other two are q−1q - 1. Sum 3q−23q - 2: counted.

Case 4: nn divides both 999999 and 10001000. Consecutive integers are coprime, so only n=1n = 1; the sum 998+999+1000=2997=3⋅999998 + 999 + 1000 = 2997 = 3 \cdot 999 is divisible by 33. Not counted.

Now count. 999=33⋅37999 = 3^3 \cdot 37 has 4⋅2=84 \cdot 2 = 8 divisors; 1000=23⋅531000 = 2^3 \cdot 5^3 has 4⋅4=164 \cdot 4 = 16. Removing n=1n = 1 from each list leaves 7+15=227 + 15 = 22 values, all at most 10001000.

The answer is (A) 22\boxed{\textbf{(A)}\ 22}.

Review in the AoPS books

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.