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.
, where a > 0 and 
is differentiable such that 
Then which of the following is correct?
always exists but not necessarily zero. always exists and is equal to zero. may not exist. exists if 
is twice differentiable.
such that for all 
, ![\[xf(y+x)+(y+x)f(y)=f(x^2+y^2)+2f(xy)\]](http://latex.artofproblemsolving.com/5/b/1/5b101ead6195155ccbd99b757016e8f73dac4411.png)
Proposed by Aritra Mondal
be positive real numbers such that 
. Prove that
with rational coordinates lie on a plane. It turned out that the distance between every pair of points is an integer. Prove that there exist points 
with integer coordinates such that 
, 
, 
checkered board is cut into several squares with integer side length. The size of a square is it's side length.
of integers, a pair 
with 
is called interesting if there exists a pair 
of integers with 
such that 
For each 
, find the largest possible number of interesting pairs in a sequence of length 
.
such that, for all 
,
cards on which the numbers 
, 
, 
, are written respectively. Alice and Bob play the following game: in each turn, Alice gives two cards to Bob, who must keep one card and discard the other. The game proceeds for four turns in total; in the first two turns, Bob cannot keep both of the cards with the larger numbers, and in the last two turns, Bob also cannot keep both of the cards with the larger numbers. Let 
be the sum of the numbers written on the cards that Bob keeps. Find the greatest positive integer 
for which Bob can guarantee that is at least .
be positive real number such that 
Find the minimum value of 
steps, we get routes. step of 
then there are 
routes since this step happens before you exceed . step of then there are routes since the first such step must happen immediately. steps of .
routes. This is also how many times 
happens since every positive integer is uniquely reachable from by a sequence of 
and 
moves. happens are:
prove inequality 
Prove that
Where 
be a sequence of integers, with 
and for evert integer 
,
and 
.
.
is the number of ways 
We have 
because you can add 
times, you can multiply by 
to 
,