- Day 1
- Difficulty band 6
S is the set {1, 2, 3, ... , 1000000}. Show that for any subset A of S with 101 elements we can find 100 distinct elements of S, such that the sets + A are all pairwise disjoint. [Note that + A is the set {a + | a is in A} ].
International Mathematical Olympiad 2003.
S is the set {1, 2, 3, ... , 1000000}. Show that for any subset A of S with 101 elements we can find 100 distinct elements of S, such that the sets + A are all pairwise disjoint. [Note that + A is the set {a + | a is in A} ].
Determine all pairs of positive integers such that is a positive integer.
Each pair of opposite sides of a convex hexagon has the following property: the distance between their midpoints is equal to times the sum of their lengths. Prove that all the angles of the hexagon are equal.
Let be a cyclic quadrilateral. Let , , be the feet of the perpendiculars from to the lines , , , respectively. Show that if and only if the bisectors of and are concurrent with .
Attachments:

Given n > 2 and reals ≤ ≤ ... ≤ , show that (∑ - | ) ≤ (2/3) ( - 1) ∑ ( - ). Show that we have equality iff the sequence is an arithmetic progression.
Let be a prime number. Prove that there exists a prime number such that for every integer , the number is not divisible by .
Attachments:
