- Test 1
The circle through of triangle meets sides at , respectively, and circumcircle of at . Prove: Reflection of across is on if and only if passes through (the circumcentre of ).
China Team Selection Test 2015.
The circle through of triangle meets sides at , respectively, and circumcircle of at . Prove: Reflection of across is on if and only if passes through (the circumcentre of ).
Fix positive integers . A candy vending machine has many different colours of candy, where there are candies of each colour. A couple of kids each buys from the vending machine candies of different colours. Given that for any kids there are two kids who have at least one colour of candy in common, find the maximum number of kids.
FIx positive integer . Prove: For any positive integers not exceeding , there exist integers with absolute value not exceeding and not all , such that
There are some players in a Ping Pong tournament, where every players play with each other at most once. Given: (1) Each player wins at least players, and loses to at least players. ( ) (2) For any two players , there exist some players ( ) (where , ), such that wins ( ). Prove that there exist distinct players , such that wins ( )
For a positive integer , and a non empty subset of , call good if the set does not contain the set . Find the smallest real number , such that for any positive integer , and any good subset of , .
Let be a positive integer, let be bounded real functions, and let be distinct reals. Show that there exists a real number such that .
Set to be a subset of size of . Prove that there exist pairwise disjoint, non-empty subsets such that and
is isosceles with . Let be a point in its interior such that . Suppose that the perpendicular bisector of meets the external angle bisector of at , and let be the intersection of the perpendicular bisector of and the external angle bisector of . Prove that are concyclic.
Let be a non-empty and finite set, subsets of , satisying:
(1) (2) Any element of is an element of at least sets among .
Show that one can select sets from such that their union is .
Let be two integers such that their gcd has at least two prime factors. Let and call irreducible if it cannot be expressed as product of two or more elements of (not necessarily distinct). Show there exists such that any element of can be expressed as product of at most irreducible elements.
Let be the complete graph on vertices. Each edge of is dyed red, blue or white. For a subset of vertices of , and a pair of vertices , define Prove that, for any choice of , there exist at least distinct values of .