.
,
.
lies on 
such that 
.
passing trough 
at 
.
.
such that
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 
is selected inside acute 
so that 
and 
.
is chosen on ray 
so that 
.
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 
.
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 
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.
-
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 
?
of identical dominoes is a maximal grid-aligned configuration on the board if 
dominoes where each domino covers exactly two neighboring squares and the dominoes don't overlap: 
be the number of distinct maximal grid-aligned configurations obtainable from 
Y by
A pair of positive integers 
is good if they satisfy 
and they do not divide each-other. Given coprime positive integers 
and 
, show that there exist infinitely many 
for which there exists a positive integer 
such that 
is good.
(Here,
denotes the product of 
's prime divisors, as usual.)
is good if they satisfy 
and they do not divide each-other. Given coprime positive integers 
and 
, show that there exist infinitely many 
for which there exists a positive integer 
such that 
is good.(Here,
denotes the product of 
's prime divisors, as usual.)This post has been edited 4 times. Last edited by Iveela, Jan 20, 2025, 2:38 PM
be an arbitrary prime number. If ![\[a^n + bm \quad ; \quad a^{n + 1} - b^{n + 1} \quad ; \quad b^n + am\]](http://latex.artofproblemsolving.com/f/3/7/f379c0956d1ff755f8e371ad1923649b42f94b20.png)
and 
,![\[p \mid a(a^n + bm) - b(b^n + am) = a^{n + 1} - b^{n + 1}\]](http://latex.artofproblemsolving.com/0/f/5/0f5b0e432b7cf26880d1a19532ce8f4031170b45.png)
and ![\[p \mid a(a^n + bm) - (a^{n + 1} - b^{n + 1}) = b^{n + 1} - abm\]](http://latex.artofproblemsolving.com/3/e/9/3e929d46650b0a2d816f672dd4b1cefdeffe20a5.png)
Since 
,
which implies 
satisfy the following three conditions, then there exists 
and 
.
satisfy 
.
divides 
.
which implies 
and hence, 
.
divisible by 
.
and ![\[a(bk + 1) - b(ak + 1) = a - b\]](http://latex.artofproblemsolving.com/3/e/3/3e30cf674e0ec1e313580e9ae86b9f927003a0a1.png)
.
and 
.
.
which satisfies the conditions of Claim 3. Let 
and 
.![\[\frac{a^n- b^n}{a - b} = a^{n - 1} + a^{n - 2}b + \dots + b^{n - 2}a + b^{n - 1} > n \cdot a^{n - 1} > a^n\]](http://latex.artofproblemsolving.com/a/d/3/ad320a370dea0f044c24490c2d1f03369e2f525d.png)
We also have 
and 
.
.
by 
