Find the largest possible integer $k$, such that the following statement is true: Let $2009$ arbitrary non-degenerated triangles be given. In every triangle the three sides are coloured, such that one is blue, one is red and one is white. Now, for every colour separately, let us sort the lengths of the sides. We obtain \[ \left. \begin{array}{rcl} & b_1 \leq b_2\leq\ldots\leq b_{2009} & \textrm{the lengths of the blue sides }\\ & r_1 \leq r_2\leq\ldots\leq r_{2009} & \textrm{the lengths of the red sides }\\ \textrm{and } & w_1 \leq w_2\leq\ldots\leq w_{2009} & \textrm{the lengths of the white sides }\\ \end{array}\right.\] Then there exist $k$ indices $j$ such that we can form a non-degenerated triangle with side lengths $b_j$, $r_j$, $w_j$. [i]Proposed by Michal Rolinek, Czech Republic[/i]

A sequence of polynomial $f_n(x)\ (n=0,1,2,\cdots)$ satisfies $f_0(x)=2,f_1(x)=x$, \[f_n(x)=xf_{n-1}(x)-f_{n-2}(x),\ (n=2,3,4,\cdots)\] Let $x_n\ (n\geqq 2)$ be the maximum real root of the equation $f_n(x)=0\ (|x|\leqq 2)$ Evaluate \[\lim_{n\to\infty} n^2 \int_{x_n}^2 f_n(x)dx\]

Demonstrate that if $ z_1,z_2\in\mathbb{C}^* $ satisfy the relation: $$ z_1\cdot 2^{\big| z_1\big|} +z_2\cdot 2^{\big| z_2\big|} =\left( z_1+z_2\right)\cdot 2^{\big| z_1 +z_2\big|} , $$ then $ z_1^6=z_2^6 $

(a) Find all strictly monotone functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that \[f(x+f(y))=f(x)+y\quad\text{for all real}\ x,y. \] (b) If $n>1$ is an integer, prove that there is no strictly monotone function $f:\mathbb{R}\rightarrow\mathbb{R}$ such that \[ f(x+f(y))=f(x)+y^n\quad \text{for all real}\ x, y.\]

(a) Show that, for each positive integer $n$, the number of monic polynomials of degree $n$ with integer coefficients having all its roots on the unit circle is finite. (b) Let $P(x)$ be a monic polynomial with integer coefficients having all its roots on the unit circle. Show that there exists a positive integer $m$ such that $y^m=1$ for each root $y$ of $P(x)$.

$p(x)$ is a polynomial of degree $n$ with leading coefficient $c$, and $q(x)$ is a polynomial of degree $m$ with leading coefficient $c$, such that \[ p(x)^2 = \left(x^2 - 1\right)q(x)^2 + 1 \] Show that $p'(x) = nq(x)$.

At one school, $85$ percent of the students are taking mathematics courses, $55$ percent of the students are taking history courses, and $7$ percent of the students are taking neither mathematics nor history courses. Find the percent of the students who are taking both mathematics and history courses.

The different non-zero real numbers a, b, c satisfy the set equality $\{a + b, b + c, c + a\} = \{ab, bc, ca\}$. Prove that the set equality $\{a, b, c\} = \{a^2 -2, b^2 - 2, c^2 - 2\}$ also holds. . (Josef Tkadlec)

