Prove that there are infinitely many natural numbers $n$ such that we can divide $1,2,\ldots ,3n$ into three sequences $(a_n),(b_n)$ and $(c_n)$, with $n$ terms in each, satisfying the following conditions: i) $a_1+b_1+c_1= a_2+b_2+c_2=\ldots =a_n+b_n+c_n$ and $a_1+b_1+c_1$ is divisible by $6$; ii) $a_1+a_2+\ldots +a_n= b_1+b_2+\ldots +b_n=c_1+c_2+\ldots +c_n,$ and $a_1+a_2+\ldots +a_n$ is divisible by $6$.

$a,b$ are real numbers such that: \[ a^3+b^3=8-6ab. \] Find the maximal and minimal value of $a+b$.

Prove that for all integers $ m$ and $ n$, the inequality \[ \dfrac{\phi(\gcd(2^m \plus{} 1,2^n \plus{} 1))}{\gcd(\phi(2^m \plus{} 1),\phi(2^n \plus{} 1))} \ge \dfrac{2\gcd(m,n)}{2^{\gcd(m,n)}}\] holds. [i]Nanang Susyanto, Jogjakarta [/i]

A $\text{22.0 kg}$ suitcase is dragged in a straight line at a constant speed of $\text{1.10 m/s}$ across a level airport floor by a student on the way to the 40th IPhO in Merida, Mexico. The individual pulls with a $\text{1.00} \times \text{10}^2 \text{N}$ force along a handle with makes an upward angle of $\text{30.0}$ degrees with respect to the horizontal. What is the coefficient of kinetic friction between the suitcase and the floor? (A) $\mu_\text{k} = \text{0.013}$ (B) $\mu_\text{k} = \text{0.394}$ (C) $\mu_\text{k} = \text{0.509}$ (D) $\mu_\text{k} = \text{0.866}$ (E) $\mu_\text{k} = \text{1.055}$

Alexa wrote the first $16$ numbers of a sequence: \[1, 2, 2, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 10, 10, 11, …\] Then she continued following the same pattern, until she had $2015$ numbers in total. What was the last number she wrote?

In a plane, the point $(x,y)$ has temperature $x^2+y^2-6x+4y$. Determine the coldest point of the plane and its temperature.

Determine whether or not there exist 15 integers $m_1,\ldots,m_{15}$ such that~ $$\displaystyle \sum_{k=1}^{15}\,m_k\cdot\arctan(k) = \arctan(16). \eqno(1)$$ (Proposed by Gerhard Woeginger, Eindhoven University of Technology)

Let $ P(x)$ be a polynomial such that the following inequalities are satisfied: \[ P(0) > 0;\]\[ P(1) > P(0);\]\[ P(2) > 2P(1) \minus{} P(0);\]\[ P(3) > 3P(2) \minus{} 3P(1) \plus{} P(0);\] and also for every natural number $ n,$ \[ P(n\plus{}4) > 4P(n\plus{}3) \minus{} 6P(n\plus{}2)\plus{}4P(n \plus{} 1) \minus{} P(n).\] Prove that for every positive natural number $ n,$ $ P(n)$ is positive.

The incircle of triangle $ABC$ centered at $I$ touches $CA,AB$ at points $E,F$ respectively. Let points $M,N$ of line $EF$ be such that $CM=CE$ and $BN=BF$. Lines $BM$ and $CN$ meet at point $P$. Prove that $PI$ bisects segment $MN$.

A grasshopper jumps on the plane from an integer point (point with integer coordinates) to another integer point according to the following rules: His first jump is of length $\sqrt{98}$, his second jump is of length $\sqrt{149}$, his next jump is of length $\sqrt{98}$, and so on, alternatively. What is the least possible odd number of moves in which the grasshopper could return to his starting point?

The hour and minute hands on a certain 12-hour analog clock are indistinguishable. If the hands of the clock move continuously, compute the number of times strictly between noon and midnight for which the information on the clock is not sufficient to determine the time. [i]Proposed by Lewis Chen[/i]

Given a set of integers $S$ satisfies that: for any $a,b,c\in S$ ($a,b,c$ can be the same), $ab+c\in S$\\ Find all pairs of integers $(x,y)$ such that if $x,y\in S$, then $S=\mathbb{Z}$.

