For how many integers is the square of an integer?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
A square is nonnegative, so n lies between 0 and 19 and the fraction is at most 19; only k = 0, 1, 2, 3 give integer n.
Solution
Set with an integer. A square is at least , so the fraction cannot be negative. If the numerator is negative and the denominator positive; if the reverse; and is undefined. Hence .
On that range the fraction is largest at , where it equals . So , meaning .
Solve for : gives , so
- : .
- : .
- : .
- : .
- : , not an integer.
Four values of work: .
The answer is .
Why this works
Bounding first shrinks an infinite search to a handful of cases: the sign of the fraction limits , and the size of the fraction limits . Once the search space is tiny, solving for in terms of and checking integrality is faster than any cleverness. Remember that counts as a perfect square.
Alternative approach
Divisibility: from and , the integer must divide . The divisors give (while and give the non-squares and ), so again .
The trap
Overlooking n = 0 (the square 0^2) or assuming a 'square of an integer' must be positive, which drops the count to 3.
Common mistakes
- Overlooking n = 0 (the square 0^2) or assuming a 'square of an integer' must be positive, which drops the count to 3.
- Counting and as separate solutions (they give the same ), or forgetting that makes the expression undefined.
Techniques
Bound the quantity above/below or estimate to pin it down · Organized listing / direct enumeration