2005 QEDMO 1st
Part of QEDMO
Subcontests
(14)Number of sequences
Let n be a positive integer.
Find the number of sequences a1,a2,...,ak of different numbers from {1,2,3,...,n} with the following property:
for every number a of the sequence (except the first one) there exists a previous number b such that their difference is 1 (so a−b=±1) Differences in a subset give all possible differences
Prove:
From the set {1,2,...,n}, one can choose a subset with at most 2⌊n⌋+1 elements such that the set of the pairwise differences from this subset is {1,2,...,n−1}.
(⌊x⌋ means the greatest integer ≤x) Two-element-subsets
Let n≥3 be an integer. Let also P1,P2,...,Pn be different two-element-subsets of M={1,2,...,n}, such that when for i,j∈M,i=j the sets Pi,Pj are not totally disjoint, then there is a k∈M with Pk={i,j}.
Prove that every element of M occurse in exactly 2 of these subsets. A+b+c divides a²+b²+c²
Let a,b,c be positive integers such that a2+b2+c2 is divisble by a+b+c.
Prove that at least two of the numbers a3,b3,c3 leave the same remainder by division through a+b+c.