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.
rows of coins. There is 1 coin in the first row, 2 coins in the second row, 3 coins in the third row, and so on, up to coins in the th row. Initially, all of the coins show heads (H). Carley plays a game in which, on each turn, she chooses three mutually adjacent coins and flips these three coins over. To win the game, all of the coins must be showing tails (T) after a sequence of turns. An example game with 4 rows of coins after a sequence of two turns is shown. for which it is possible to win the game starting with rows of coins.
satisfying 
, prove that![\[ \frac{a^4+5b^4}{a(a+2b)} + \frac{b^4+5c^4}{b(b+2c)} + \frac{c^4+5a^4}{c(c+2a)} \geq 1- ab-bc-ca \]](http://latex.artofproblemsolving.com/f/e/8/fe85cf52b883c214806ab837a2eb25cebb511d7b.png)
such that there exists a unique integer 
such that 
with the following property:![\[ n!\mid a^n + 1
\]](http://latex.artofproblemsolving.com/e/2/3/e23d39aab685888993d355d8c93d4e6475f53487.png)
(use in a problem for junior) to practice. Can anyone share to me?
be a square with 
side length and with center 
. A rhombus 
is drawn where point 
lies on line 
. What is the area of ?
be an odd integer, 
. Consider 
integers 
such that for any 
, 
and 
. Prove that the number of 
for which satisfy 
for some 
, 
is greater than 
.
such that![\[f(x+yf(x))+f(xf(y)-y)=f(x)-f(y)+2xy\]](http://latex.artofproblemsolving.com/e/b/c/ebccae7e765d9fc3c8605e58a7399a70127b39b1.png)
and natural number ,
, such that 
Prove that :
equality cases : ?
and 
are drawn on the adjacent sides 
and 
of parallelogram , respectively. It is known that 
. Consider segments 
, 
, 
, 
, 
, 
. What is the largest number of different ones among them?
satisfy that: 
