Problem
ALG-B3-M02-P024 Small roots of an integer quadratic
Find the smallest positive integer \(a\) for which there exist integers \(b,c\) such that the quadratic \(a x^2+bx+c\) has two distinct positive roots not exceeding \(\frac1{50}\).
Hint 1. Pass to reciprocal roots.
Hint 2. If the reciprocal roots are at least \(50\), then for integer coefficients their difference is controlled by the discriminant.
Let \(0
A. Source analysis. Main objects: an integer quadratic and two small positive roots.
B. Insufficient first move. Working directly with small roots gives inconvenient fractions.
C. Hidden observation. Reciprocal roots become large, and integer coefficients create a discrete gap.
D. Required move. Replace roots by reciprocals and split into c=1 and c>=2.
E. Number of ideas. Three ideas: reciprocal substitution, discriminant gap, and construction using neighboring integers.
F. Difficulty justification. Final level 8: the solution requires a non-obvious reciprocal move and a careful lower bound.
G. Why it is not one-step. It is not one-step: after substitution one must use integrality and then construct an exact example.