Inside parallelogram $ABCD$ is point $P$, such that $PC = BC$. Show that line $BP$ is perpendicular to line which connects middles of sides of line segments $AP$ and $CD$.

Find the largest real $ T$ such that for each non-negative real numbers $ a,b,c,d,e$ such that $ a\plus{}b\equal{}c\plus{}d\plus{}e$: \[ \sqrt{a^{2}\plus{}b^{2}\plus{}c^{2}\plus{}d^{2}\plus{}e^{2}}\geq T(\sqrt a\plus{}\sqrt b\plus{}\sqrt c\plus{}\sqrt d\plus{}\sqrt e)^{2}\]

Each of the thieves in the $n$-member party ($n \ge 3$) charged a certain number of coins. All the coins were $100n$. Thieves decided to share their prey as follows: at each step, one of the bandits puts one coin to the other two. Find them all natural numbers $n \ge 3$ for which after a finite number of steps each outlaw can have $100$ coins no matter how many coins each thug has charged.

Determine the value of $ \lim_{n\rightarrow\infty}\sum_{k \equal{} 0}^n\binom{n}{k}^{ \minus{} 1}$.

Let $ABC$ be a right-angled triangle with $\angle A = 90^{\circ}$ and $\angle B = 30^{\circ}$. The perpendicular at the midpoint $M$ of $BC$ meets the bisector $BK$ of the angle $B$ at the point $E$. The perpendicular bisector of $EK$ meets $AB$ at $D$. Prove that $KD$ is perpendicular to $DE$. [i]Proposed by Greece[/i]

Magic Mark performs a magic trick using a standard $52$-card deck except the suits are erased from cards (so that there are $4$ identical cards of each rank). He randomly takes $13$ cards and uses those to perform his trick. He lets you randomly pick a card from those $13$, memorize it, and put it back in the pile of $13$ cards. He then shuffles the $13$ and takes out a card randomly. If he picks a card identical to yours, the trick is successful. What is probability that the trick is successful? [i]2017 CCA Math Bonanza Individual Round #9[/i]

Find the area of the figure bounded by two curves $y=x^4,\ y=x^2+2$.

Triangles $ ABC$ and $ A_1B_1C_1$ have the same area. Using compass and ruler, can we always construct triangle $ A_2B_2C_2$ equal to triangle $ A_1B_1C_1$ so that the lines $ AA_2$, $ BB_2$, and $ CC_2$ are parallel?

Does existes a function $f:N->N$ and for all positeve integer n $f(f(n)+2011)=f(n)+f(f(n))$

Find continuous functions $ f(x),\ g(x)$ which takes positive value for any real number $ x$, satisfying $ g(x)\equal{}\int_0^x f(t)\ dt$ and $ \{f(x)\}^2\minus{}\{g(x)\}^2\equal{}1$.

Let $K$ and $M$ be points on the side $AB$ of a triangle $\triangle{ABC}$, and let $L$ and $N$ be points on the side $AC$. The point $K$ is between $M$ and $B$, and the point $L$ is between $N$ and $C$. If $\frac{BK}{KM}=\frac{CL}{LN}$, then prove that the orthocentres of the triangles $\triangle{ABC}$, $\triangle{AKL}$ and $\triangle{AMN}$ lie on one line.

Find all polynomials $P(x)$ with real coefficients such that for all real $x$ holds the equality $$(1 + 2x)P(2x) = (1 + 2^{1999}x)P(x) .$$

Prove that if for angles $A,B,C$ of a triangle holds $$\sin^2 A+\sin^2 B +\sin^2 C=2$$ iff the triangle $ABC$ is right.

Find all polynomials $P$ with real coefficients satisfying $P(x^2)=P(x)\cdot P(x+2)$ for all real numbers $x.$

What necessary and sufficient condition should the coefficients $ a $, $ b $, $ c $, $ d $ satisfy so that the equation $$ax^3 + bx^2 + cx + d = 0$$ has two opposite roots?

Find all function $f: \mathbb{R}^+ \rightarrow \mathbb{R}$,such that the inequality $$f(x) + f\left(\frac{y}{x}\right) \leqslant \frac{x^3}{y^2} + \frac{y}{x^3}$$ holds for all positive reals $x,y$ and for every positive real $x$, there exist positive reals $y$, such that the equality holds.

Consider the regular $1987$-gon $A_1A_2 . . . A_{1987}$ with center $O$. Show that the sum of vectors belonging to any proper subset of $M = \{OA_j | j = 1, 2, . . . , 1987\}$ is nonzero.

Given five fixed points in the space. It is known that these points are centers of five spheres, four of which are pairwise externally tangent, and all these point are internally tangent to the fifth one. It turns out that it is impossible to determine which of the marked points is the center of the largest sphere. Find the ratio of the greatest and the smallest radii of the spheres.

Let there be a sequence $a_n$ such that $a_1 = 2,a_2 = 0, a_3 = 1, a_4 = 0$, and for $n \ge 1, a_{n+4}$ is the remainder when $a_n + 2a_{n+1} + 3a_{n+2} + 4a_{n+3}$ is divided by $9$. Prove that there are no positive integer $k$ such that $$a_k = 0, a_{k+1} = 1, a_{k+2} = 0,a_{k+3} = 2.$$

