A1. Given any set of ten distinct numbers in the range 10, 11, ... , 99, prove that we can always find two disjoint subsets with the same sum. A2. Given n > 4, prove that every cyclic quadrilateral can be dissected into n cyclic quadrilaterals. A3. Prove that (2m)!(2n)! is a multiple of m!n!(m+n)! for any non-negative integers m and n. B1.
Senin, 22 November 2010
14th International Mathematical Olympiad 1972 Problems & Solutions
01.38
Cool Math Games
No comments
0 komentar:
Posting Komentar