Let be pairwise different positive real numbers such that
is an integer for every . Prove that .
.
.
.
.
Hint 1: By Cauchy-Schwarz: , with equality iff all are equal. Since they're distinct, for .
Hint 2: Show using AM-GM on the cross terms when adding . When does ?
Hint 3: The distinctness of the forces most steps to give (since usually). Count the number of '+2' jumps.
Step 1 (Cauchy-Schwarz): By Cauchy-Schwarz: , so . Equality iff all equal, but they're distinct.
Step 2 (Strict inequality): Since the are distinct, . Since is a positive integer, for (as ).
Step 3 (Monotonicity): Adding a new term : by AM-GM on the cross terms. Wait: the cross terms are where and . By AM-GM: . So , giving .
Step 4 (Strict jump): Equality in AM-GM requires , i.e., , which forces to be specific. For at least one step, equality fails, giving (since is an integer).
Step 5 (Counting jumps): Starting from and increasing by at least 1 each step: . But we need to show more jumps of . Since all are distinct, the equality condition in AM-GM () can hold for at most one value of . More carefully, at each step either or the cross-term equality holds. A detailed analysis shows at least strict jumps, giving .
Ready to track your progress and master these topics?
Create a free account