Find all functions $f : Z \to Z$ satisfying $\bullet$ $ f(p) > 0$ for all prime numbers $p$, $\bullet$ $p| (f(x) + f(p))^{f(p)}- x$ for all $x \in Z$ and all prime numbers $p$.

In the triangle $ABC$ on the sides $AB$ and $AC$, points $D$ and E are chosen, respectively. Can the segments $CD$ and $BE$ divide $ABC$ into four parts of the same area? [img]https://cdn.artofproblemsolving.com/attachments/1/c/3bbadab162b22530f1b254e744ecd068dea65e.png[/img]

A group of $100$ kids has a deck of $101$ cards numbered by $0, 1, 2,\dots, 100$. The first kid takes the deck, shuffles it, and then takes the cards one by one; when he takes a card (not the last one in the deck), he computes the average of the numbers on the cards he took up to that moment, and writes down this average on the blackboard. Thus, he writes down $100$ numbers, the first of which is the number on the first taken card. Then he passes the deck to the second kid which shuffles the deck and then performs the same procedure, and so on. This way, each of $100$ kids writes down $100$ numbers. Prove that there are two equal numbers among the $10000$ numbers on the blackboard.

The sum $\frac{1}{1}+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\frac{1}{5}+\frac{1}{6}=\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n.$

Let $n$ be a integer $1<n<2010$, where we have a polygon with $2010$ sides and $n$ coins, we have to paint the vertices of this polygon with $n$ colors and we've to put the $n$ coins in $n$ vertices of the polygon. In each second the coins will go to the neighbour vertex, going in the clockwise. Determine the values of $n$ such that is possible paint and choose the initial position of the coins where in each second the $n$ coins are in vertices of distinct colors

A line through a vertex of a non-degenerate triangle cuts it in two similar triangles with $\sqrt{3}$ as the ratio between correspondent sides. Find the angles of the given triangle.

Let $n$ be a positive integer and suppose that $\phi(n)=\frac{n}{k}$, where $k$ is the greatest perfect square such that $k \mid n$. Let $a_1,a_2,\ldots,a_n$ be $n$ positive integers such that $a_i=p_1^{a_1i} \cdot p_2^{a_2i} \cdots p_n^{a_ni}$, where $p_i$ are prime numbers and $a_{ji}$ are non-negative integers, $1 \leq i \leq n, 1 \leq j \leq n$. We know that $p_i\mid \phi(a_i)$, and if $p_i\mid \phi(a_j)$, then $p_j\mid \phi(a_i)$. Prove that there exist integers $k_1,k_2,\ldots,k_m$ with $1 \leq k_1 \leq k_2 \leq \cdots \leq k_m \leq n$ such that \[\phi(a_{k_{1}} \cdot a_{k_{2}} \cdots a_{k_{m}})=p_1 \cdot p_2 \cdots p_n.\]

Consider a regular pyramid and a perpendicular to its base at an arbitrary point $P$. Prove that the sum of the lengths of the segments connecting $P$ to the intersection points of the perpendicular with the planes of the pyramid’s faces does not depend on the location of $P$.

How many of the first one hundred positive integers are divisible by all of the numbers $2,3,4,5$? $\text{(A)}\ 0 \qquad \text{(B)}\ 1 \qquad \text{(C)}\ 2 \qquad \text{(D)}\ 3 \qquad \text{(E)}\ 4$

Let $g(x) = ax^2 + bx + c$ a quadratic function with real coefficients such that the equation $g(g(x)) = x$ has four distinct real roots. Prove that there isn't a function $f$: $R--R$ such that $f(f(x)) = g(x)$ for all $x$ real

$(USS 2)$ Prove that for $a > b^2,$ the identity ${\sqrt{a-b\sqrt{a+b\sqrt{a-b\sqrt{a+\cdots}}}}=\sqrt{a-\frac{3}{4}b^2}-\frac{1}{2}b}$

Suppose that $$-1 \le ax^2 + bx + c \le 1 \ \ for \ \ -1 \le x \le 1 , $$ where a, b, c are real numbers. Prove that $$-4 \le 2ax + b \le 4 \ \ for \ \ -1 \le x \le 1 , $$

For an odd prime number $p$, let $S$ denote the following sum taken modulo $p$: \[ S \equiv \frac{1}{1 \cdot 2} + \frac{1}{3\cdot 4} + \ldots + \frac{1}{(p-2)\cdot(p-1)} \equiv \sum_{i=1}^{\frac{p-1}{2}} \frac{1}{(2i-1) \cdot 2i} \pmod p\] Prove that $p^2 | 2^p - 2$ if and only if $S \equiv 0 \pmod p$.

Mary puts one red and one blue marble into a box. In another box she places two red marbles. She then forgets which box is which and randomly reaches into one of the boxes and takes out a red marble. What is the probability that the other marble in that box is blue?

[list=a] [*]Determine the positive integer $x$ for which $\dfrac14-\dfrac{1}{x}=\dfrac16.$ [*]Determine all pairs of positive integers $(a,b)$ for which $ab-b+a-1=4.$ [*]Determine the number of pairs of positive integers $(y,z)$ for which $\dfrac{1}{y}-\dfrac{1}{z}=\dfrac{1}{12}.$ [*]Prove that, for every prime number $p$, there are at least two pairs $(r,s)$ of positive integers for which $\dfrac{1}{r}-\dfrac{1}{s}=\dfrac{1}{p^2}.$[/list]

