Which of the following claims are true, and which of them are false? If a fact is true you should prove it, if it isn't, find a counterexample. a) Let $a,b,c$ be real numbers such that $ a^{2013} + b^{2013} + c^{2013} = 0 $. Then $ a^{2014} + b^{2014} + c^{2014} = 0 $. b) Let $a,b,c$ be real numbers such that $ a^{2014} + b^{2014} + c^{2014} = 0 $. Then $ a^{2015} + b^{2015} + c^{2015} = 0 $. c) Let $a,b,c$ be real numbers such that $ a^{2013} + b^{2013} + c^{2013} = 0 $ and $ a^{2015} + b^{2015} + c^{2015} = 0 $. Then $ a^{2014} + b^{2014} + c^{2014} = 0 $. [i]Proposed by Matko Ljulj[/i]

A social club has $2k+1$ members, each of whom is fluent in the same $k$ languages. Any pair of members always talk to each other in only one language. Suppose that there were no three members such that they use only one language among them. Let $A$ be the number of three-member subsets such that the three distinct pairs among them use different languages. Find the maximum possible value of $A$.

On the sides of triangle $ABC$ take the points $M_1, N_1, P_1$ such that each line $MM_1, NN_1, PP_1$ divides the perimeter of $ABC$ in two equal parts ($M, N, P$ are respectively the midpoints of the sides $BC, CA, AB$). [b]I.[/b] Prove that the lines $MM_1, NN_1, PP_1$ are concurrent at a point $K$. [b]II.[/b] Prove that among the ratios $\frac{KA}{BC}, \frac{KB}{CA}, \frac{KC}{AB}$ there exist at least a ratio which is not less than $\frac{1}{\sqrt{3}}$.

The triangle $ABC$ acute with gravity center $M$ is such that $\angle AMB = 2 \angle ACB$. Prove that: [b](a)[/b] $AB^4=AC^4+BC^4-AC^2 \cdot BC^2,$ [b](b)[/b] $\angle ACB \geq 60^o$.

The incircle $\omega$ of triangle $ABC$, right angled at $C$, touches the circumcircle of its medial triangle at point $F$. Let $OE$ be the tangent to $\omega$ from the midpoint $O$ of the hypotenuse $AB$, distinct from $AB$. Prove that $CE = CF$.

Let $R$ be a set of exactly $6$ elements. A set $F$ of subsets of $R$ is called an $S$-family over $R$ if and only if it satisfies the following three conditions: (i) For no two sets $X, Y$ in $F$ is $X \subseteq Y$ ; (ii) For any three sets $X, Y,Z$ in $F$, $X \cup Y \cup Z \neq R,$ (iii) $\bigcup_{X \in F} X = R$

Let $\alpha,\beta,\gamma$ be angles of a triangle. Two of them can be expressed using an auxiliary angle $\varphi$ in a way that $$\alpha=\varphi+\frac\pi4,\quad\beta=\pi-3\varphi.$$ Show that $\alpha>\gamma.$

Show that if $n \ge 4, n \in N$ and $\big [ \frac{2^n}{n} ]$ is a power of $2$, then $n$ is a power of $2$.

What is the last digit in the number $2007^{2007}$?

Call integer number $x$ as far from squares and cubes, if for every integer $k$ it is true : $|x-k^2|>10^6,|x-k^3|>10^6$. Prove, that there are infinitely many far from squares and cubes degrees of $2$

A circle with center $O$ passes through the ends of the hypotenuse of a right-angled triangle and intersects its legs at points $M$ and $K$. Prove that the distance from point $O$ to line $MK$ is half the hypotenuse.

