Browse · MathNet
PrintUkrajina 2008
Ukraine 2008 algebra
Problem
Let's consider all the increasing geometric progressions and select only those that have the maximal number of elements in the set . Find .
Solution
Let one of the progressions which has the required maximal number of common members have the first member and denominator . The progression has some common elements with set . Let be the least number in , which can also be found in the progression. Then you can define a new progression with the first member and the same denominator . It has as many members in the set as progression and therefore we can take it as an initial one. Let be the next common member of the set that also belongs to the progression, i.e. in a new progression , where is an irreducible fraction and .
Let's show that if . By contradiction, let , which is also an irreducible fraction. In this case . Then . This implies that and , since and vice versa . As , , and . Therefore , which contradicts the following condition: the first natural number after will be .
It follows that the rational members of the chosen geometric progression may only be members of such a set as . Therefore we can choose and consider the progression with the first integer member and rational denominator where is an irreducible fraction.
The progression obviously has the maximum members in among all the progressions with integer denominators. They share 11 common elements. All these elements are powers of two: . Let there be a progression with a rational exponent, which has more elements in . Let it be progression . Thus, if is an integer, i.e. , all the preceding values of are integers too, . Therefore, if the progression has at least 12 elements in , then should be an integer, which implies that . As , . Therefore, and . We've finished proving the given condition (An increasing geometric progression cannot have more than 11 members in the set ).
Let's show that if . By contradiction, let , which is also an irreducible fraction. In this case . Then . This implies that and , since and vice versa . As , , and . Therefore , which contradicts the following condition: the first natural number after will be .
It follows that the rational members of the chosen geometric progression may only be members of such a set as . Therefore we can choose and consider the progression with the first integer member and rational denominator where is an irreducible fraction.
The progression obviously has the maximum members in among all the progressions with integer denominators. They share 11 common elements. All these elements are powers of two: . Let there be a progression with a rational exponent, which has more elements in . Let it be progression . Thus, if is an integer, i.e. , all the preceding values of are integers too, . Therefore, if the progression has at least 12 elements in , then should be an integer, which implies that . As , . Therefore, and . We've finished proving the given condition (An increasing geometric progression cannot have more than 11 members in the set ).
Final answer
11
Techniques
Sequences and SeriesGreatest common divisors (gcd)