[/quote]
,
and 
be sequences of real numbers for which 
and
for all positive integers 
.
for which 
for all 
)
and 
be two concentric circles. Let 
and 
be any two equilateral triangles inscribed in 
and 
are any two points on ![\[ P'A^2 + P'B^2 + P'C^2 = A'P^2 + B'P^2 + C'P^2. \]](http://latex.artofproblemsolving.com/2/a/7/2a73de753f0332329b743d494272d3fb85f60ef9.png)
(meaning 
takes pairs of positive real numbers to positive real numbers) such that for any real numbers 
,
holds; and
then 
.
Prove that
,
,
,
and 
.
to meet the circumcircle of triangle 
at 
.
.
people, there are at least 
of them, each of whom either knows both or else knows neither of the two. Assume that knowing is a symmetric relation, and that 
denotes the greatest integer less than or equal to 
.
such that![\[2^{n!}+1\mid 2^{m!}+19\]](http://latex.artofproblemsolving.com/8/7/e/87ede5616cffcb33aa187f5d8a13827470f741b4.png)
,
and a positive integer 
is given.
and for each 
![\[f_n(k)=\frac{a_n+\dots+a_{k+1}}{n-k}-\frac{a_k+\dots+a_1}{k}\]](http://latex.artofproblemsolving.com/0/4/1/041f80cf63f17c0f62c166021af474a5d305eb87.png)
Then for every integer 
the condition![\[a_{n+1}=\max_{0\leq k<n}(f_n(k))\]](http://latex.artofproblemsolving.com/b/1/f/b1f5aff787de8fc9c113cf8441a6b2900a19f24f.png)
is satisfied. Prove that this sequence must be eventually constant.
be a positive integer. For every positive integer 
the sequence 
is defined, where 
are integers. Among these 
.
and 
and 
respectively such that 
.
and 
meet at 
.
is the incenter of 
and 
is the orthocenter of 
.
and 
are circles with diameter 
and 
,
and 
.
.
with 
with all the unit squares are initially white coloured. Every move, we can turn the color (from white to black or otherwise) from the 5 unit squares that form this T-pentomino which can be rotated or reflexed (see the image below). Determine all natural numbers 
such that![\[f(f(f(\frac{x+y}{2}))+x+y)=f(x)+f(y)+f(\frac{x+y}{2})\]](http://latex.artofproblemsolving.com/6/2/4/624afa78b68f810aaaecf0e1e2251047beeddc36.png)
for all rational numbers 
.
in term of a function 
such that 
Prove that
Y by
For each integer 
we consider the last digit different from zero in the decimal expansion of 
. The infinite sequence of these digits starts with 
. Determine all digits which occur at least once in this sequence, and show that each of those digits occurs in fact infinitely often.
we consider the last digit different from zero in the decimal expansion of 
. The infinite sequence of these digits starts with 
. Determine all digits which occur at least once in this sequence, and show that each of those digits occurs in fact infinitely often.
analysis, and thus it suffices to look at the last digit mod t. Then we can verify the sequence repeats, and this gives (I think?) All even numbers.
