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.
weights, each weighing 
and another 
weights with 
each. Write a algorithm that determines the ways in which a scale can be balanced with a weight 
on the left pan, and display the number of possible solutions. (The weights can be placed on both pans and the program starts with the numbers 
. What will be displayed after three successive runs: 5,2,5,1,4 | 5,2,5,1,11 | 5,2,5,1,20?
be a positive root of the equation 
. Prove that the following sequence converges: 
be defined by![\[
a_1 = 1, \quad a_{n+1} = a_n + \frac{1}{\sqrt[2024]{a_n}} \quad \text{for } n \geq 1, \, n \in \mathbb{N}
\]](http://latex.artofproblemsolving.com/8/8/f/88f423d87c08b20dc552703fcf30f2a8e9585902.png)
Prove that![\[
a_n^{2025} >n^{2024}
\]](http://latex.artofproblemsolving.com/a/6/8/a6806c817edb7ce29a399981137c1a3e93f63c63.png)
for all positive integers 
.
with 
and the circle 
of radius 
centered at 
Let 
be the midpoint of 
The line 
intersects a second time at 
Let 
be a point on such that 
Let 
be the intersection of 
and Prove that 
such that for any set of consecutive integers taken from the given set of integers, there will always be a colour colouring exactly one of them? That is, for all integers 
such that 
, there will be a colour coloring exactly one integer from the set 
.
such that: 
. Find the maximum: 
such that if![\[
1 = d_1 < d_2 < \cdots < d_{k-1} < d_k = n
\]](http://latex.artofproblemsolving.com/a/d/2/ad2cbfe9e2110de2fdb6308d93f58880bd79afbc.png)
are the divisors of , then the sequence![\[
d_2 - d_1,\, d_3 - d_2,\, \ldots,\, d_k - d_{k-1}
\]](http://latex.artofproblemsolving.com/d/2/3/d239210af0c2aa005ee1e5b820678d4aadc366c0.png)
forms a permutation of an arithmetic progression.(Kritesh Dhakal,Nepal)
be a finite set of integers. Prove that there exists a number 
depending on such that for each non-constant polynomial 
with integer coefficients the number of integers 
satisfying 
does not exceed 
.
such that 
and 
for all reals 
.
, 
be positive integers such that 
is a multiple of 
for all positive integers . Prove that 
.
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 ....
tetrahedron: 
. It is known that four segments connecting the vertices of the tetrahedron with the centers of the circles inscribed in opposite faces intersect at one point. Find the lengths of edge 
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