2000 USAMO Problems: Difference between revisions
create [wrong page] |
FantasyLover (talk | contribs) |
||
| Line 32: | Line 32: | ||
=== Problem 4 === | === Problem 4 === | ||
Find the smallest positive integer <math>n</math> such that if <math>n</math> squares of a <math>1000\times 1000</math> chessboard are colored, then there will exist three colored squares whose centers form a right triangle with sides parallel to the edges of the board. | |||
* [[2000 USAMO Problems/Problem 4 | Solution]] | * [[2000 USAMO Problems/Problem 4 | Solution]] | ||
Revision as of 14:53, 30 March 2009
Day 1
Problem 1
Call a real-valued function
very convex if
holds for all real numbers
and
. Prove that no very convex function exists.
Problem 2
Let
be the set of all triangles
for which
where
is the inradius and
are the points of tangency of the incircle with sides
respectively. Prove that all triangles in
are isosceles and similar to one another.
Problem 3
A game of solitaire is played with
red cards,
white cards, and
blue cards. A player plays all the cards one at a time. With each play he accumulates a penalty. If he plays a blue card, then he is charged a penalty which is the number of white cards still in his hand. If he plays a white card, then he is charged a penalty which is twice the number of red cards still in his hand. If he plays a red card, then he is charged a penalty which is three times the number of blue cards still in his hand. Find, as a function of
and
the minimal total penalty a player can amass and all the ways in which this minimum can be achieved.
Day 2
Problem 4
Find the smallest positive integer
such that if
squares of a
chessboard are colored, then there will exist three colored squares whose centers form a right triangle with sides parallel to the edges of the board.