AMC 10 Step by Step

2018 AMC 10B Problem 25

P21-25~10 minPrint

Let ⌊x⌋\lfloor x \rfloor denote the greatest integer less than or equal to xx . How many real numbers xx satisfy the equation x2+10,000⌊x⌋=10,000xx^2 + 10,000\lfloor x \rfloor = 10,000x ?

Log in to save your progress.
Show solution without answering

Key insight

Split x into whole part n and decimal part. Each interval from n to n + 1 has one solution when (n + 1) squared is below 10,000.

Solution

Move the terms around so the floor sits next to xx:
x2=10000 (x−⌊x⌋).x^2 = 10000\,\big(x - \lfloor x \rfloor\big).
The quantity x−⌊x⌋x - \lfloor x \rfloor is the part of xx after its whole part, the "decimal part." For example, for x=3.7x = 3.7 it is 0.70.7, and for x=−2.3x = -2.3 it is 0.70.7 too (since ⌊−2.3⌋=−3\lfloor -2.3 \rfloor = -3). It is always at least 00 and less than 11.

1. Limit the size of xx. The decimal part is less than 11, so x2<10000x^2 < 10000. That means xx is strictly between −100-100 and 100100.
2. Split xx. Write x=n+fx = n + f, where n=⌊x⌋n = \lfloor x \rfloor is a whole number and ff is the decimal part, 0≤f<10 \le f < 1. The equation becomes
(n+f)2=10000f.(n + f)^2 = 10000 f.
For each whole number nn, ask how many ff from 00 up to (not including) 11 solve this.
3. Compare the two sides as ff goes from 00 to 11. Let the "left" be (n+f)2(n+f)^2 and the "right" be 10000f10000f.
- At f=0f = 0: left =n2= n^2, right =0= 0. The left is at least as big.
- At f=1f = 1: left =(n+1)2= (n+1)^2, right =10000= 10000.

If (n+1)2<10000(n+1)^2 < 10000, the right side has overtaken the left by f=1f = 1, so they are equal somewhere in between: one solution. (The right side climbs by 1000010000 as ff goes from 00 to 11, far faster than the left side can change when ∣n∣|n| is at most 100100, so they cross only once.)
4. Which nn work? (n+1)2<10000(n+1)^2 < 10000 means n+1n + 1 is between −100-100 and 100100, not including the ends. So n=−100,−99,…,98n = -100, -99, \ldots, 98. That is
98−(−100)+1=199 values.98 - (-100) + 1 = 199 \text{ values}.
(For n=0n = 0 the solution is f=0f = 0, that is x=0x = 0, which does satisfy the equation.)
5. The edge case n=99n = 99. Now (n+1)2=10000(n+1)^2 = 10000 exactly, so the two sides only meet at f=1f = 1, meaning x=100x = 100. But ff must be less than 11, and x=100x = 100 was already ruled out in step 1. So no solution here.
6. No other nn. Step 1 says xx is between −100-100 and 100100, so nn cannot be −101-101 or less, or 100100 or more.

Total: 199199 solutions.

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

Why this works

Equations with a floor become ordinary equations once you fix the whole part nn and let only the decimal part vary. Then you just ask, interval by interval, whether a solution lands inside. Comparing the two sides at the ends of each interval answers that quickly. The real danger is at the edge, where the solution lands exactly on the boundary and does not count.

Alternative approach

Think of graphs. The equation says (decimal part of xx) =x210000= \dfrac{x^2}{10000}. The left side is a sawtooth: on each interval from nn to n+1n+1 it climbs from 00 almost to 11, then drops. The right side is a very flat U-shaped curve, below 11 for xx between −100-100 and 100100. Each tooth crosses the curve once as long as the curve is still below 11 at the tooth's right end, meaning (n+1)2<10000(n+1)^2 < 10000. That is the teeth n=−100n = -100 through 9898, giving 199199 crossings. On the tooth from 9999 to 100100 the curve stays above the tooth.

Concise solution

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

Rewrite the equation as
x2=10000 (x−⌊x⌋)=10000 {x},x^2 = 10000\,(x - \lfloor x \rfloor) = 10000\,\{x\},
where {x}∈[0,1)\{x\} \in [0, 1) is the fractional part. So 0≤x2<100000 \le x^2 < 10000, forcing −100<x<100-100 < x < 100.

Write x=n+fx = n + f with n=⌊x⌋n = \lfloor x \rfloor an integer and f∈[0,1)f \in [0, 1). For a fixed nn we need a root f∈[0,1)f \in [0,1) of
q(f)=(n+f)2−10000f=f2+(2n−10000)f+n2.q(f) = (n + f)^2 - 10000 f = f^2 + (2n - 10000)f + n^2.
Since ∣n∣≤100|n| \le 100, the two roots of qq have sum 10000−2n>110000 - 2n > 1 and product n2≥0n^2 \ge 0, so at most one root can lie in [0,1)[0, 1); if one root is below 11 the other exceeds 10000−2n−1>110000 - 2n - 1 > 1.

Now q(0)=n2≥0q(0) = n^2 \ge 0 and q(1)=(n+1)2−10000q(1) = (n+1)^2 - 10000. When q(1)<0q(1) < 0, i.e. ∣n+1∣<100|n + 1| < 100, there is a sign change on [0,1)[0, 1) and hence exactly one solution. This gives n=−100,−99,…,98n = -100, -99, \dots, 98, which is 199199 integers (for n=0n = 0 the solution is f=0f = 0, i.e. x=0x = 0, which does satisfy the equation).

Boundary cases: n=99n = 99 gives q(f)=(f−1)(f−9801)q(f) = (f - 1)(f - 9801), whose only small root is f=1f = 1, not allowed. n=−101n = -101 would force x<−100x < -100, excluded. Larger ∣n∣|n| is impossible.

Total: 199199 solutions. The answer is (C) 199\boxed{\textbf{(C)}\ 199}.

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.