On each side of triangle $ABC$, two distinct points are marked. It is known that these points are the feet of the altitudes and of the bisectors. a) Using only a ruler determine which points are the feet of the altitudes and which points are the feet of the bisectors. b) Solve p.a) drawing only three lines.

In a triangle $ABC$, $I$ is the incenter. $D$ is the reflection of $A$ to $I$. the incircle is tangent to $BC$ at point $E$. $DE$ cuts $IG$ at $P$ ($G$ is centroid). $M$ is the midpoint of $BC$. prove that a) $AP||DM$.(15 points) b) $AP=2DM$. (10 points)

The table of dimensions $n\times n$, $n\in\mathbb{N}$, is filled with numbers from $1$ to $n^2$, but the difference any two numbers on adjacent fields is at most $n$, and that for every $k = 1, 2,\dots , n^2$ set of fields whose numbers are $1, 2,\dots , k$ is connected, as well as the set of fields whose numbers are $k, k + 1,\dots , n^2$. Neighboring fields are fields with a common side, while a set of fields is considered connected if from each field to every other field of that set can be reached going only to the neighboring fields within that set. We call a pair of adjacent numbers, ie. numbers on adjacent fields, good, if their absolute difference is exactly $n$ (one number can be found in several good pairs). Prove that the table has at least $2 (n - 1)$ good pairs.

Is it possible to find $100$ positive integers not exceeding $25,000$, such that all pairwise sums of them are different?

An unfair $6$-sided die has faces labeled $1$, $2$, $3$, $4$, $5$, and $6$. The probability that a die lands with a certain face up is proportional to the number on the face. What is the probability that at least one of the first three rolls is a $1$ or a $2$?

Given a parabola $C: y^2=4px\ (p>0)$ with focus $F(p,\ 0)$. Let two lines $l_1,\ l_2$ passing through $F$ intersect orthogonaly each other, $C$ intersects with $l_1$ at two points $P_1,\ P_2$ and $C$ intersects with $l_2$ at two points $Q_1,\ Q_2$. Answer the following questions. (1) Set the equation of $l_1$ as $x=ay+p$ and let the coordinates of $P_1,\ P_2$ as $(x_1,\ y_1),\ (x_2,\ y_2)$, respectively. Express $y_1+y_2,\ y_1y_2$ in terms of $a,\ p$. (2) Show that $\frac{1}{P_1P_2}+\frac{1}{Q_1Q_2}$ is constant regardless of way of taking $l_1,\ l_2$.

In a soccer championship $2004$ teams are subscribed. Because of the extremely large number of teams the usual rules of the championship are modified as follows: a) any two teams can play against one each other at most one game; b) from any $4$ teams, $3$ of them play against one each other. How many days are necessary to make such a championship, knowing that each team can play at most one game per day?

Let $X$ be a non empty subset of $\mathbb{N} = \{1,2,\ldots \}$. Suppose that for all $x \in X$, $4x \in X$ and $\lfloor \sqrt{x} \rfloor \in X$. Prove that $X=\mathbb{N}$.

Inside the quadrilateral $ABCD$ marked a point $O$ such that $\angle OAD+ \angle OBC = \angle ODA + \angle OCB = 90^o$. Prove that the centers of the circumscribed circles around triangles $OAD$ and $OBC$ as well as the midpoints of the sides $AB$ and $CD$ lie on one circle. (Anton Trygub)

Evaluate: \[\sum^{10}_{x=2} \dfrac{2}{x(x^2-1)}\] .

Find all $\alpha>0$ and $\beta>0$ that for each $(x_1,\dots,x_n)$ and $(y_1,\dots,y_n)\in\mathbb {R^+}^n$ that:\[(\sum x_i^\alpha)(\sum y_i^\beta)\geq\sum x_iy_i\]

Three squares of area $4, 9$ and $36$ are inscribed in the triangle as shown in the figure. Find the area of the big triangle [img]https://cdn.artofproblemsolving.com/attachments/9/7/3e904a9c78307e1be169ec0b95b1d3d24c1aa2.png[/img]

Solve in real numbers the system: $$\begin{cases} a+b+c=0 \\ ab^3+bc^3+ca^3=0 \end{cases}$$