When Applejack begins to buck trees, she starts off with 100 energy. Every minute, she may either choose to buck $n$ trees and lose 1 energy, where $n$ is her current energy, or rest (i.e. buck 0 trees) and gain 1 energy. What is the maximum number of trees she can buck after 60 minutes have passed? [i]Anderson Wang.[/i] [hide="Clarifications"][list=1][*]The problem asks for the maximum *total* number of trees she can buck in 60 minutes, not the maximum number she can buck on the 61st minute. [*]She does not have an energy cap. In particular, her energy may go above 100 if, for instance, she chooses to rest during the first minute.[/list][/hide]

Let $n>1$ be an integer. Find all $r\in \mathbb{R}$ so that the system of equations in real variables $x_1, x_2, \dots, x_n$: \begin{align*} &(r\cdot x_1-x_2)(r\cdot x_1-x_3)\dots (r\cdot x_1-x_n)=\\ =&(r\cdot x_2-x_1)(r\cdot x_2-x_3)\dots (r\cdot x_2-x_n)=\\ &\qquad \qquad \qquad \qquad \vdots \\ =&(r\cdot x_n-x_1)(r\cdot x_n-x_2)\dots (r\cdot x_n-x_{n-1}) \end{align*} has a solution where the numbers $x_1, x_2, \dots, x_n$ are pairwise distinct.

$A_0A_1\ldots A_n$ is a regular polygon with $n+1$ vertices ($n&gt;2$). Initially $n$ stones are placed at vertex $A_0$. In each allowed operation, $2$ stones are moved simultaneously, at the player's choice: each stone is moved from the vertex where it is located to one of the adjacent $2$ vertices. Find all the values of $n$ for which it is possible to have, after a succession of permitted operations, a stone at each of the vertices $A_1,A_2,\ldots ,A_n$. Clarification: The two stones that move in an allowed operation can be at the same vertex or at different vertices.

Two equilateral triangles are glued, and their opposite vertices are connected. If the larger equilateral triangle has an area of $225$ and the smaller equilateral triangle has an area of $100$, what is the area of the shaded region? [asy] size(4cm); draw((0,0)--(3,0)--(3/2,3sqrt(3)/2)--(0,0)); draw((0,0)--(2,0)--(1,-sqrt(3))--(0,0)); draw((1,-sqrt(3))--(3/2,3sqrt(3)/2)); filldraw((0,0)--(6/5,0)--(3/2,3sqrt(3)/2)--cycle, gray); [/asy] $\textbf{(A) }60\qquad\textbf{(B) }90\qquad\textbf{(C) }96\qquad\textbf{(D) }108\qquad\textbf{(E) }120$

Consider a right circular cylinder with radius $ r$ of the base, hight $ h$. Find the volume of the solid by revolving the cylinder about a diameter of the base.

For a positive integer $k$, define the sequence $\{a_n\}_{n\ge 0}$ such that $a_0=1$ and for all positive integers $n$, $a_n$ is the smallest positive integer greater than $a_{n-1}$ for which $a_n\equiv ka_{n-1}\pmod {2017}$. What is the number of positive integers $1\le k\le 2016$ for which $a_{2016}=1+\binom{2017}{2}?$ [i]Proposed by James Lin[/i]

Given a positive integer $n$. Consider a $3 \times n$ grid, a set $S$ of squares is called [i]connected[/i] if for any points $A \neq B$ in $S$, there exists an integer $l \ge 2$ and $l$ squares $A=C_1,C_2,\dots ,C_l=B$ in $S$ such that $C_i$ and $C_{i+1}$ shares a common side ($i=1,2,\dots,l-1$). Find the largest integer $K$ satisfying that however the squares are colored black or white, there always exists a [i]connected[/i] set $S$ for which the absolute value of the difference between the number of black and white squares is at least $K$.

Prove that circles which have sides of a convex quadrilateral as diameters cover its interior. (Convex polygon is the one which contains with any two points the whole segment, joining them).

Inscribe a rectangle of base $b$ and height $h$ in a circle of radius one, and inscribe an isosceles triangle in the region of the circle cut off by one base of the rectangle (with that side as the base of the triangle). For what value of $h$ do the rectangle and triangle have the same area?

A set of $n$ points in Euclidean 3-dimensional space, no four of which are coplanar, is partitioned into two subsets $\mathcal{A}$ and $\mathcal{B}$. An $\mathcal{AB}$-tree is a configuration of $n-1$ segments, each of which has an endpoint in $\mathcal{A}$ and an endpoint in $\mathcal{B}$, and such that no segments form a closed polyline. An $\mathcal{AB}$-tree is transformed into another as follows: choose three distinct segments $A_1B_1$, $B_1A_2$, and $A_2B_2$ in the $\mathcal{AB}$-tree such that $A_1$ is in $\mathcal{A}$ and $|A_1B_1|+|A_2B_2|>|A_1B_2|+|A_2B_1|$, and remove the segment $A_1B_1$ to replace it by the segment $A_1B_2$. Given any $\mathcal{AB}$-tree, prove that every sequence of successive transformations comes to an end (no further transformation is possible) after finitely many steps.