[b]p1.[/b] Nicky is studying biology and has a tank of $17$ lizards. In one day, he can either remove $5$ lizards or add $2$ lizards to his tank. What is the minimum number of days necessary for Nicky to get rid of all of the lizards from his tank? [b]p2.[/b] What is the maximum number of spheres with radius $1$ that can fit into a sphere with radius $2$? [b]p3.[/b] A positive integer $x$ is sunny if $3x$ has more digits than $x$. If all sunny numbers are written in increasing order, what is the $50$th number written? [b]p4.[/b] Quadrilateral $ABCD$ satisfies $AB = 4$, $BC = 5$, $DA = 4$, $\angle DAB = 60^o$, and $\angle ABC = 150^o$. Find the area of $ABCD$. [b]p5. [/b]Totoro wants to cut a $3$ meter long bar of mixed metals into two parts with equal monetary value. The left meter is bronze, worth $10$ zoty per meter, the middle meter is silver, worth $25$ zoty per meter, and the right meter is gold, worth $40$ zoty per meter. How far, in meters, from the left should Totoro make the cut? [b]p6.[/b] If the numbers $x_1, x_2, x_3, x_4$, and $x5$ are a permutation of the numbers $1, 2, 3, 4$, and $5$, compute the maximum possible value of $$|x_1 - x_2| + |x_2 - x_3| + |x_3 - x_4| + |x_4 - x_5|.$$ [b]p7.[/b] In a $3 \times 4$ grid of $12$ squares, find the number of paths from the top left corner to the bottom right corner that satisfy the following two properties: $\bullet$ The path passes through each square exactly once. $\bullet$ Consecutive squares share a side. Two paths are considered distinct if and only if the order in which the twelve squares are visited is different. For instance, in the diagram below, the two paths drawn are considered the same. [img]https://cdn.artofproblemsolving.com/attachments/7/a/bb3471bbde1a8f58a61d9dd69c8527cfece05a.png[/img] [b]p8.[/b] Scott, Demi, and Alex are writing a computer program that is $25$ ines long. Since they are working together on one computer, only one person may type at a time. To encourage collaboration, no person can type two lines in a row, and everyone must type something. If Scott takes $10$ seconds to type one line, Demi takes $15$ seconds, and Alex takes $20$ seconds, at least how long, in seconds, will it take them to finish the program? [b]p9.[/b] A hand of four cards of the form $(c, c, c + 1, c + 1)$ is called a tractor. Vinjai has a deck consisting of four of each of the numbers $7$, $8$, $9$ and $10$. If Vinjai shuffles and draws four cards from his deck, compute the probability that they form a tractor. [b]p10. [/b]The parabola $y = 2x^2$ is the wall of a fortress. Totoro is located at $(0, 4)$ and fires a cannonball in a straight line at the closest point on the wall. Compute the y-coordinate of the point on the wall that the cannonball hits. [b]p11. [/b]How many ways are there to color the squares of a $10$ by $10$ grid with black and white such that in each row and each column there are exactly two black squares and between the two black squares in a given row or column there are exactly [b]4[/b] white squares? Two configurations that are the same under rotations or reflections are considered different. [b]p12.[/b] In rectangle $ABCD$, points $E$ and $F$ are on sides $AB$ and $CD$, respectively, such that $AE = CF > AD$ and $\angle CED = 90^o$. Lines $AF, BF, CE$ and $DE$ enclose a rectangle whose area is $24\%$ of the area of $ABCD$. Compute $\frac{BF}{CE}$ . [b]p13.[/b] Link cuts trees in order to complete a quest. He must cut $3$ Fenwick trees, $3$ Splay trees and $3$ KD trees. If he must also cut 3 trees of the same type in a row at some point during his quest, in how many ways can he cut the trees and complete the quest? (Trees of the same type are indistinguishable.) [b]p14.[/b] Find all ordered pairs (a, b) of positive integers such that $\sqrt{64a + b^2} + 8 = 8\sqrt{a} + b$. [b]p15.[/b] Let $ABCDE$ be a convex pentagon such that $\angle ABC = \angle BCD = 108^o$, $\angle CDE = 168^o$ and $AB =BC = CD = DE$. Find the measure of $\angle AEB$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Show that any real coefficient polynomial $f(x,y)$ is a linear combination of polynomials of the form $(x+ay)^k$. ($a$ is a real number and $k$ is a non-negative integer.)

Is there any polynomial $P(x)$ with degree $n$ such that $ \underbrace{P(...(P(x))...)}_{m\,\, times \,\, P}$ has all roots from $1,2,..., mn$ ?

a) Show that there are no functions $f, g: \mathbb R \to \mathbb R$ such that $g(f(x)) = x^3$ and $f(g(x)) = x^2$ for all $x \in \mathbb R$. b) Let $S$ be the set of all real numbers greater than 1. Show that there are functions $f, g : S \to S$ satsfying the condition above.

