Let denote the greatest integer less than or equal to . How many real numbers satisfy the equation ?
- A)
- B)
- C)
- D)
- E)
Answer
C
Key insight
Write x = n + f; then (n+f)^2 = 10000f has exactly one root f in [0,1) precisely when (n+1)^2 < 10000, giving n = -100 to 98.
Solution
Rewrite the equation as
where is the fractional part. So , forcing .
Write with an integer and . For a fixed we need a root of
Since , the two roots of have sum and product , so at most one root can lie in ; if one root is below the other exceeds .
Now and . When , i.e. , there is a sign change on and hence exactly one solution. This gives , which is integers (for the solution is , i.e. , which does satisfy the equation).
Boundary cases: gives , whose only small root is , not allowed. would force , excluded. Larger is impossible.
Total: solutions. The answer is .
Why this works
Floor equations become ordinary equations on each interval once you write . Then the question is how many of these intervals contain a root, which a sign check at the endpoints answers in one stroke. The whole difficulty is at the edges, where the root lands exactly on and is lost; check those cases separately.
Alternative approach
Graphically, the equation is . The right side is a gentle parabola with values in for ; the left side is the sawtooth rising from to on each . Each tooth crosses the parabola once when the parabola is below at the tooth's right end, i.e. : the teeth , which is crossings. On the parabola stays above the tooth.
The trap
Counting one solution for every integer n with |x| < 100 (n = -100 to 99, giving 200) without noticing that n = 99 yields only f = 1, which is excluded.
Common mistakes
- Counting one solution for every integer n with |x| < 100 (n = -100 to 99, giving 200) without noticing that n = 99 yields only f = 1, which is excluded.
- Dropping negative , or dropping (where is legitimate), which gives or .
Techniques
Bound the quantity above/below or estimate to pin it down · Substitute to simplify (u = x+1/x, shifting, scaling)