Consider the convex quadrilateral $ABCD$. The point $P$ is in the interior of $ABCD$. The following ratio equalities hold: \[\angle PAD:\angle PBA:\angle DPA=1:2:3=\angle CBP:\angle BAP:\angle BPC\] Prove that the following three lines meet in a point: the internal bisectors of angles $\angle ADP$ and $\angle PCB$ and the perpendicular bisector of segment $AB$. [i]Proposed by Dominik Burek, Poland[/i]

Bessie the cow is hungry and wants to eat some oranges, which she has an infinite supply of. Bessie starts with a fullness level of $0$, and each orange that she eats increases her fullness level by $85$. She can also eat lemons, and each time she eats a lemon, her fullness level is halved, rounding down. What is the smallest number of lemons that Bessie should have in order to be able to attain every possible nonnegative integer fullness level?

p1. A regular $6$-face dice is thrown three times. Calculate the probability that the number of dice points on all three throws is $ 12$? p2. Given two positive real numbers $x$ and $y$ with $xy = 1$. Determine the minimum value of $\frac{1}{x^4}+\frac{1}{4y^4}.$ p3. Known a square network which is continuous and arranged in forming corners as in the following picture. Determine the value of the angle marked with the letter $x$. [img]https://cdn.artofproblemsolving.com/attachments/6/3/aee36501b00c4aaeacd398f184574bd66ac899.png[/img] p4. Find the smallest natural number $n$ such that the sum of the measures of the angles of the $n$-gon, with $n > 6$ is less than $n^2$ degrees. p5. There are a few magic cards. By stating on which card a number is there, without looking at the card at all, someone can precisely guess the number. If the number is on Card $A$ and $B$, then the number in question is $1 + 2$ (sum of corner number top left) cards $A$ and $B$. If the numbers are in $A$, $B$, and $C$, the number what is meant is $1 + 2 + 4$ or equal to $7$ (which is obtained by adding the numbers in the upper left corner of each card $A$,$B$, and $C$). [img]https://cdn.artofproblemsolving.com/attachments/e/5/9e80d4f3bba36a999c819c28c417792fbeff18.png[/img] a. How can this be explained? b. Suppose we are going to make cards containing numbers from $1$ to with $15$ based on the rules above. Try making the cards. [hide=original wording for p5, as the wording isn't that clear]Ada suatu kartu ajaib. Dengan menyebutkan di kartu yang mana suatu bilan gan berada, tanpa melihat kartu sama sekali, seseorang dengan tepat bisa menebak bilangan yang dimaksud. Kalau bilangan tersebut ada pada Kartu A dan B, maka bilangan yang dimaksud adalah 1 + 2 (jumlah bilangan pojok kiri atas) kartu A dan B. Kalau bilangan tersebut ada di A, B, dan C, bilangan yang dimaksud adalah 1 + 2 + 4 atau sama dengan 7 (yang diperoleh dengan menambahkan bilangan-bilangan di pojok kiri atas masing-masing kartu A, B, dan C) a. Bagaimana hal ini bisa dijelaskan? b. Andai kita akan membuat kartu-kartu yang memuat bilangan dari 1 sampai dengan 15 berdasarkan aturan di atas. Coba buatkan kartu-kartunya[/hide]

The line joining the midpoints of two opposite sides of a convex quadrilateral makes equal angles with the diagonals. Show that the diagonals are equal.

Two triangles $ABC$ and $PQR$ have the same circumcircles. Let $E_a, E_b, E_c$ be the centers of the Euler circles of triangles $PBC, QCA, RAB$. Assume that $d_a$ is a line through $Ea$ parallel to $AP$, $d_b, d_c$ are defined in the same manner. Prove that three lines $d_a, d_b, d_c$ are concurrent. Nguyễn Tiến Lâm, Trần Quang Hùng

Let $n$ be a given positive integer. Solve the system \[x_1 + x_2^2 + x_3^3 + \cdots + x_n^n = n,\] \[x_1 + 2x_2 + 3x_3 + \cdots + nx_n = \frac{n(n+1)}{2}\] in the set of nonnegative real numbers.

