[b]p1.[/b] Is it possible to put $9$ numbers $1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9$ in a circle in a way such that the sum of any three circularly consecutive numbers is divisible by $3$ and is, moreover: a) greater than $9$ ? b) greater than $15$? [b]p2.[/b] You can cut the figure below along the sides of the small squares into several (at least two) identical pieces. What is the minimal number of such equal pieces? [img]https://cdn.artofproblemsolving.com/attachments/8/e/9cd09a04209774dab34bc7f989b79573453f35.png[/img] [b]p3.[/b] There are $100$ colored marbles in a box. It is known that among any set of ten marbles there are at least two marbles of the same color. Show that the box contains $12$ marbles of the same color. [b]p4.[/b] Is it possible to color squares of a $ 8\times 8$ board in white and black color in such a way that every square has exactly one black neighbor square separated by a side? [b]p5.[/b] In a basket, there are more than $80$ but no more than $200$ white, yellow, black, and red balls. Exactly $12\%$ are yellow, $20\%$ are black. Is it possible that exactly $2/3$ of the balls are white? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose two positive real numbers are given. Prove that if their sum is less than their product then their sum is greater than four. (N Vasiliev, Moscow)

Let $ P(x)$ be a polynomial with degree 2008 and leading coefficient 1 such that \[ P(0) \equal{} 2007, P(1) \equal{} 2006, P(2) \equal{} 2005, \dots, P(2007) \equal{} 0. \]Determine the value of $ P(2008)$. You may use factorials in your answer.

For $a\in C^{*}$ find all $n\in N$ such that $X^{2}(X^{2}-aX+a^{2})^{2}$ divides $(X^{2}+a^{2})^{n}-X^{2n}-a^{2n}$

Consider a sequence of positive integers $x_n$ such that: \[(\text{A})\ x_{2n+1}=4x_n+2n+2 \] \[(\text{B})\ x_{3n+\color[rgb]{0.9529,0.0980,0.0118}2}=3x_{n+1}+6x_n \] for all $n\ge 0$. Prove that \[(\text{C})\ x_{3n-1}=x_{n+2}-2x_{n+1}+10x_n \] for all $n\ge 0$.

(a) Find all positive integers $n$ for which the equation $(a^a)^n = b^b$ has a solution in positive integers $a,b$ greater than $1$. (b) Find all positive integers $a, b$ satisfying $(a^a)^5=b^b$

The sum of all the roots of $ 4x^3\minus{}8x^2\minus{}63x\minus{}9\equal{}0$ is: $ \textbf{(A)}\ 8 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ \minus{}8 \qquad \textbf{(D)}\ \minus{}2 \qquad \textbf{(E)}\ 0$

There are some counters in some cells of $100\times 100$ board. Call a cell [i]nice[/i] if there are an even number of counters in adjacent cells. Can exactly one cell be [i]nice[/i]? [i]K. Knop[/i]

1400 real numbers are given. Prove that one can choose three of them like $x,y,z$ such that : $$\left|\frac{(x-y)(y-z)(z-x)}{x^4+y^4+z^4+1}\right| < 0.009$$

Let $m$ be a positive integer and $n=m^2+1$. Determine all real numbers $x_1,x_2,\dotsc ,x_n$ satisfying $$x_i=1+\frac{2mx_i^2}{x_1^2+x_2^2+\cdots +x_n^2}\quad \text{for all }i=1,2,\dotsc ,n.$$

Let $a, b, c, x$ be reals with $(a + b)(b + c)(c + a) \ne 0$ that satisfy $$\frac{a^2}{a + b}=\frac{a^2}{a + c}+ 20, \,\,\, \frac{b^2}{b + c}=\frac{b^2}{b + a}+ 14, \text{and}\,\,\, \frac{c^2}{c + a}=\frac{c^2}{c + b}+ x.$$ Compute $x$.

Prove that infinitely many positive integers cannot be written in the form \[{x_{1}}^{3}+{x_{2}}^{5}+{x_{3}}^{7}+{x_{4}}^{9}+{x_{5}}^{11},\] where $x_{1}, x_{2}, x_{3}, x_{4}, x_{5}\in \mathbb{N}$.

The polynomial $$ Q(x_1,x_2,\ldots,x_4)=4(x_1^2+x_2^2+x_3^2+x_4^2)-(x_1+x_2+x_3+x_4)^2 $$ is represented as the sum of squares of four polynomials of four variables with integer coefficients. [b]a)[/b] Find at least one such representation [b]b)[/b] Prove that for any such representation at least one of the four polynomials isidentically zero. [i](A. Yuran)[/i]

