Let $ABC$ be an acute triangle, $H$ its orthocentre, $D$ a point on the side $[BC]$, and $P$ a point such that $ADPH$ is a parallelogram. Show that $\angle BPC > \angle BAC$.

Hi everybody! I've an interesting problem! Can you solve it? Prove [b]Erdös-Ginzburg-Ziv Theorem[/b]: [i]"Among any $2n-1$ integers, there are some $n$ whose sum is divisible by $n$."[/i]

It is given triangle $ABC$ and points $P$ and $Q$ on sides $AB$ and $AC$, respectively, such that $PQ\mid\mid BC$. Let $X$ and $Y$ be intersection points of lines $BQ$ and $CP$ with circumcircle $k$ of triangle $APQ$, and $D$ and $E$ intersection points of lines $AX$ and $AY$ with side $BC$. If $2\cdot DE=BC$, prove that circle $k$ contains intersection point of angle bisector of $\angle BAC$ with $BC$

A roll of tape is $4$ inches in diameter and is wrapped around a ring that is $2$ inches in diameter. A cross section of the tape is shown in the figure below. The tape is $0.015$ inches thick. If the tape is completely unrolled, approximately how long would it be? Round your answer to the nearest $100$ inches. [asy] /* AMC8 P22 2024, revised by Teacher David */ size(120); pair o = (0,0); real r1 = 1; real r2 = 2; filldraw(circle(o, r2), mediumgray, linewidth(1pt)); filldraw(circle(o, r1), white, linewidth(1pt)); draw((-2,-2.6)--(-2,-2.4)); draw((2,-2.6)--(2,-2.4)); draw((-2,-2.5)--(2,-2.5), L=Label("4 in.")); draw((-1,0)--(1,0), L=Label("2 in.", align=(0,1)), arrow=Arrows()); draw((2,0)--(2,-1.3), linewidth(1pt)); [/asy] $\textbf{(A) } 300\qquad\textbf{(B) } 600\qquad\textbf{(C) } 1200\qquad\textbf{(D) } 1500\qquad\textbf{(E) } 1800$

If $A$ and $B$ are vertices of a polyhedron, define the [i]distance[/i] $d(A, B)$ to be the minimum number of edges of the polyhedron one must traverse in order to connect $A$ and $B$. For example, if $\overline{AB}$ is an edge of the polyhedron, then $d(A, B) = 1$, but if $\overline{AC}$ and $\overline{CB}$ are edges and $\overline{AB}$ is not an edge, then $d(A, B) = 2$. Let $Q$, $R$, and $S$ be randomly chosen distinct vertices of a regular icosahedron (regular polyhedron made up of 20 equilateral triangles). What is the probability that $d(Q, R) > d(R, S)$? $\textbf{(A)}~\frac{7}{22}\qquad\textbf{(B)}~\frac13\qquad\textbf{(C)}~\frac38\qquad\textbf{(D)}~\frac5{12}\qquad\textbf{(E)}~\frac12$

Let $ABC$ be an acute scalene triangle with incenter $I$, circumcircle $w_1$, and denote the circumcircle of $BIC$ as $w_2$. Suppose point $P$ lies on $w_2$ and is inside $w_1$. Let $X,Y$ lie on $BC$ with $XP \perp BP, YP \perp PC$. Circles $O_1, O_2$ are drawn tangent to $w_1$ at points on the same side of $BC$ as $A$ and tangent to $BC$ at $X,Y$ respectively. Let the centers of those two circles be $Z_1, Z_2$. Let $D$ be the point on $w_2$ opposite to $P$ and let $E$ be the foot of the altitude from $P$ to $BC$. Show that $DE \perp Z_1Z_2$

Let be three positive real numbers $ a,b,c, $ a natural number $ n, $ and the functions $ f:\mathbb{R}\longrightarrow\mathbb{R} ,g:(0,\infty )\longrightarrow\mathbb{R} $ defined as: $$ f(x)=\frac{2(n+1)x^n(x^{n+1}-a) +nx^{n+1} +2a^2x+a}{x^{2n+2}-2ax^{n+1} +a^2x^2+a^2} , $$ $$ g(x)=\frac{a+bx^n}{x+cx^{2n+1}} $$ Calculate the antiderivatives of $ f $ and $ g. $ [i]Nicolae Sanda[/i]

Let $a$, $b$ and $c$ are integers such that $\frac{a}{b}+\frac{b}{c}+\frac{c}{a}=3$. Prove that $abc$ is a perfect cube of an integer.

In triangle $ABC$, circle $\omega$ with center $O$ passes through $B$ and $C$ and it intersects segments $\overline{AB}$ and $\overline{AC}$ again at $B^{\prime}$ and $C^{\prime}$, respectively. Suppose the circles with diameters $\overline{BB^{\prime}}$ and $\overline{CC^{\prime}}$ are externally tangent to each other at $T$ with $AB=18$, $AC=36$, and $AT=12$. Find $AO$.

A square of side $N=n^2+1$, $n\in \mathbb{N}^*$, is partitioned in unit squares (of side $1$), along $N$ rows and $N$ columns. The $N^2$ unit squares are colored using $N$ colors, $N$ squares with each color. Prove that for any coloring there exists a row or a column containing unit squares of at least $n+1$ colors.

