Browse · MathNet
PrintSELECTION EXAMINATION 2019
Greece 2019 counting and probability
Problem
The sequence , , with integer terms, not necessarily different, has the following properties:
(α) , for every integer ,
(β) , for every integer .
Prove that for every integer , there exists such that .
(α) , for every integer ,
(β) , for every integer .
Prove that for every integer , there exists such that .
Solution
We will prove using induction with respect to that every initial part of the sequence consists of the following integers (not necessarily with the turn of the terms of the sequence) , for some with .
For , holds. Suppose that for the terms are of the form for some with .
Then, for , we have from (β) that: Moreover, we have: From relations (1) and (2) it follows that: From relation (3), by using that the binomial coefficients are increasing when the variable increases and they are decreasing when the variable increases, we conclude that or . In both cases the initial part of the sequence is of the form we seek. Therefore, according to the above conclusion, every integer will coincide to the term of the sequence for some with .
Indeed, the sequence will have terms , for some , and therefore we have the cases:
if , then , and so there exists such that . if , then , and so again there exists such that .
For , holds. Suppose that for the terms are of the form for some with .
Then, for , we have from (β) that: Moreover, we have: From relations (1) and (2) it follows that: From relation (3), by using that the binomial coefficients are increasing when the variable increases and they are decreasing when the variable increases, we conclude that or . In both cases the initial part of the sequence is of the form we seek. Therefore, according to the above conclusion, every integer will coincide to the term of the sequence for some with .
Indeed, the sequence will have terms , for some , and therefore we have the cases:
if , then , and so there exists such that . if , then , and so again there exists such that .
Techniques
Algebraic properties of binomial coefficientsInduction / smoothing