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.
and 
such that 
and 
is a prime number
, let 
be the midpoint of side 
. Let the line perpendicular to 
at point 
intersect 
at 
. If 
is tangent to 
at 
, find 
.
of side length 
lies in the union of five equilateral triangles of side length 
, show that there exist four equilateral triangles of side length whose union contains .
is a polynomial of degree 
such that
.
write all its divisors in increasing order: 
. such that 
.
is called good if there exists a permutation 
of the numbers 
, such that:
and 
have different parities for every 
is a quadratic residue modulo 
for every 
is considered a quadratic residue modulo if there exists an integer 
such that 
.
be a triangle. Let 
be a circle passing through intersecting at 
and at 
. Let 
be the intersection of 
and . Further, let and be the intersections of 
and 
with the tangent to 
at 
. Now, let 
be the second intersection of 
and . Then, prove that , , , 
and are concyclic.
, 
is the midpoint of 
. 
is an arbitrary point on 
. Let 
be the intersection of 
and 
. The line 
intersects with the circumcircle of 
, for the second time at 
. 
is the circumcenter of triangle 
. Prove that 
.
where 
are integers such that 
for all 
.
a prime number with 
and 
when 
. then 
else 
.
, 
, 
, 
are integers such that 
.
and 
of 
such that for each integer 
with 
, we have![\[ n\mid a_i - b_i - c_i
\]](http://latex.artofproblemsolving.com/1/a/e/1ae8d54f068b646ac7a1e43d75e7f26510cfdc95.png)
be a finite abelian group of order 
.
be arbitrary.
and pairwise distinct 
such that 
for 
.
and 
s.t 
and 
and there are exactly two i;j s.t 
and 
.Then if we know two permutation good for the sequence (a_1...a_n) then we can build two permuttionm good for (b_1...b_n)
Please post it here and now!
that add 
to 
and subtract from 
.
that add to and subtract from .
and 
of ![$[n]$](http://latex.artofproblemsolving.com/0/d/e/0deff9086fd7840ef23860f5bc924f1d4d2d2310.png)
for some sequence ![$\{ a_i\}_{i\in [n]}$](http://latex.artofproblemsolving.com/f/6/e/f6e384c04b4aaf07513dacb66f8cadc0a597069e.png)
so that 
for all ![$i\in [n]$](http://latex.artofproblemsolving.com/e/e/5/ee51c5c5eb09111cc774a00e9970074ad9f9058c.png)
.![$\{ b_i\}_{i\in [n]}$](http://latex.artofproblemsolving.com/1/3/e/13e91e327fa3f2bc2d43edbe110540d350184040.png)
with sum divisible by that differ, in modulo , from in only two positions, say 
and 
.
and 
of so that 
for all .
for all that 
.
by, for each integer 
, define ![$i_{k+1}\in [n]$](http://latex.artofproblemsolving.com/c/e/5/ce54cff3726a2dae0e8cc97f7b358dd90622aeee.png)
to be the unique integer satisfy 
.
are the indices that 
with minimal 
, and then minimal 
.
. This means 
for all 
. for 
gives us
Plugging and use 
gives us 
.
, contradiction to the definition of 
.
. Let 
. Define the desired permutations and as follows:
and 
for the rest that 
.
is just to not use 
more than one time.
for all except when 
. and are permutations of , we've ![$\sum_{i\in [n]}{(\sigma' (i)+\tau' (i))} \equiv_n 2\times \frac{n(n-1)}{2}\equiv_n 0\equiv_n \sum_{i\in [n]}{b_i}$](http://latex.artofproblemsolving.com/4/0/c/40ce5067c15701668f9fc9a82369ce8ab1f4384c.png)
.
when too. This prove the validity of permutations we constructed.
for 
on the coordinate plane with coordinates modulo . We want to show that it is possible to choose the points plotted to have 
be any multiset of elements 
such that sum of the elements is 
. Note that the points plotted can be any points not in the same row or column.
points not in the same row or column such that the multiset 
of 
for all of the points 
can be any multiset of elements . Then, we can choose the unique point not in the same row or column as the points to obtain points for the original statement, as the sum of the coordinates of all points is necessarily 
. points in the following way. arbitrary points not in the same row or column. We will change the points in such a way that we can replace any element of by any residue . Suppose we change the element in corresponding to a point 
. Then, we will shift horizontally until the sum of the coordinates of is the desired value . Now, we might have two points in the same column. We will repeatedly perform the following operation. distinct rows taken up by the points. If the last point moved was and it is in the same column as 
, we will move on the line through with slope 
until occupies the previously empty row. to a point 
, then on the next step it moves to a point 
. We see that 
and 
both have slope . Now, note that and must be in the same row. Furthermore, after the operation moves to , the row containing must be empty, meaning that must be moved to that row. This implies that and are in the same row. Therefore, we see that 
is a cyclic isosceles trapezoid and in particular the perpendicular bisectors of and are the same, proving the claim. points to distinguish them. Now, there are finitely many states of the points, so eventually the operation must loop through a cycle of states. In this cycle, start at an arbitrary state. Now, since at least 
point must be moved and then return back to its original position, consider the point which returns to its original position the earliest. When was moved, the next point which was moved must have occupied the original row of . However, if was moved back to its original position, then the original row of must be vacant, so must have been moved. However, this implies that was moved back to its original position before by the claim, a contradiction, so we are done.
be real numbers such that 
.
![\[
r_1 \ge r_a,\quad r_2 \ge r_b,\quad r_3 \ge r_c
\]](http://latex.artofproblemsolving.com/8/2/1/8214c052ab9ad2c979414f92b6707fa6de33664f.png)
because if any of the radii were smaller than these, the circles would not be able to reach and touch the incircle.![\[
\frac{r_1 + r_2 + r_3}{r} \ge \frac{r_a + r_b + r_c}{r}
\]](http://latex.artofproblemsolving.com/b/b/a/bbadb40e6aa197207abfa907981e0a4a88926969.png)
![\[
\frac{r_a + r_b + r_c}{r} = \frac{h_a - 2r}{h_a} + \frac{h_b - 2r}{h_b} + \frac{h_c - 2r}{h_c}
\]](http://latex.artofproblemsolving.com/5/3/2/5329fec1f02a728b5f34817e0ed43ded663516ae.png)
![\[
= \left(1 - \frac{2r}{h_a}\right) + \left(1 - \frac{2r}{h_b}\right) + \left(1 - \frac{2r}{h_c}\right)
= 3 - 2r \left( \frac{1}{h_a} + \frac{1}{h_b} + \frac{1}{h_c} \right)
\]](http://latex.artofproblemsolving.com/1/e/0/1e087ea87566fb4cf8cd2ae0cda3389247095eea.png)
![\[
\frac{1}{h_a} + \frac{1}{h_b} + \frac{1}{h_c} = \frac{a + b + c}{2S}
\]](http://latex.artofproblemsolving.com/a/4/a/a4ab49131584cf2028270e7248fcbb5d2c6a7adb.png)
![\[
3 - 2r \cdot \frac{a + b + c}{2S} = 3 - \frac{4S}{a + b + c} \cdot \frac{a + b + c}{2S} = 3 - 2 = 1
\]](http://latex.artofproblemsolving.com/0/f/3/0f3ada5ca22deeecc1644d79138942caf04d5134.png)
![\[
\frac{r_1 + r_2 + r_3}{r} \ge 1
\]](http://latex.artofproblemsolving.com/7/1/e/71ea14c8fb8e3860a1db427a0afcdb3b2fd6254b.png)
.