[b]p1.[/b] Determine the number of ways to place $4$ rooks on a $4 \times 4$ chessboard such that: (a) no two rooks attack one another, and (b) the main diagonal (the set of squares marked $X$ below) does not contain any rooks. [img]https://cdn.artofproblemsolving.com/attachments/e/e/e3aa96de6c8ed468c6ef3837e66a0bce360d36.png[/img] The rooks are indistinguishable and the board cannot be rotated. (Two rooks attack each other if they are in the same row or column.) [b]p2.[/b] Seven students, numbered $1$ to $7$ in counter-clockwise order, are seated in a circle. Fresh Mann has 100 erasers, and he wants to distribute them to the students, albeit unfairly. Starting with person $ 1$ and proceeding counter-clockwise, Fresh Mann gives $i$ erasers to student $i$; for example, he gives $ 1$ eraser to student $ 1$, then $2$ erasers to student $2$, et cetera. He continues around the circle until he does not have enough erasers to give to the next person. At this point, determine the number of erasers that Fresh Mann has. [b]p3.[/b] Let $ABC$ be a triangle with $AB = AC = 17$ and $BC = 24$. Approximate $\angle ABC$ to the nearest multiple of $10$ degrees. [b]p4.[/b] Define a sequence of rational numbers $\{x_n\}$ by $x_1 =\frac35$ and for $n \ge 1$, $x_{n+1} = 2 - \frac{1}{x_n}$ . Compute the product $x_1x_2x_3... x_{2013}$. [b]p5.[/b] In equilateral triangle $ABC$, points $P$ and $R$ lie on segment $AB$, points $I$ and $M$ lie on segment $BC$, and points $E$ and $S$ lie on segment $CA$ such that $PRIMES$ is a equiangular hexagon. Given that $AB = 11$, $PR = 2$, $IM = 3$, and $ES = 5$, compute the area of hexagon $PRIMES$. [b]p6.[/b] Let $f(a, b) = \frac{a^2}{a+b}$ . Let $A$ denote the sum of $f(i, j)$ over all pairs of integers $(i, j)$ with $1 \le i < j \le 10$; that is, $$A = (f(1, 2) + f(1, 3) + ...+ f(1, 10)) + (f(2, 3) + f(2, 4) +... + f(2, 10)) +... + f(9, 10).$$ Similarly, let $B$ denote the sum of $f(i, j)$ over all pairs of integers $(i, j)$ with $1 \le j < i \le 10$, that is, $$B = (f(2, 1) + f(3, 1) + ... + f(10, 1)) + (f(3, 2) + f(4, 2) +... + f(10, 2)) +... + f(10, 9).$$ Compute $B - A$. [b]p7.[/b] Fresh Mann has a pile of seven rocks with weights $1, 1, 2, 4, 8, 16$, and $32$ pounds and some integer X between $1$ and $64$, inclusive. He would like to choose a set of the rocks whose total weight is exactly $X$ pounds. Given that he can do so in more than one way, determine the sum of all possible values of $X$. (The two $1$-pound rocks are indistinguishable.) [b]p8.[/b] Let $ABCD$ be a convex quadrilateral with $AB = BC = CA$. Suppose that point $P$ lies inside the quadrilateral with $AP = PD = DA$ and $\angle PCD = 30^o$. Given that $CP = 2$ and $CD = 3$, compute $CA$. [b]p9.[/b] Define a sequence of rational numbers $\{x_n\}$ by $x_1 = 2$, $x_2 = \frac{13}{2}$ , and for $n \ge 1$, $x_{n+2} = 3 -\frac{3}{x_{n+1}}+\frac{1}{x_nx_{n+1}}$. Compute $x_{100}$. [b]p10.[/b] Ten prisoners are standing in a line. A prison guard wants to place a hat on each prisoner. He has two colors of hats, red and blue, and he has $10$ hats of each color. Determine the number of ways in which the prison guard can place hats such that among any set of consecutive prisoners, the number of prisoners with red hats and the number of prisoners with blue hats differ by at most $2$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all real numbers $a$ for which there exist different real numbers $b, c, d$ different from $a$ such that the four tangents drawn to the curve $y = \sin (x)$ at the points $(a, \sin (a)), (b, \sin (b)), (c, \sin (c))$ and $(d, \sin (d))$ form a rectangle.

Figures $I$, $II$, and $III$ are squares. The perimeter of $I$ is $12$ and the perimeter of $II$ is $24$. The perimeter of $III$ is [asy] draw((0,0)--(15,0)--(15,6)--(12,6)--(12,9)--(0,9)--cycle); draw((9,0)--(9,9)); draw((9,6)--(12,6)); label("$III$",(4.5,4),N); label("$II$",(12,2.5),N); label("$I$",(10.5,6.75),N); [/asy] $\text{(A)}\ 9 \qquad \text{(B)}\ 18 \qquad \text{(C)}\ 36 \qquad \text{(D)}\ 72 \qquad \text{(D)}\ 81$

