Browse · MathNet
Print2022 China Team Selection Test for IMO
China 2022 algebra
Problem
If two real numbers satisfy that for all positive integers , where denotes the maximal integer not exceeding . Prove that there exist two positive integers such that .
Solution
First note that is an irrational number (otherwise there are positive integers such that , which leads to a contradiction). If is a rational number, then there is a positive integer such that the decimal part of is less than . Taking gives that which contradicts to the assumption. Thus must be irrational. Similarly, must be irrational as well.
A pair of positive integers is called distinguished if . By our assumption, there is a unique positive integer such that . Denoting , we say a distinguished pair corresponds to the intermediate number together with a distant pair . We will prove the following.
Lemma. Assume two distinguished pairs , correspond to distant pairs , , respectively. Then .
Proof of Lemma. Suppose that the intermediate numbers of these two distinguished pairs are , respectively. Assume for the sake of contradiction that . We also take . Since is an irrational number, there are positive integers such that . On the other hand, our assumption implies that there is another integer satisfying . Denote and . If , then one can take such that , i.e., Set and . Then , which leads to a contradiction. This further implies that . Using a similar argument, we can show that . Therefore, However, this violates our choice of . The lemma is proved.
Now we see all distinguished pairs share the same ratio . Denote this common ; then we have an equality . We call linear combinations of distinguished pairs with integer coefficients nice pairs. For each nice pair , it is not hard to see that Take a nice pair and set . We claim that for all , any pair of integers satisfying and , is nice. Indeed, it suffices to take so that , and therefore the pair must be distinguished and the pair must be a nice pair.
Now take , and integers and satisfying the condition . Using the analysis above, , , and are nice pairs, and their linear combinations and are nice pairs as well. This implies in particular that and are (positive) integers. Taking positive integers and , we get , or equivalently . We conclude the proof.
A pair of positive integers is called distinguished if . By our assumption, there is a unique positive integer such that . Denoting , we say a distinguished pair corresponds to the intermediate number together with a distant pair . We will prove the following.
Lemma. Assume two distinguished pairs , correspond to distant pairs , , respectively. Then .
Proof of Lemma. Suppose that the intermediate numbers of these two distinguished pairs are , respectively. Assume for the sake of contradiction that . We also take . Since is an irrational number, there are positive integers such that . On the other hand, our assumption implies that there is another integer satisfying . Denote and . If , then one can take such that , i.e., Set and . Then , which leads to a contradiction. This further implies that . Using a similar argument, we can show that . Therefore, However, this violates our choice of . The lemma is proved.
Now we see all distinguished pairs share the same ratio . Denote this common ; then we have an equality . We call linear combinations of distinguished pairs with integer coefficients nice pairs. For each nice pair , it is not hard to see that Take a nice pair and set . We claim that for all , any pair of integers satisfying and , is nice. Indeed, it suffices to take so that , and therefore the pair must be distinguished and the pair must be a nice pair.
Now take , and integers and satisfying the condition . Using the analysis above, , , and are nice pairs, and their linear combinations and are nice pairs as well. This implies in particular that and are (positive) integers. Taking positive integers and , we get , or equivalently . We conclude the proof.
Techniques
Floors and ceilingsTechniques: modulo, size analysis, order analysis, inequalities