$\boxed{A2}$ Find the maximum value of $z+x$ if $x,y,z$ are satisfying the given conditions.$x^2+y^2=4$ $z^2+t^2=9$ $xt+yz\geq 6$

Find all reals $x$ satisfying $0 \le x \le 5$ and $\lfloor x^2-2x \rfloor = \lfloor x \rfloor ^2 - 2 \lfloor x \rfloor$.

$u$ is a real parameter such that $0<u<1$. For $0\le x \le u$, $f(x)=0$. For $u\le x \le n$, $f(x)=1-\left(\sqrt{ux}+\sqrt{(1-u)(1-x)}\right)^2$. The sequence $\{u_n\}$ is define recursively as follows: $u_1=f(1)$ and $u_n=f(u_{n-1})$ $\forall n\in \mathbb{N}, n\neq 1$. Show that there exists a positive integer $k$ for which $u_k=0$.

Write down all real numbers $(x, y)$ satisfying two conditions: $x^{2018} + y^2 = 2$, and $x^2 + y^{2018} = 2$.

Let $a, b, c$ be non-negative numbers with $a+b+c = 3$. Prove the inequality \[\frac{a}{b^2+1}+\frac{b}{c^2+1}+\frac{c}{a^2+1} \geq \frac 32.\]

A real-valued function $ f$ satisfies for all reals $ x$ and $ y$ the equality \[ f (xy) \equal{} f (x)y \plus{} x f (y). \] Prove that this function satisfies for all reals $ x$ and $ y \ne 0$ the equality \[ f\left(\frac{x}{y}\right)\equal{}\frac{f (x)y \minus{} x f (y)}{y^2} \]

Let $\mathbb{Z}$ be the set of all integers. Find all pairs of integers $(a,b)$ for which there exist functions $f \colon \mathbb{Z}\rightarrow \mathbb{Z}$ and $g \colon \mathbb{Z} \rightarrow \mathbb{Z}$ satisfying \[ f(g(x))=x+a \quad\text{and}\quad g(f(x))=x+b \] for all integers $x$. [i]Proposed by Ankan Bhattacharya[/i]

Find all functions $f:R \to R$, such that $f(x)+f(y)=f(x+y)$, and there exists non-constant polynomials $P(x)$, $Q(x)$ such that $P(x)f(Q(x))=f(P(x)Q(x))$

Let $f(x)$ be a polynomial with real coefficients of degree 2. Suppose that for some pairwise distinct real numbers , $a,b,c$ we have:\\ \[f(a)=bc , f(b)=ac, f(c)=ab\] Dertermine $f(a+b+c)$ in terms of $a,b,c$.

Consider a regular $n$-gon with $n$ odd. Given two adjacent vertices $A_{1}$ and $A_{2},$ define the sequence $(A_{k})$ of vertices of the $n$-gon as follows: For $k\ge 3,\, A_{k}$ is the vertex lying on the perpendicular bisector of $A_{k-2}A_{k-1}.$ Find all $n$ for which each vertex of the $n$-gon occurs in this sequence.

Let $a, b, c$ be positive real numbers such that $a\le b \le c \le 2a$. Find the maximum possible value of $$\frac{b}{a} +\frac{c}{b} +\frac{a}{c}.$$

Let $X$ be a set of $n$ elements and $k$ be a positive integer. Consider the family $S_k$ of all $k$-tuples $(E_1,...,E_k)$ with $E_i \subseteq X$ for each $i$. Evaluate the sums $\sum_{(E_1,...,E_k) \in S_k }|E_1 \cap ... \cap E_k|$ and $\sum_{(E_1,...,E_k) \in S_k }|E_1 \cup ... \cup E_k|$

Find all positive integers $n$ and sequence of integers $a_0,a_1,\ldots, a_n$ such that the following hold: 1. $a_n\neq 0$; 2. $f(a_{i-1})=a_i$ for all $i=1,\ldots, n$, where $f(x) = a_nx^n+a_{n-1}x^{n-1}+\cdots +a_0$. [i] Proposed by usjl[/i]