AoPS Academy
is called beautiful if the are at least 
integers 
such that in base 
we have that 
and 
end in the same digit. Find the sum of the two smallest beautiful numbers.
it is fixed positiv number.
, where 
are integer numbers .
be an integer. Rowan and Colin play a game on an 
grid of squares, where each square is colored either red or blue. Rowan is allowed to permute the rows of the grid and Colin is allowed to permute the columns. A grid coloring is orderly if: [list] [*]no matter how Rowan permutes the rows of the coloring, Colin can then permute the columns to restore the original grid coloring; and [*]no matter how Colin permutes the columns of the coloring, Rowan can then permute the rows to restore the original grid coloring. [/list] In terms of 
, how many orderly colorings are there?
is selected inside acute 
so that 
and 
. Point 
is chosen on ray 
so that 
. Let 
be the midpoint of 
.
is tangent to the circumcircle of triangle 
.
that satisfy![\[
f(x^2-y)+2yf(x)=f(f(x))+f(y)
\]](http://latex.artofproblemsolving.com/f/b/b/fbb693770cd90d8a144026608074122e54da5802.png)
for all 
.
and be positive integers. The cells of an 
grid are colored amber and bronze such that there are at least 
amber cells and at least 
bronze cells. Prove that it is possible to choose amber cells and bronze cells such that no two of the 
chosen cells lie in the same row or column.
and 
are erected outside an acute triangle 
Suppose that ![\[\angle BC_1C+\angle CA_1A+\angle AB_1B=180^{\circ}.\]](http://latex.artofproblemsolving.com/3/3/7/3378f0c4409d14bc0afddf2616992c13f624be3b.png)
Prove that lines 
and 
are concurrent.
-by- grid. He colors 
of the unit squares silver and the remaining squares gold. Kei then folds the grid in half vertically, forming pairs of overlapping unit squares. Let 
and equal equal the least and greatest possible number of gold-on-gold pairs, respectively. What is the value of 
?
-by- board of unit squares for some odd positive integer . We say that a collection 
of identical dominoes is a maximal grid-aligned configuration on the board if consists of 
dominoes where each domino covers exactly two neighboring squares and the dominoes don't overlap: then covers all but one square on the board. We are allowed to slide (but not rotate) a domino on the board to cover the uncovered square, resulting in a new maximal grid-aligned configuration with another square uncovered. Let 
be the number of distinct maximal grid-aligned configurations obtainable from by repeatedly sliding dominoes. Find the maximum value of as a function of .
is firm because 
. How many firm numbers are there?
. is even and 
, which inserted in equation (1) result in
is a firm number (since 
).
satisfy that 
.
