AoPS Academy
[/quote]
, do not answer with "
is a solution" only. Either you post any kind of proof or at least something unexpected (like "
is the smallest solution). Someone that does not see that is a solution of the above without your post is completely wrong here, this is an IMO-level forum.
grid consisting of 2025 unit squares. Within each unit square is a car, facing either up, down, left, or right. If the square in front of a car in the direction it is facing is empty, it can choose to move forward. Each car wishes to exit the grid.
cars from the grid in such a way that it becomes possible for all the remaining cars to eventually exit the grid. that guarantees that Kritesh's job is possible?
coins, all of which show 
on one side and 
on the opposite side. The coins are laid out in a row on the table. Peer and Solveig alternate taking turns. On his turn, Peer may turn over one or more coins, so long as he does not turn over two adjacent coins. On her turn, Solveig picks precisely two adjacent coins and turns them over. When the game begins, all the coins are showing . Peer plays first, and he wins if all the coins show simultaneously at any time. Find all 
for which Solveig can keep Peer from winning.
be an angle in the interval 
. Given that 
is irrational, and that 
and ![$ \cos[(k + 1)\theta ]$](http://latex.artofproblemsolving.com/b/3/a/b3a14c57a1a8b5a6585195c394181c5124f8c471.png)
are both rational for some positive integer 
, show that 
.
be three positive reals such that 
. Prove that![\[ \frac { x^5-x^2 }{x^5+y^2+z^2} + \frac {y^5-y^2}{x^2+y^5+z^2} + \frac {z^5-z^2}{x^2+y^2+z^5} \geq 0 . \]](http://latex.artofproblemsolving.com/a/1/4/a14adf0f1e35df57c734c7df701d5a67da22dc3c.png)
be a triangle with altitude 
. The 
-excircle touches 
at 
, and intersects the circumcircle at two points 
and 
. Prove that one can select points 
and 
on lines 
and 
such that quadrilateral 
is a rhombus.
be an integer. Two players, Alice and Bob, play the following game on the complete graph 
: They take turns to perform operations, where each operation consists of coloring one or two edges that have not been colored yet. The game terminates if at any point there exists a triangle whose three edges are all colored.
, Alice has a strategy such that, no matter how Bob colors the edges, the game terminates with the number of colored edges not exceeding![\[
\left( \frac{1}{4} - \varepsilon \right) n^2 + n.
\]](http://latex.artofproblemsolving.com/a/9/c/a9cca00e87c643af32eb75a2501b59060f3504fb.png)
such that the following inequality holds for all 
:![\[
ab + bc + ca \leq \frac{(a + b + c)^2}{3} + k \cdot \max \{ (a - b)^2, (b - c)^2, (c - a)^2 \} \leq a^2 + b^2 + c^2
\]](http://latex.artofproblemsolving.com/1/c/e/1ce66163068b499383adb4a4ecec86c5f4edaec3.png)
be positive real numbers such that : 
. Prove that : 
where 
are lengths of parallel sides and 
are other two sides.
, 
, 
, 
, 
in some order.
red balls and 
white balls. Audi took two balls at once from inside the bag. The chance of taking two balls of the same color is ...
unit. The area of the hexagon is ...
and are the roots of the cubic equation 
. The value of 
is ...
so that 
and 
is ...
, 
, 
, 
has an average of 
and a median of 
. The largest number of such data is ...
are integers greater than 
which are four consecutive quarters of an arithmetic row with 
. If 
and 
are squares of two consecutive natural numbers, then the smallest value of 
is ..., with 
, 
and 
. The points and 
lies on the line segment 
. with 
and 
. The measure of the angle 
is ...
meet 
for each natural number . The value of 
is ....
provided that the difference of any two numbers at least 
is ...
which satisfies 
are as many as ... with 
and 
. Point lies on the side so that 
. Suppose is a point on the side extension 
so that is perpendicular to . The point lies on the ray such that 
and 
. The large angle 
is ...
consists of integers with the following properties: For every three different members of there are two of them whose sum is a member of . The largest value of is ....
with 
positive reals is ....
with 
is ....
square units. Two plots are said to be neighbors if they both have one side in common. Initially, there are a total of coins on the chessboard where each coin is only loaded exactly on one square and each square can contain coins or blanks. At each turn. You must select exactly one plot that holds the minimum number of coins in the number of neighbors of the plot and then you must give exactly one coin to each neighbor of the selected plot. The game ends if you are no longer able to select squares with the intended conditions. The smallest number of so that the game never ends for any initial square selection is ....
, points and 
are marked such that 
and 
.
.
and 
Write only the answers to the questions given.
to be more exact:
in years 2002-08 time was 90' for part A and 120' for part B
.
so that 
.
.
.
by ASA. Therefore, 
.
.
,
and where 
.
.
.
.