[/quote]
,
,
and 
are taken such that the point 
and 
.
and 
,
and 
are taken so that 
and 
.
.
and 
,
.
and 
be intersection points of lines 
and 
with circumcircle 
of triangle 
,
and 
intersection points of lines 
and 
with side 
.
,
with 
such that 
divides 
for all positive integers 
and 
with 
.
be a positive integer, and let 
denote the sum of the positive divisors of 
.
smallest positive integer relatively prime to 
.
denote the number of 
be the least quadratic non-residue mod 
.
is a non-negative arithmetic function and
is convergent for some 
,
,
such that any graph with 
vertices and at least 
and 
,
be vertices. Define a directed graph 
as follows: for any integer point 
,
,
.
,![\( G[k, l] \)](http://latex.artofproblemsolving.com/6/3/a/63a5df1124231155f3240a3e21e24d293d0e8db3.png)
denote the subgraph of ![\([k, l]\)](http://latex.artofproblemsolving.com/2/9/f/29f08f190960a99d062fde7f2128bcb635657f36.png)
.
such that for any integer 
,![\( G[r, r + \alpha - 1] \)](http://latex.artofproblemsolving.com/5/1/a/51afcceb73daae97f8fc61456bf043b73b2689d7.png)
of ![\( G[r, r + \alpha] \)](http://latex.artofproblemsolving.com/8/8/7/887e55f5636b842e7b64c9c03982b0374cdf1c9e.png)
(i.e., how many connected components and what each component is like).
of a graph be partitioned into 
,
.
.
.
-
.
where no more than one circle is disjoint.
be a median in an acute-angled triangle 
is chosen on the line through 
tangent to the circumcircle of 
so that 
.
and 
.
lies on the line 
be a cyclic quadrilateral for which 
.
and 
externally on the sides 
and 
respectively.
meets 
at 
meets 
at 
and 
denotes circumcenter of 
and 
meets again on 
.
.
and let 
be the 
are concyclic.
Y by Davi-8191, anantmudgal09, tenplusten, AlastorMoody, amar_04, SSaad, centslordm, megarnie, jhu08, mijail, Adventure10, Mango247, and 1 other user
Several positive integers are written in a row. Iteratively, Alice chooses two adjacent numbers 
and 
such that 
and is to the left of , and replaces the pair 
by either 
or 
. Prove that she can perform only finitely many such iterations.
Proposed by Warut Suksompong, Thailand
and 
such that 
and is to the left of , and replaces the pair 
by either 
or 
. Prove that she can perform only finitely many such iterations.Proposed by Warut Suksompong, Thailand
This post has been edited 3 times. Last edited by orl, Aug 8, 2013, 9:09 PM
Reason: Edited Title and Changed Format of The Problem.
Reason: Edited Title and Changed Format of The Problem.
to 
where 
.
has been increased by at least 
.
doesn't increase.
and hence the game has to end somewhere.
the game has ended).
(i think, it has been written by Carlos di Fiore as a comment ). Show that this cant be better.
,
,
,
,
,
and the number would be: 
.
.
.
.
at all times.
is trivial. After 1 move we have 
as both are integers, so no more moves can be performed.
be negative for any 
.
,
.
.
as they are both integers, and so 
never increases.
.
,
and thus 
.
again, so 
must become 
after some (finite by the inductive hypothesis) sequence of moves. This can be reached either by 
or otherwise. Regardless, after the necessary move on the first pair, we have 
.
,
-
as 
are integers, and so 
.
.
.
and 
.
or 
.
by definition. Thus the second pair must be operated on, at which point 
.
,
,
and 
,
and 
.
.
.
be the numbers during some stage.We consider the sum 
.
.
We use strong induction on 
the base case 
numbers, there can be only finitely many operations on them. Now append another number to the list. Let the numbers written be 
and let 
Note that 
never changes. Alice cannot operate on 
and 
Hence, she must operate on 
or otherwise the desired result would follow by applying the inductive hypothesis on 
and 
We then have 
After applying finitely many operations of 
,
from left to right.
,
.
.
,
it is trivial (0 steps).
denote the maximum number of steps for a sequence length 
.
number of steps to until there are no more possible steps 
such that if 
,
,
,
such that if we order some set with the 
t
,
,
.
permuations, so the number of steps Alice can perform is at most 
Don't have to be adjacent.
be the initial numbers on the row.
Does not change over the iterations.
be a number written in base 
.
strictly grows over the iterations and cannot grow over 
(In base 
(from left to right) is a strictly increasing. However, we see that the maximum number can only move to its right and its moving must terminate after a certain number of moves. Thus the algorithm must terminate after finitely many iterations.
be the numbers with 
be the maximum of them.
Maximum number 
As 
Hence after each move the new two numbers are less than or equal to 
So 
increases in every step.
If 
which is true as 
If 
which is true as 
So, the number of steps are finite 
since it also increases the sum of the numbers. So, Alice must perform the second operation when 
infinitely many times – after some point, her moves will only be the second operation on 
.
in that order.
is nondecreasing.
.
.
.
.
,
to the left of 
to the number at position 
,
be the weight at 
be the weight at 
Note that both of these are greater than the initial, so our weighted sum takes an increase after each move.
is obvious.
,
.
,
,
are obvious.
of arbitrary positive integers the process terminates after 
on the left end is on slot 
is on the right most slot 
.
.
of all 
written on the board.
or on 
.
can't be operated on anymore after finitely many moves (say 
and 
moves respectively) and that 
and 
.
after some time. 
,
)
or our maximum is on the right most slot.
Clearly each move takes the current permutation on some fixed direction either up or down 
is finite and thus Alice can only perform a finite amount of moves. QED
(from the set of 
)
then 
,
config, notice that: 
is lexicographically smaller than 
.
from left to right. Then the number in base 
from left to right is strictly increasing. Since this number cannot go beyond 
,
