Browse · MathNet
PrintSAUDI ARABIAN MATHEMATICAL COMPETITIONS
Saudi Arabia counting and probability
Problem
Given four numbers , let be a permutation of and set , , , and . From , form in the same fashion the numbers , and so on. It is known that , , , for some . Find all possible values of .
Solution
First, consider 4 sequences with , , , , is permutation of . And with is a permutation of . From this, it is easy to see that for all . Let . We have The equality occurs when there is at least one number among is equal to . Hence the sequence is non-increasing. Suppose that is a positive integer such that , then which implies that . So there is at least one number among equal to . Based on the definition of the sequences, we can see that for each , the tuple has some common properties as follows: 1. There is at least one number that is . 2. There are two numbers equal. 3. In the permutation to obtain the next term, two equal numbers must be adjacent. It is easy to check that 3 tuples as follows satisfy the given conditions:
i. If . ii. If with and its permutation. iii. If with and its permutation.
Indeed, when is one of the 3 above tuples, then the form of tuple will not change. Continue, we will prove that if is a tuple that satisfies the condition, then it must be one of the 3 above forms. (*)
Without loss of generality, we may assume that . Since there are two numbers equal among 4 numbers, we consider some cases:
1. If then we have with . Based on the 3rd property, can only be . Apply the 2nd property, we have: - If , we have , which satisfies the given condition. - If , then we have with . So will be . But from this, the form will not change, so we cannot obtain the original form anymore. This case doesn't satisfy. - If then , we have and . But the form of this tuple will not change and similarly, this case doesn't satisfy.
2. If , then we have with . So can be . Apply the 2nd property, we have: - If , we have , not satisfy. - If , we have the tuple and . It is easy to see that this case doesn't satisfy. - If , we have which satisfies.
3. If then we have with . So can be . Apply the 2nd property, we have: - If , we have , satisfies. - If , we have , not satisfy. - If , we have the tuple and . It is easy to see that this case doesn't satisfy.
Therefore, there are 3 tuples that satisfy the given condition as above.
i. If . ii. If with and its permutation. iii. If with and its permutation.
Indeed, when is one of the 3 above tuples, then the form of tuple will not change. Continue, we will prove that if is a tuple that satisfies the condition, then it must be one of the 3 above forms. (*)
Without loss of generality, we may assume that . Since there are two numbers equal among 4 numbers, we consider some cases:
1. If then we have with . Based on the 3rd property, can only be . Apply the 2nd property, we have: - If , we have , which satisfies the given condition. - If , then we have with . So will be . But from this, the form will not change, so we cannot obtain the original form anymore. This case doesn't satisfy. - If then , we have and . But the form of this tuple will not change and similarly, this case doesn't satisfy.
2. If , then we have with . So can be . Apply the 2nd property, we have: - If , we have , not satisfy. - If , we have the tuple and . It is easy to see that this case doesn't satisfy. - If , we have which satisfies.
3. If then we have with . So can be . Apply the 2nd property, we have: - If , we have , satisfies. - If , we have , not satisfy. - If , we have the tuple and . It is easy to see that this case doesn't satisfy.
Therefore, there are 3 tuples that satisfy the given condition as above.
Final answer
All permutations of (0, 0, 0, 0), (a, a, 0, 0) with a > 0, and (2a, a, a, 0) with a > 0.
Techniques
Invariants / monovariantsRecurrence relations