- Day 1
For positive integers such that are pairwise distinct, find the minimum possible amount of distinct positive integers in the set .
Chinese Mathematical Olympiad 2006.
For positive integers such that are pairwise distinct, find the minimum possible amount of distinct positive integers in the set .
Positive integers satisfy , prove that at least one of the equations and has an odd solution.
In a right angled-triangle , . Its incircle meets , , at , , respectively. cuts at . If , prove .
Suppose is a set with . Find the minimum value of , so that for any 15 subsets of , if the cardinality of the union of any 7 of them is greater or equal to , then there exists 3 of them whose intersection is nonempty.