1. Suppose . Prove that, there exist , satisfying two inequalities

if and only if

2. A circle meets the three sides of a triangle at points respectively. Furthermore, line segments and intersect at point , line segments and intersect at point , line segments and intersect at point . Prove that the lines are concurrent.

3. As in the graph, a pond is divided into 2n (n 5) parts. Two parts are called neighborhood if they have a common side or arc. Thus every part has three neighborhoods. Now there are 4n+1 frogs at the pond. If there are three or more frogs at one part, then three of the frogs of the part will jump to the three neighborhoods repsectively. Prove that for some time later, the frogs at the pond will uniformily distribute. That is, for any part either there are frogs at the part or there are frogs at the each of its neighborhoods.

4. The sequence {} is defined by: , and for ,

Let be an integer with . Prove that: for , we have

5. There are 5 points in a rectangle(including its boundary) with area 1, no three of them are in the same line. Find the minimum number of triangles with the area not more than , vertex of which are three of the five points.

6. Find all nonnegative integer solutions of the equation

Last edited by me on Fri Jan 28, 2005 2:21 pm; edited 1 time in total