A rug is made with three different colors as shown. The areas of the three differently colored regions form an arithmetic progression. The inner rectangle is one foot wide, and each of the two shaded regions is $1$ foot wide on all four sides. What is the length in feet of the inner rectangle? [asy] size(6cm); defaultpen(fontsize(9pt)); path rectangle(pair X, pair Y){ return X--(X.x,Y.y)--Y--(Y.x,X.y)--cycle; } filldraw(rectangle((0,0),(7,5)),gray(0.5)); filldraw(rectangle((1,1),(6,4)),gray(0.75)); filldraw(rectangle((2,2),(5,3)),white); label("$1$",(0.5,2.5)); draw((0.3,2.5)--(0,2.5),EndArrow(TeXHead)); draw((0.7,2.5)--(1,2.5),EndArrow(TeXHead)); label("$1$",(1.5,2.5)); draw((1.3,2.5)--(1,2.5),EndArrow(TeXHead)); draw((1.7,2.5)--(2,2.5),EndArrow(TeXHead)); label("$1$",(4.5,2.5)); draw((4.5,2.7)--(4.5,3),EndArrow(TeXHead)); draw((4.5,2.3)--(4.5,2),EndArrow(TeXHead)); label("$1$",(4.1,1.5)); draw((4.1,1.7)--(4.1,2),EndArrow(TeXHead)); draw((4.1,1.3)--(4.1,1),EndArrow(TeXHead)); label("$1$",(3.7,0.5)); draw((3.7,0.7)--(3.7,1),EndArrow(TeXHead)); draw((3.7,0.3)--(3.7,0),EndArrow(TeXHead)); [/asy] $\textbf{(A) } 1 \qquad \textbf{(B) } 2 \qquad \textbf{(C) } 4 \qquad \textbf{(D) } 6 \qquad \textbf{(E) }8$

Maryam has a fair tetrahedral die, with the four faces of the die labeled 1 through 4. At each step, she rolls the die and records which number is on the bottom face. She stops when the current number is greater than or equal to the previous number. (In particular, she takes at least two steps.) What is the expected number (average number) of steps that she takes?

We say that $M$ is the midpoint of the open polygonal $XYZ$, formed by the segments $XY, YZ$, if $M$ belongs to the polygonal and divides its length by half. Let $ABC$ be a acute triangle with orthocenter $H$. Let $A_1, B_1,C_1,A_2, B_2,C_2$ be the midpoints of the open polygonal $CAB, ABC, BCA, BHC, CHA, AHB$, respectively. Show that the lines $A_1 A_2, B_1B_2$ and $C_1C_2$ are concurrent.

Rhombus $ ABCD$ is similar to rhombus $ BFDE$. The area of rhombus $ ABCD$ is 24, and $ \angle BAD \equal{} 60^\circ$. What is the area of rhombus $ BFDE$? [asy] size(180); defaultpen(linewidth(0.7)+fontsize(11)); pair A=origin, B=(2,0), C=(3, sqrt(3)), D=(1, sqrt(3)), E=(1, 1/sqrt(3)), F=(2, 2/sqrt(3)); pair point=(3/2, sqrt(3)/2); draw(B--C--D--A--B--F--D--E--B); label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F));[/asy] $ \textbf{(A) } 6 \qquad \textbf{(B) } 4\sqrt {3} \qquad \textbf{(C) } 8 \qquad \textbf{(D) } 9 \qquad \textbf{(E) } 6\sqrt {3}$

Let $ABC$ be a triangle with incenter $I$. Points $E$ and $F$ are on segments $AC$ and $BC$ respectively such that, $AE=AI$ and $BF=BI$. If $EF$ is the perpendicular bisector of $CI$, then $\angle{ACB}$ in degrees can be written as $\frac{m}{n}$ where $m$ and $n$ are co-prime positive integers. Find the value of $m+n$.

Is it possible to put pairwise distinct positive integers less than $100$ in the cells of a $4 \times 4$ table so that the products of all the numbers in every column and every row are equal to each other? (N.B. Vasiliev, Moscow))

Let $a$ be the sum and $b$ the product of the real roots of the equation $x^4-x^3-1=0$ Prove that $b < -\frac{11}{10}$ and $a > \frac{6}{11}$.

