NEPAL TST DAY 2 PROBLEM 2
by Tony_stark0094, Apr 12, 2025, 8:37 AM
Kritesh manages traffic on a 
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.
Kritesh realizes that it may not always be possible for all the cars to leave the grid. Therefore, before the process begins, he will remove
cars from the grid in such a way that it becomes possible for all the remaining cars to eventually exit the grid.
What is the minimum value of that guarantees that Kritesh's job is possible?
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.Kritesh realizes that it may not always be possible for all the cars to leave the grid. Therefore, before the process begins, he will remove
cars from the grid in such a way that it becomes possible for all the remaining cars to eventually exit the grid.What is the minimum value of
that guarantees that Kritesh's job is possible?
where 
are lengths of parallel sides and 
are other two sides.
be positive real numbers such that : 
. Prove that : 
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 an integer. Two players, Alice and Bob, play the following game on the complete graph 
:
,![\[
\left( \frac{1}{4} - \varepsilon \right) n^2 + n.
\]](http://latex.artofproblemsolving.com/a/9/c/a9cca00e87c643af32eb75a2501b59060f3504fb.png)
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 
for which Solveig can keep Peer from winning.
be a triangle with altitude 
.
-
at 
,
and 
.
and 
on lines 
and 
such that quadrilateral 
is a rhombus.
be an angle in the interval 
.
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 
,
.
,
,
,
,
in some order.
be three positive reals such 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)
April 2025
November 2024