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.
is written on the board. A move consists of adding either , 
or 
to the number written on the board, but only if the chosen number is coprime with the current number (for example, if the current number is 
, then in a move a player can't choose the number , but he can choose either or ). The player who first writes a perfect square on the board loses. Prove that one of the players has a winning strategy and determine who wins in the game.
of positive integers is called central if for every positive integer 
, the arithmetic mean of the first 
terms of the sequence is equal to .
of positive integers such that for every central sequence 
there are infinitely many positive integers with 
.
be a triangle. Let 
be a circle passing through 
intersecting 
at 
and 
at 
. Let 
be the intersection of 
and . Further, let 
and 
be the intersections of 
and 
with the tangent to 
at 
. Now, let 
be the second intersection of 
and . Then, prove that , , , 
and are concyclic.
be a polynomial with integer coefficients such that 
, and let 
be an integer. Define 
and 
for all integers 
. Show that there are infinitely many positive integers such that 
.
table filled with natural numbers, we say it is a divisor table if:
-th row are exactly all the divisors of some natural number 
,
-th column are exactly all the divisors of some natural number 
,
for every 
.
is given. Determine the smallest natural number , divisible by , such that there exists an divisor table, or prove that such does not exist. be an acute triangle with circumcenter 
. Points and are chosen on segments 
and 
such that 
. If is the midpoint of the arc 
and is the midpoint of the arc 
, prove that 
.
, 
, 
be non-negative real numbers, no two of which are zero. Prove that :
that, for all and positive real numbers 
, there is![\[\sum_{i=1}^n \frac{x_i^2}{\sum_{j=1}^i x_j}\geq C \ln n\left(\prod_{i=1}^n x_i\right)^{\frac{1}{n}}\]](http://latex.artofproblemsolving.com/4/8/b/48b9fc4af5a20de7fd9dfc45a74d5aa27e615e46.png)
squares with two game pieces. At the beginning, Alice’s piece is on the first square while Bob’s piece is on the last square. The figure shows the starting position for a strip of 
squares. can Bob ensure a win no matter how Alice plays? can Alice ensure a win no matter how Bob plays?
such that 
coprime, 
and 
.
![\[
\text{Find all functions } f : \mathbb{R} \to \mathbb{R} \text{ such that:} \\
f(a^4 + a^2b^2 + b^4) = f\left((a^2 - f(ab) + b^2)(a^2 + f(ab) + b^2)\right)
\]](http://latex.artofproblemsolving.com/2/a/7/2a73a5e58eab4a994fbd83160fb79a0b00152951.png)
.
with 
such that, 
=
.
so 
and 
.
.
.
.
.
you can use 
.
and 
.