AoPS Academy
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 parallelepiped with 
. Prove the inequality![\[AF + AH + AC \leq AB + AD + AE + AG.\]](http://latex.artofproblemsolving.com/8/3/4/834d359bd00fe022ef8cab319963125ae3b879b7.png)
![\[AF + AH + AC\le AB + AD + AE + AG.\]](http://latex.artofproblemsolving.com/7/b/7/7b76f8e16e2faf5b62e86f0a38e8243cbd87bd4f.png)
, 
and 
, then the inequality reduces to :
.
that means it's rectangular 