30 Let be a positive integer, and . Prove: there exists at most one pair of positive integers , such that , and .
Solution
39. If the value of can be determined (considering as a constant), then by the inverse of Vieta's theorem, there is at most one pair of positive integers that satisfies the condition.
From the condition, we know that satisfies
Thus,
Therefore,
In summary, can only take values from two consecutive positive integers. Since , it follows that and are one odd and one even, meaning is odd. This way, we know that the value of is uniquely determined, and the proposition is proved.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.