AMC 10 Step by Step

2020 AMC 10B Problem 24

P21-25~8 minPrint

How many positive integers nn satisfy n+100070=⌊n⌋?\dfrac{n+1000}{70} = \lfloor \sqrt{n} \rfloor? (Recall that ⌊x⌋\lfloor x\rfloor is the greatest integer not exceeding xx .)

Log in to save your progress.
Show solution without answering

Key insight

Call the common value k. Then n = 70k - 1000, and n must be at least k squared but less than (k+1) squared. Solve both conditions.

Solution

1. Name the integer. ⌊n⌋\lfloor \sqrt n \rfloor is a whole number, so call it kk. Then n+100070=k\frac{n + 1000}{70} = k, so
n=70k−1000.n = 70k - 1000.
2. What "⌊n⌋=k\lfloor \sqrt n \rfloor = k" means. It means n\sqrt n is at least kk but less than k+1k + 1. Squaring, nn is at least k2k^2 but less than (k+1)2(k+1)^2:
k2≤70k−1000<(k+1)2.k^2 \le 70k - 1000 < (k + 1)^2.
These are two conditions, and we need both.
3. First condition: k2≤70k−1000k^2 \le 70k - 1000, that is, k2−70k+1000≤0k^2 - 70k + 1000 \le 0. This factors as (k−20)(k−50)≤0(k - 20)(k - 50) \le 0, which holds exactly for 20≤k≤5020 \le k \le 50.
4. Second condition: 70k−1000<k2+2k+170k - 1000 < k^2 + 2k + 1, that is, k2−68k+1001>0k^2 - 68k + 1001 > 0. Rather than solve it exactly, test values near the ends of 2020 to 5050:

kkn=70k−1000n = 70k - 1000(k+1)2(k+1)^2n<(k+1)2n < (k+1)^2?
2020400400441441yes
2121470470484484yes
2222540540529529no
46462220222022092209no
47472290229023042304yes
48482360236024012401yes
49492430243025002500yes
50502500250026012601yes
  1. Why the middle fails. nn goes up by 7070 each time kk goes up by 11, while (k+1)2(k+1)^2 goes up by 2k+32k + 3. So the gap (k+1)2−n(k+1)^2 - n keeps shrinking while 2k+3<702k + 3 < 70 and keeps growing after that. It is negative from k=22k = 22 to k=46k = 46 (both ends checked in the table) and positive outside. (Solving k2−68k+1001=0k^2 - 68k + 1001 = 0 gives k≈21.6k \approx 21.6 and k≈46.4k \approx 46.4, which agrees.)
  2. Collect. k=20,21,47,48,49,50k = 20, 21, 47, 48, 49, 50: six values, each giving a different positive nn: 400,470,2290,2360,2430,2500400, 470, 2290, 2360, 2430, 2500.

The answer is (C) 6\boxed{\textbf{(C)}\ 6}.

Why this works

An equation with a floor is really two inequalities: at least k2k^2, and less than (k+1)2(k+1)^2. Naming the whole-number value kk makes nn a simple expression in kk. The straight line 70k−100070k - 1000 climbs at a steady rate while the squares speed up, so the solutions sit in two short groups at the ends, not one long run. The choices 3030 and 3232 are there to catch anyone who checks only the first inequality.

Concise solution

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

The right side is an integer, so let k=⌊n⌋=n+100070k = \lfloor \sqrt n \rfloor = \dfrac{n + 1000}{70}. Then n=70k−1000n = 70k - 1000, and the floor condition k≤n<k+1k \le \sqrt n < k + 1 becomes
k2≤70k−1000<(k+1)2.k^2 \le 70k - 1000 < (k+1)^2.

Left inequality: k2−70k+1000≤0k^2 - 70k + 1000 \le 0. The roots of k2−70k+1000k^2 - 70k + 1000 are k=70±4900−40002=70±302=20,50k = \frac{70 \pm \sqrt{4900 - 4000}}{2} = \frac{70 \pm 30}{2} = 20, 50, so 20≤k≤5020 \le k \le 50.

Right inequality: 70k−1000<k2+2k+170k - 1000 < k^2 + 2k + 1, i.e. k2−68k+1001>0k^2 - 68k + 1001 > 0. The roots are k=68±4624−40042=34±6202k = \frac{68 \pm \sqrt{4624 - 4004}}{2} = 34 \pm \frac{\sqrt{620}}{2}. Since 620≈24.9\sqrt{620} \approx 24.9, the roots are about 21.5521.55 and 46.4546.45, so we need k≤21k \le 21 or k≥47k \ge 47.

Combining: k∈{20,21,47,48,49,50}k \in \{20, 21, 47, 48, 49, 50\}, six values. Each gives a positive n=70k−1000n = 70k - 1000 (namely 400,470,2290,2360,2430,2500400, 470, 2290, 2360, 2430, 2500), and distinct kk give distinct nn.

Spot check: k=21k = 21 gives n=470n = 470, 470≈21.7\sqrt{470} \approx 21.7, floor 2121. Good. k=22k = 22 gives n=540n = 540, 540≈23.2\sqrt{540} \approx 23.2, floor 23≠2223 \ne 22. Fails, as predicted.

The answer is (C) 6\boxed{\textbf{(C)}\ 6}.

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.