How many distinct values of satisfy where denotes the largest integer less than or equal to ?
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
Set k = floor(x); then x = (k^2 + 2)/3 must satisfy k <= x < k + 1, which pins k to 0, 1, 2, 3.
Solution
Let , an integer. The equation gives in terms of :
For this to be consistent we need , i.e. . Multiply by :
- Left inequality: , so or : every integer satisfies this.
- Right inequality: . The roots of are and , so the integers allowed are .
Each gives one : ; ; ; . Quick check: and , as required. That is distinct solutions.
The answer is .
Why this works
A floor equation is really a family of ordinary equations, one for each integer value of the floor, each valid only on the interval where that floor is correct. Solving for in terms of and then imposing converts the problem into a quadratic inequality in the integer , which has only finitely many solutions.
Alternative approach
Since with , we get , always true, and from , . Test integers directly: gives , false; give , , , , all true; gives , false. Four solutions.
The trap
Replacing floor(x) by x and solving x^2 - 3x + 2 = 0, which finds only x = 1 and x = 2 and misses x = 2/3 and x = 11/3.
Common mistakes
- Replacing floor(x) by x and solving x^2 - 3x + 2 = 0, which finds only x = 1 and x = 2 and misses x = 2/3 and x = 11/3.
- Finding the four candidate values but not verifying the floor condition, or wrongly rejecting because it is not an integer.
Techniques
Bound the quantity above/below or estimate to pin it down · Substitute to simplify (u = x+1/x, shifting, scaling)