The expression \[ \pm \Box \pm \Box \pm \Box \pm \Box \pm \Box \pm \Box \] is written on the blackboard. Two players, $ A $ and $ B $, play a game, taking turns. Player $ A $ takes the first turn. In each turn, the player on turn replaces a symbol $ \Box $ by a positive integer. After all the symbols $\Box$ are replace, player $A$ replaces each of the signs $\pm$ by either + or -, independently of each other. Player $ A $ wins if the value of the expression on the blackboard is not divisible by any of the numbers $ 11, 12, \cdots, 18 $. Otherwise, player $ B$ wins. Determine which player has a winning strategy.

Let $ \Omega$ be the circumcircle of triangle $ ABC$. Let $ D$ be the point at which the incircle of $ ABC$ touches its side $ BC$. Let $ M$ be the point on $ \Omega$ such that the line $ AM$ is parallel to $ BC$. Also, let $ P$ be the point at which the circle tangent to the segments $ AB$ and $ AC$ and to the circle $ \Omega$ touches $ \Omega$. Prove that the points $ P$, $ D$, $ M$ are collinear.

$32$ teams, ranked $1$ through $32$, enter a basketball tournament that works as follows: the teams are randomly paired and in each pair, the team that loses is out of the competition. The remaining $16$ teams are randomly paired, and so on, until there is a winner. A higher ranked team always wins against a lower-ranked team. If the probability that the team ranked $3$ (the third-best team) is one of the last four teams remaining can be written in simplest form as $\dfrac{m}{n}$, compute $m+n$.

Let $n$ be a positive integer. We start with $n$ piles of pebbles, each initially containing a single pebble. One can perform moves of the following form: choose two piles, take an equal number of pebbles from each pile and form a new pile out of these pebbles. Find (in terms of $n$) the smallest number of nonempty piles that one can obtain by performing a finite sequence of moves of this form.

Find all pairs of integer numbers $m$ and $n>2$ such that $((n-1)!-n)(n-2)!=m(m-2)$. [i]A. Kuznetsov[/i]

Let $n$ be a nonzero natural number and $f:\mathbb R\to\mathbb R\setminus\{0\}$ be a function such that $f(2014)=1-f(2013)$. Let $x_1,x_2,x_3,\ldots,x_n$ be real numbers not equal to each other. If $$\begin{vmatrix}1+f(x_1)&f(x_2)&f(x_3)&\cdots&f(x_n)\\f(x_1)&1+f(x_2)&f(x_3)&\cdots&f(x_n)\\f(x_1)&f(x_2)&1+f(x_3)&\cdots&f(x_n)\\\vdots&\vdots&\vdots&\ddots&\vdots\\f(x_1)&f(x_2)&f(x_3)&\cdots&1+f(x_n)\end{vmatrix}=0,$$prove that $f$ is not continuous.

Denote $T$ the Toricelli point of the triangle $ABC$. Prove that $$AB^2 \times BC^2 \times CA^2 \geq 3(TA^2\times TB + TB^2 \times TC + TC^2 \times TA)(TA\times TB^2 + TB \times TC^2 + TC \times TA^2)$$

An elevator in a 100 floor building has only two buttons. The UP button makes the elevator go $13$ floors up, and the DOWN button makes the elevator go $8$ floors down. Is it possible to go from the $13^{\text{th}}$ floor to $8^{\text{th}}$ floor?

Suppose in a given collection of $2016$ integer, the sum of any $1008$ integers is positive. Show that sum of all $2016$ integers is positive.

Given a rhombus $ABCD$, find the locus of the points $P$ lying inside the rhombus and satisfying $\angle APD+\angle BPC=180^{\circ}$.

$C$ is the unit circle in some plane. $R$ is a square with side $a$. $C$ is fixed and $R$ moves(without rotation) on the plane, in such a way that its center stays inside $C$(including boundaries). Find the maximum value of the area drawn by the trace of $R$.

For what real values of $ K$ does $ x \equal{} K^2 (x\minus{}1)(x\minus{}2)$ have real roots? $ \textbf{(A)}\ \text{none} \qquad \textbf{(B)}\ \minus{}2<K<1 \qquad \textbf{(C)}\ \minus{}2 \sqrt{2} < K < 2 \sqrt{2} \qquad \textbf{(D)}\ K>1 \text{ or } K<\minus{}2 \qquad \textbf{(E)}\ \text{all}$

A $1 \times 5n$ rectangle is partitioned into tiles, each of the tile being either a separate $1 \times 1$ square or a broken domino consisting of two such squares separated by four squares (not belonging to the domino). Prove that the number of such partitions is a perfect fifth power. [i](K. Kokhas)[/i]

In one side of a hall there are $2N$ rooms numbered from 1 to $2N$. In each room $i$ between 1 and $N$ there are $p_i$ beds. Is needed to move every one of this beds to the roms from $N+ 1$ to $2N$, in such a way that for every $j$ between $N+1$ and $2N$ the room $j$ will have $p_j$ beds. Supose that each bed can be move once and the price of moving a bed from room $i$ to room $j$ is $(i-j)^2$. Find a way to move every bed such that the total cost is minimize. Note: The numbers $p_i$ are given and satisfy that $p_1 + p_2 + \cdots + p_N = p_{N+1} + p_{N+2} + \cdots+ p_{2N}.$

Prove that any real solution of $x^3+px+q=0$, where $p,q$ are real numbers, satisfies the inequality $4qx\le p^2$.