How many positive integers satisfy (Recall that is the greatest integer not exceeding .)
- A)
- B)
- C)
- D)
- E)
Answer
C
Key insight
Set the common value to k: then n = 70k - 1000 and k^2 <= 70k - 1000 < (k+1)^2, two quadratic inequalities in k.
Solution
The right side is an integer, so let . Then , and the floor condition becomes
Left inequality: . The roots of are , so .
Right inequality: , i.e. . The roots are . Since , the roots are about and , so we need or .
Combining: , six values. Each gives a positive (namely ), and distinct give distinct .
Spot check: gives , , floor . Good. gives , , floor . Fails, as predicted.
The answer is .
Why this works
A floor equation is really two inequalities. Naming the integer value converts the problem to one variable, and becomes a linear expression in while becomes a quadratic condition. The line and the parabolas and cross twice each, so the solutions live in two short intervals at the ends, not one long block. Always solve both inequalities; the answer choices and exist to catch students who stop after the first.
The trap
Solving only k^2 <= n (getting 20 <= k <= 50, i.e. 31 values) and forgetting the upper bound n < (k+1)^2.
Common mistakes
- Solving only k^2 <= n (getting 20 <= k <= 50, i.e. 31 values) and forgetting the upper bound n < (k+1)^2.
- Misjudging the boundary or by rounding poorly; check the endpoints numerically.
Techniques
Bound the quantity above/below or estimate to pin it down · Substitute to simplify (u = x+1/x, shifting, scaling)