Given positive integer $m,n$, color the points of the regular $(2m+2n)$-gon in black and white, $2m$ in black and $2n$ in white. The [i]coloring distance[/i] $d(B,C) $ of two black points $B,C$ is defined as the smaller number of white points in the two paths linking the two black points. The [i]coloring distance[/i] $d(W,X) $ of two white points $W,X$ is defined as the smaller number of black points in the two paths linking the two white points. We define the matching of black points $\mathcal{B}$ : label the $2m$ black points with $A_1,\cdots,A_m,B_1,\cdots,B_m$ satisfying no $A_iB_i$ intersects inside the gon. We define the matching of white points $\mathcal{W}$ : label the $2n$ white points with $C_1,\cdots,C_n,D_1,\cdots,D_n$ satisfying no $C_iD_i$ intersects inside the gon. We define $P(\mathcal{B})=\sum^m_{i=1}d(A_i,B_i), P(\mathcal{W} )=\sum^n_{j=1}d(C_j,D_j) $. Prove that: $\max_{\mathcal{B}}P(\mathcal{B})=\max_{\mathcal{W}}P(\mathcal{W})$

On the sides $ AB, BC, CD$ and $ DA$ of the rhombus $ ABCD$, respectively, are chosen points $ E, F, G$ and $ H$ so, that $ EF$ and $ GH$ touch the incircle of the rhombus. Prove that the lines $ EH$ and $ FG$ are parallel.

A square $ (n \minus{} 1) \times (n \minus{} 1)$ is divided into $ (n \minus{} 1)^2$ unit squares in the usual manner. Each of the $ n^2$ vertices of these squares is to be coloured red or blue. Find the number of different colourings such that each unit square has exactly two red vertices. (Two colouring schemse are regarded as different if at least one vertex is coloured differently in the two schemes.)

Let $ABC$ denote a triangle with area $S$. Let $U$ be any point inside the triangle whose vertices are the midpoints of the sides of triangle $ABC$. Let $A'$, $B'$, $C'$ denote the reflections of $A$, $B$, $C$, respectively, about the point $U$. Prove that hexagon $AC'BA'CB'$ has area $2S$.

The $ n$ roots of a complex coefficient polynomial $ f(z) \equal{} z^n \plus{} a_1z^{n \minus{} 1} \plus{} \cdots \plus{} a_{n \minus{} 1}z \plus{} a_n$ are $ z_1, z_2, \cdots, z_n$. If $ \sum_{k \equal{} 1}^n |a_k|^2 \leq 1$, then prove that $ \sum_{k \equal{} 1}^n |z_k|^2 \leq n$.

Let $N \ge 1$ be a positive integer and $k$ be an integer such that $1 \le k \le N$. Define the recurrence $x_n = \frac{x_{n-1} + x_{n-2} +... + x_{n-N}}{N}$ for $n > N$ and $x_k = 1$, $x_1 = x_2 = ... = x_{k-1} =x_{k+1} =.. = x_N = 0$. As $n$ approaches infinity, $x_n$ approaches some value. What is this value?

From the set of all permutations $f$ of $\{1, 2, ... , n\}$ that satisfy the condition: $f(i) \geq i-1$ $i=1,...,n$ one is chosen uniformly at random. Let $p_n$ be the probability that the chosen permutation $f$ satisfies $f(i) \leq i+1$ $i=1,...,n$ Find all natural numbers $n$ such that $p_n > \frac{1}{3}$.

Let \(A\) be a square matrix with entries in the field \(\mathbb Z / p \mathbb Z\) such that \(A^n - I\) is invertible for every positive integer \(n\). Prove that there exists a positive integer \(m\) such that \(A^m = 0\). [i](A matrix having entries in the field \(\mathbb Z / p \mathbb Z\) means that two matrices are considered the same if each pair of corresponding entries differ by a multiple of \(p\).)[/i] [i]Proposed by Tony Wang[/i]

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 the largest positive constant $C$ such that the following is satisfied: Given $n$ arcs (containing their endpoints) $A_1,A_2,\ldots ,A_n$ on the circumference of a circle, where among all sets of three arcs $(A_i,A_j,A_k)$ $(1\le i< j< k\le n)$, at least half of them has $A_i\cap A_j\cap A_k$ nonempty, then there exists $l>Cn$, such that we can choose $l$ arcs among $A_1,A_2,\ldots ,A_n$, whose intersection is nonempty.

Given an integer $n\ge 2$, a function $f:\mathbb{Z}\rightarrow \{1,2,\ldots,n\}$ is called [i]good[/i], if for any integer $k,1\le k\le n-1$ there exists an integer $j(k)$ such that for every integer $m$ we have \[f(m+j(k))\equiv f(m+k)-f(m) \pmod{n+1}. \] Find the number of [i]good[/i] functions.

In a circle of radius $10$, three congruent chords bound an equilateral triangle with side length $8$. The endpoints of these chords form a convex hexagon. Compute the area of this hexagon.