Subcontests
(6)Permutation of the set gives all the residues modulo n
We call a positive integer n≥4 beautiful if there exists some permutation {x1,x2,…,xn−1} of {1,2,…,n−1} such that {x11, x22, …,xn−1n−1} gives all the residues {1,2,…,n−1} modulo n. Prove that if n is beautiful then n=2p, for some prime number p. Easy combinatorics problem
Given positive integers a,b, find the least positive integer m such that among any m distinct integers in the interval [−a,b] there are three pair-wise distinct numbers that their sum is zero.
Proposed by Marian Tetiva, Romania Sequence of positive integers
Find all positive integers (r,s) such that there is a non-constant sequence an os positive integers such that for all n=1,2,…
an+2=(1+a1sa2r)(1+a2sa3r)…(1+ansan+1r).
Proposed by Navid Safaei, Iran