[b]p1.[/b] Find the largest integer which is a factor of all numbers of the form $n(n +1)(n + 2)$ where $n$ is any positive integer with unit digit $4$. Prove your claims. [b]p2.[/b] Each pair of the towns $A, B, C, D$ is joined by a single one way road. See example. Show that for any such arrangement, a salesman can plan a route starting at an appropriate town that: enables him to call on a customer in each of the towns. Note that it is not required that he return to his starting point. [img]https://cdn.artofproblemsolving.com/attachments/6/5/8c2cda79d2c1b1c859825f3df0163e65da761b.png[/img] [b]p3.[/b] $A$ and $B$ are two points on a circular race track . One runner starts at $A$ running counter clockwise, and, at the same time, a second runner starts from $B$ running clockwise. They meet first $100$ yds from A, measured along the track. They meet a second time at $B$ and the third time at $A$. Assuming constant speeds, now long is the track? [b]p4.[/b] $A$ and $B$ are points on the positive $x$ and positive $y$ axis, respectively, and $C$ is the point $(3,4)$. Prove that the perimeter of $\vartriangle ABC$ is greater than $10$. Suggestion: Reflect!! [b]p5.[/b] Let $A_1,A_2,...,A_8$ be a permutation of the integers $1,2,...,8$ so chosen that the eight sums $9 + A_1$, $10 + A_2$, $...$, $16 + A_8$ and the eight differences $9 -A_1$ , $10 - A_2$, $...$, $16 - A_8$ together comprise $16$ different numbers. Show that the same property holds for the eight numbers in reverse order. That is, show that the $16$ numbers $9 + A_8$, $10 + A_7$, $...$, $16 + A_1$ and $9 -A_8$ , $10 - A_7$, $...$, $16 - A_1$ are also pairwise different. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all functions $u:R\rightarrow{R}$ for which there exists a strictly monotonic function $f:R\rightarrow{R}$ such that $f(x+y)=f(x)u(y)+f(y)$ for all $x,y\in{\mathbb{R}}$

Let $ d$ be the sum of the lengths of all the diagonals of a plane convex polygon with $ n$ vertices (where $ n>3$). Let $ p$ be its perimeter. Prove that: \[ n\minus{}3<{2d\over p}<\Bigl[{n\over2}\Bigr]\cdot\Bigl[{n\plus{}1\over 2}\Bigr]\minus{}2,\] where $ [x]$ denotes the greatest integer not exceeding $ x$.

Prove that for any interval $[a,b]$ of real numbers and any positive integer $n$ there exists a positive integer $k$ and a partition of the given interval \[a = x (0) < x (1) < x (2) < \cdots < x (k-1) < x (k) = b\] such that \[\int_{x(0)}^{x(1)}f(x)dx+\int_{x(2)}^{x(3)}f(x)dx+\cdots=\int_{x(1)}^{x(2)}f(x)dx+\int_{x(3)}^{x(4)}f(x)dx+\cdots\] for all polynomials $f$ with real coefficients and degree less than $n$.

Find all functions $f : R \to R$ such that $f(x^2)-f(y^2) \le (f(x)+y) (x-f(y))$ for all $x, y \in R$.

Let $f: \mathbb R \to \mathbb R$ and $g: \mathbb R \to \mathbb R$ be two functions satisfying \[\forall x,y \in \mathbb R: \begin{cases} f(x+y)=f(x)f(y),\\ f(x)= x g(x)+1\end{cases} \quad \text{and} \quad \lim_{x \to 0} g(x)=1.\] Find the derivative of $f$ in an arbitrary point $x.$

Solve in positive reals the system: $x+y+z+w=4$ $\frac{1}{x}+\frac{1}{y}+\frac{1}{z}+\frac{1}{w}=5-\frac{1}{xyzw}$

Let $x=\frac{\sqrt{6+2\sqrt5}+\sqrt{6-2\sqrt5}}{\sqrt{20}}$. The value of $$H=(1+x^5-x^7)^{{2012}^{3^{11}}}$$ is (A) $1$ (B) $11$ (C) $21$ (D) $101$ (E) None of the above

Find all polynomials $P$ with integer coefficients such that $P (0)\ne 0$ and $$P^n(m)\cdot P^m(n)$$ is a square of an integer for all nonnegative integers $n, m$. [i]Remark:[/i] For a nonnegative integer $k$ and an integer $n$, $P^k(n)$ is defined as follows: $P^k(n) = n$ if $k = 0$ and $P^k(n)=P(P(^{k-1}(n))$ if $k >0$. Proposed by Adrian Beker.

Juana and Juan have to write each one an ordered list of fractions so that the two lists have the same number of fractions and that the difference between the sum of all the fractions from Juana's list and the sum of all fractions from Juan's list is greater than $123$. The fractions in Juana's list are $$\frac{1^2}{1}, \frac{2^2}{3},\frac{3^2}{5},\frac{4^2}{7},\frac{5^2}{9},...$$ And the fractions in John's list are $$\frac{1^2}{3}, \frac{2^2}{5},\frac{3^2}{7},\frac{4^2}{9},\frac{5^2}{11},...$$ Find the least amount of fractions that each one must write to achieve the objective.

Let $A$ be a set of positive integers containing the number $1$ and at least one more element. Given that for any two different elements $m, n$ of A the number $ \frac{m+1 }{(m+1,n+1) }$ is also an element of $A$, prove that $A$ coincides with the set of positive integers.

A zerg player can produce one zergling every minute and a protoss player can produce one zealot every $2.1$ minutes. Both players begin building their respective units immediately from the beginning of the game. In a ght, a zergling army overpowers a zealot army if the ratio of zerglings to zealots is more than $3$. What is the total amount of time (in minutes) during the game such that at that time the zergling army would overpower the zealot army?