Your team receives up to $100$ points total for the team round. To play this minigame for up to $10$ bonus points, you must decide how to construct an optimal army with number of soldiers equal to the points you receive. Construct an army of $100$ soldiers with $5$ flanks; thus your army is the union of battalions $B_1$, $B_2$, $B_3$, $B_4$, and $B_5$. You choose the size of each battalion such that $|B_1|+|B_2|+|B_3|+|B_4|+|B_5|=100$. The size of each batallion must be integral and non-negative. Then, suppose you receive $n$ points for the Team Round. We will then "supply" your army as follows: if $n>B_1$, we fill in battalion $1$ so that it has $|B_1|$ soldiers; then repeat for the next battalion with $n-|B_1|$ soldiers. If at some point there are not enough soldiers to fill the battalion, the remainder will be put in that battalion and subsequent battalions will be empty. (Ex: suppose you tell us to form battalions of size $\{20,30,20,20,10\}$, and your team scores $73$ points. Then your battalions will actually be $\{20,30,20,3,0\}$.) Your team's army will then "fight" another's. The $B_i$ of both teams will be compared with the other $B_i$, and the winner of the overall war is the army who wins the majority of the battalion fights. The winner receives $1$ victory point, and in case of ties, both teams receive $\tfrac12$ victory points. Every team's army will fight everyone else's and the team war score will be the sum of the victory points won from wars. The teams with ranking $x$ where $7k\leq x\leq 7(k+1)$ will earn $10-k$ bonus points. For example: Team Princeton decides to allocate its army into battalions with size $|B_1|$, $|B_2|$, $|B_3|$, $|B_4|$, $|B_5|$ $=$ $20$, $20$, $20$, $20$, $20$. Team MIT allocates its army into battalions with size $|B_1|$, $|B_2|$, $|B_3|$, $|B_4|$, $|B_5|$ $=$ $10$, $10$, $10$, $10$, $60$. Now suppose Princeton scores $80$ points on the Team Round, and MIT scores $90$ points. Then after supplying, the armies will actually look like $\{20, 20, 20, 20, 0\}$ for Princeton and $\{10, 10, 10, 10, 50\}$ for MIT. Then note that in a war, Princeton beats MIT in the first four battalion battles while MIT only wins the last battalion battle; therefore Princeton wins the war, and Princeton would win $1$ victory point.

With a roller shear, rectangular sheets of $1420$ mm wide should be made, namely with a width of $500$ mm and a total length of $1000$ m as well as a width of $300$ mm and a total length of $1800$ m can be cut. So far it has been based on the attached drawing cut, in which the gray area represents the waste, which is quite large. A socialist brigade proposes cutting in such a way that waste is significantly reduced becomes. a) What percentage is the waste if cutting continues as before? b) How does the brigade have to cut so that the waste is as small as possible and what is the total length of the starting sheets is required in this case? c) What percentage is the waste now? [img]https://cdn.artofproblemsolving.com/attachments/f/8/c6c88b79abb5d34674bf54524ae1731985c3f7.png[/img]

Ana plays a game on a $100\times 100$ chessboard. Initially, there is a white pawn on each square of the bottom row and a black pawn on each square of the top row, and no other pawns anywhere else.\\ Each white pawn moves toward the top row and each black pawn moves toward the bottom row in one of the following ways: [list] [*] it moves to the square directly in front of it if there is no other pawn on it; [*] it [b]captures[/b] a pawn on one of the diagonally adjacent squares in the row immediately in front of it if there is a pawn of the opposite color on it. [/list] (We say a pawn $P$ [b]captures[/b] a pawn $Q$ of the opposite color if we remove $Q$ from the board and move $P$ to the square that $Q$ was previously on.)\\ \\ Ana can move any pawn (not necessarily alternating between black and white) according to those rules. What is the smallest number of pawns that can remain on the board after no more moves can be made? [i]Proposed by José Alejandro Reyes González, Mexico[/i]

Points $ M,N$ are taken on sides $ BC,CD$ respectively of parallelogram $ ABCD$. Let $ E\equal{}BD\cap AM, F\equal{}BD\cap AN$. Diagonal $ BD$ cuts triangle $ AMN$ into two parts. Prove that these two parts have equal area if and only if the point $ K$ given by $ EK\parallel{}AD, FK\parallel{}AB$ lies on segment $ MN$.

Square pyramid $ABCDE$ has base $ABCD,$ which measures $3$ cm on a side, and altitude $\overline{AE}$ perpendicular to the base$,$ which measures $6$ cm. Point $P$ lies on $\overline{BE},$ one third of the way from $B$ to $E;$ point $Q$ lies on $\overline{DE},$ one third of the way from $D$ to $E;$ and point $R$ lies on $\overline{CE},$ two thirds of the way from $C$ to $E.$ What is the area, in square centimeters, of $\triangle PQR?$ $\textbf{(A) } \frac{3\sqrt2}{2} \qquad\textbf{(B) } \frac{3\sqrt3}{2} \qquad\textbf{(C) } 2\sqrt2 \qquad\textbf{(D) } 2\sqrt3 \qquad\textbf{(E) } 3\sqrt2$

Let $ABC$ be a triangle with $\angle C=90^\circ$. A line joining the midpoint of its altitude $CH$ and the vertex $A$ meets $CB$ at point $K$. Let $L$ be the midpoint of $BC$ ,and $T$ be a point of segment $AB$ such that $\angle ATK=\angle LTB$. It is known that $BC=1$. Find the perimeter of triangle $KTL$.