Factorise $ 5^{1985}\minus{}1$ as a product of three integers, each greater than $ 5^{100}$.

Find all pairs of functions $ f : \mathbb R \to \mathbb R$, $g : \mathbb R \to \mathbb R$ such that \[f \left( x + g(y) \right) = xf(y) - y f(x) + g(x) \quad\text{for all } x, y\in\mathbb{R}.\]

Find all pairs $(x,y)$ of positive real numbers such that $xy$ is an integer and $x+y = \lfloor x^2 - y^2 \rfloor$.

Let $\{a_1,...,a_n\}\subset \{-1,1\}$ and $a>0$ . Denote by $X$ and $Y$ the number of collections $\{\varepsilon_1,...,\varepsilon_n\}\subset \{-1,1\}$, such that $$max_{1\le k\le n}(\varepsilon_1a_1+...+\varepsilon_ka_k) >\alpha$$ and $$\varepsilon_1a_1+...+\varepsilon_na_n>a$$ respectively. Prove that $X\le 2Y$.

Given $2n$ points and $3n$ lines on the plane. Prove that there is a point $P$ on the plane such that the sum of the distances of $P$ to the $3n$ lines is less than the sum of the distances of $P$ to the $2n$ points.

Let $a_1,a_2,\cdots,a_{2000}$ be distinct positive integers such that $1 \leq a_1 < a_2 < \cdots < a_{2000} < 4000$ such that the LCM (least common multiple) of any two of them is $\geq 4000$. Show that $a_1 \geq 1334$

Let $\vartriangle XY Z$ be a triangle such that $\angle X = 70^o$. There exists a point $F$ inside triangle $\vartriangle XY Z$ such that $Y F$ bisects $\angle XY Z$ and $ZF$ bisects $\angle XZY$ . What is the measure of $\angle Y FZ$?

For positive integer $x>1$, define set $S_x$ as $$S_x=\{p^\alpha|p \textup{ is one of the prime divisor of }x,\alpha \in \mathbb{N},p^\alpha|x,\alpha \equiv v_p(x)(\textup{mod} 2)\},$$ where $v_p(n)$ is the power of prime divisor $p$ in positive integer $n.$ Let $f(x)$ be the sum of all the elements of $S_x$ when $x>1,$ and $f(1)=1.$ Let $m$ be a given positive integer, and the sequence $a_1,a_2,\cdots,a_n,\cdots$ satisfy that for any positive integer $n>m,$ $a_{n+1}=\max\{ f(a_n),f(a_{n-1}+1),\cdots,f(a_{n-m}+m)\}.$ Prove that (1)there exists constant $A,B(0<A<1),$ such that when positive integer $x$ has at least two different prime divisors, $f(x)<Ax+B$ holds; (2)there exists positive integer $N,l$, such that for any positive integer $n\geq N ,a_{n+l}=a_n$ holds.

Call a positive integer [b]good[/b] if either $N=1$ or $N$ can be written as product of [i]even[/i] number of prime numbers, not necessarily distinct. Let $P(x)=(x-a)(x-b),$ where $a,b$ are positive integers. (a) Show that there exist distinct positive integers $a,b$ such that $P(1),P(2),\cdots ,P(2010)$ are all good numbers. (b) Suppose $a,b$ are such that $P(n)$ is a good number for all positive integers $n$. Prove that $a=b$.

Let $AA_0$ be the altitude of the isosceles triangle $ABC~(AB = AC)$. A circle $\gamma$ centered at the midpoint of $AA_0$ touches $AB$ and $AC$. Let $X$ be an arbitrary point of line $BC$. Prove that the tangents from $X$ to $\gamma$ cut congruent segments on lines $AB$ and $AC$

In the city built are $2019$ metro stations. Some pairs of stations are connected. tunnels, and from any station through the tunnels you can reach any other. The mayor ordered to organize several metro lines: each line should include several different stations connected in series by tunnels (several lines can pass through the same tunnel), and in each station must lie at least on one line. To save money no more than $k$ lines should be made. It turned out that the order of the mayor is not feasible. What is the largest $k$ it could to happen?