Skip to main content
OlympiadHQ

Browse · MathNet

Print

62nd Czech and Slovak Mathematical Olympiad

Czech Republic number theory

Problem

Let , be sets of positive integers such that a sum of arbitrary two different numbers from is in and a ratio of arbitrary two different numbers from (greater one to smaller one) is in . Find the maximum number of elements in . (Martin Panák)
Solution
Initially we will prove that the set consists of at most two numbers. Suppose that three numbers belong to the set . Then the numbers are in and therefore the number has to be in . This is a contradiction because and the number is not integer.

If the set contains four numbers , then the set will contain three different numbers , , . So the set has at most three elements and has at most five elements.

We achieve the number of elements if , , where and , . Then () and is one of the elements of ; the next two elements are either and or and . E.g. sets , have five elements together.
Final answer
5

Techniques

OtherIntegers