A convex polyhedron and a point $K$ outside it are given. For each point $M$ of a polyhedron construct a ball with diameter $MK$. Prove that there exists a unique point on a polyhedron which belongs to all such balls.

We call a number [i]pal[/i] if it doesn't have a zero digit and the sum of the squares of the digits is a perfect square. For example, $122$ and $34$ are pal but $304$ and $12$ are not pal. Prove that there exists a pal number with $n$ digits, $n > 1$.

Two quarter-circles touch as shown. Find the angle $x$. [img]https://cdn.artofproblemsolving.com/attachments/b/4/e70d5d69e46d6d40368f143cb83cf10b7d6d98.png[/img]

Let $m$ and $n$ be positive integers. A people planted two kind of different trees on a plot tabular grid size $ m \times n $ (each square plant one tree.) A plant called [i]inpressive[/i] if two conditions following conditions are met simultaneously: i) The number of trees in each of kind is equal; ii) In each row the number of tree of each kind is diffrenent not less than a half of number of cells on that row and In each colum the number of tree of each kind is diffrenent not less than a half of number of cells on that colum. a) Find an inpressive plant when $m=n=2016$; b) Prove that if there at least a inpressive plant then $4|m$ and $4|n$.

Let $x,y,z$ be real numbers such that $0\le x,y,z\le\frac{\pi}{2}$. Prove the inequality \[\frac{\pi}{2}+2\sin x\cos y+2\sin y\cos z\ge\sin 2x+\sin 2y+\sin 2z.\]

Let $W,A,B$ be fixed real numbers with $W>0$. Prove that the following statements are equivalent. [list] [*] For all $x, y, z\ge 0$ satisfying $x+y\le z+W, x+z\le y+W, y+z\le x+W$ we have $Axyz+B\ge x^2+y^2+z^2$. [*] $B\ge W^2$ and $AW^3+B\ge 3W^2$. [/list] [i]Proposed by Ákos Somogyi, London[/i]

Let $ n$ and $ k$ be positive integers and let $ S$ be a set of $ n$ points in the plane such that [b]i.)[/b] no three points of $ S$ are collinear, and [b]ii.)[/b] for every point $ P$ of $ S$ there are at least $ k$ points of $ S$ equidistant from $ P.$ Prove that: \[ k < \frac {1}{2} \plus{} \sqrt {2 \cdot n} \]

Prove that $$\dfrac{1}{2+\dfrac{1}{3+\dfrac{1}{4+\dfrac{1}{...+\dfrac{1}{9991}}}}}+\dfrac{1}{1+\dfrac{1}{1+\dfrac{1}{3+\dfrac{1}{4+\dfrac{1}{...+\dfrac{1}{9991}}}}}}=1$$ This means $1/(2+ (1/(3+ (1/(4+(...+1/1991)))))) +1/(1 + (1/(1 + (1/(3 + (1/(4 + (...+ 1/1991...)))))))) = 1.)$ (G. Galperin, Moscow-Tel Aviv)

From digits $0$, $1$, $3$, $4$, $7$ and $9$ were written $5$ digit numbers which all digits are different. How many numbers from them are divisible with $5$

Let $ p\ge 2 $ be a fixed natural number, and let the sequence of functions $ \left( f_n\right)_{n\ge 2}:[0,1]\longrightarrow\mathbb{R} $ defined as $ f_n (x)=f_{n-1}\left( f_1 (x)\right) , $ where $ f_1 (x)=\sqrt[p]{1-x^p} . $ Find $ a\in (0,1) $ such that: [b]a)[/b] exists $ b\ge a $ so that $ f_1:[a,b]\longrightarrow [a,b] $ is bijective. [b]b)[/b] $ \forall x\in [0,1]\quad\exists y\in [0,1]\quad m\in\mathbb{N}\implies \left| f_m(x)-f_m(y)\right| >a|x-y| $

One company from Tesanj has last year produced profit for $112 \%$ of expected one . Determine how many percents expected profit is from produced one

In any rectangular game board with black and white squares, call a row $X$ a mix of rows $Y$ and $Z$ whenever each cell in row $X$ has the same colour as either the cell of the same column in row $Y$ or the cell of the same column in row $Z$. Let a natural number $m \ge 3$ be given. In some rectangular board, black and white squares lie in such a way that all the following conditions hold. 1) Among every three rows of the board, one is a mix of two others. 2) For every two rows of the board, their corresponding cells in at least one column have different colours. 3) For every two rows of the board, their corresponding cells in at least one column have equal colours. 4) It is impossible to add a new row with each cell either black or white to the board in a way leaving both conditions 1) and 2) still in force Find all possibilities of what can be the number of rows of the board.

Several pupils wrote a solution of a math problem on the blackboard on the break. When the teacher came in, a pupil was just clearing the blackboard, so the teacher could only observe that there was a rectangle with the sides of integer lenghts and a diagonal of lenght $ 2002$. Then the teacher pointed out that there was a computation error in pupils' solution. Why did he conclude that?

Find all positive integers $n$ with the following property: the $k$ positive divisors of $n$ have a permutation $(d_1,d_2,\ldots,d_k)$ such that for $i=1,2,\ldots,k$, the number $d_1+d_2+\cdots+d_i$ is a perfect square.

A composite natural number $n$ is called [i]happy [/i] if at most one of the numbers $2^{2^n}+ 1$ and $6^{2^n}+ 1$ is prime. Show that there are infinitely many happy numbers.

In $\triangle ABC$, angle $B$ is obtuse, $AB = 42$ and $BC = 69$. Let $M$ and $N$ be the midpoints of $AB$ and $BC$, respectively. The angle bisectors of $\angle CAB$ and $\angle ABC$ meet $BC$ and $CA$ at $D$ and $E$ respectively. Let $X$ and $Y$ be the midpoints of $AD$ and $AN$ respectively. Let $CY$ and $BX$ meet $AB$ and $CA$ at $P$ and $Q$. If $EM$ and $PQ$ meet on $BC$, find $CA$. [i]Proposed by Sid Doppalapudi[/i]

In $\triangle ABC$, let $O$, $H$, and $N$ be its circumcenter, orthocenter, and nine-point center respectively. Let $AN$ meet the circumcircle of $\triangle ABC$ at $S$. Let the tangents to the circumcircle of $ABC$ at $B$ and $C$ meet at $D$. Show that $\angle DSH = \angle DOA$.

Triangle $ABC$ is given. On its sides $AB$, $BC$ and $CA$, respectively, points $X, Y, Z$ are chosen so that $$AX : XB =BY : YC = CZ : ZA = 2:1.$$ It turned out that the triangle $XYZ$ is equilateral. Prove that the original triangle $ABC$ is also equilateral.

Positive integers $a, b, n$ are given. Assume that $a$ and $n$ are even, $b$ is odd and the number $ab(a+b)^{n-1}$ is divisible by $a^n+b^n$. Prove that there exist a prime number $p$, such that $p^{n+1}$ divides $a^n+b^n$.

[u]Round 1[/u] [b]p1.[/b] Ash is running around town catching Pokémon. Each day, he may add $3, 4$, or $5$ Pokémon to his collection, but he can never add the same number of Pokémon on two consecutive days. What is the smallest number of days it could take for him to collect exactly $100$ Pokémon? [b]p2.[/b] Jack and Jill have ten buckets. One bucket can hold up to $1$ gallon of water, another can hold up to $2$ gallons, and so on, with the largest able to hold up to $10$ gallons. The ten buckets are arranged in a line as shown below. Jack and Jill can pour some amount of water into each bucket, but no bucket can have less water than the one to its left. Is it possible that together, the ten buckets can hold 36 gallons of water? [img]https://cdn.artofproblemsolving.com/attachments/f/8/0b6524bebe8fe859fe7b1bc887ac786106fc17.png[/img] [b]p3.[/b] There are $2023$ knights and liars standing in a row. Knights always tell the truth and liars always lie. Each of them says, “the number of liars to the left of me is greater than the number of knights to the right.” How many liars are there? [b]p4.[/b] Camila has a deck of $101$ cards numbered $1, 2, ..., 101$. She starts with $50$ random cards in her hand and the rest on a table with the numbers visible. In an exchange, she replaces all $50$ cards in her hand with her choice of $50$ of the $51$ cards from the table. Show that Camila can make at most 50 exchanges and end up with cards $1, 2, ..., 50$. [img]https://cdn.artofproblemsolving.com/attachments/0/6/c89e65118764f3b593da45264bfd0d89e95067.png[/img] [b]p5.[/b] There are $101$ pirates on a pirate ship: the captain and $100$ crew. Each pirate, including the captain, starts with $1$ gold coin. The captain makes proposals for redistributing the coins, and the crew vote on these proposals. The captain does not vote. For every proposal, each crew member greedily votes “yes” if he gains coins as a result of the proposal, “no” if he loses coins, and passes otherwise. If strictly more crew members vote “yes” than “no,” the proposal takes effect. The captain can make any number of proposals, one after the other. What is the largest number of coins the captain can accumulate? [u]Round 2[/u] [b]p6.[/b] The town of Lumenville has $100$ houses and is preparing for the math festival. The Tesla wiring company will lay lengths of power wire in straight lines between the houses so that power flows between any two houses, possibly by passing through other houses. The Edison lighting company will hang strings of lights in straight lines between pairs of houses so that each house is connected by a string to exactly one other. Show that however the houses are arranged, the Edison company can always hang their strings of lights so that the total length of the strings is no more than the total length of the power wires the Tesla company used. [img]https://cdn.artofproblemsolving.com/attachments/9/2/763de9f4138b4dc552247e9316175036c649b6.png[/img] [b]p7.[/b] You are given a sequence of $16$ digits. Is it always possible to select one or more digits in a row, so that multiplying them results in a square number? [img]https://cdn.artofproblemsolving.com/attachments/d/1/f4fcda2e1e6d4a1f3a56cd1a04029dffcd3529.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

When a rectangle frames a parabola such that a side of the rectangle is parallel to the parabola's axis of symmetry, the parabola divides the rectangle into regions whose areas are in the ratio $2$ to $1$. How many integer values of $k$ are there such that $0<k\leq 2007$ and the area between the parabola $y=k-x^2$ and the $x$-axis is an integer? [asy] import graph; size(300); defaultpen(linewidth(0.8)+fontsize(10)); real k=1.5; real endp=sqrt(k); real f(real x) { return k-x^2; } path parabola=graph(f,-endp,endp)--cycle; filldraw(parabola, lightgray); draw((endp,0)--(endp,k)--(-endp,k)--(-endp,0)); label("Region I", (0,2*k/5)); label("Box II", (51/64*endp,13/16*k)); label("area(I) = $\frac23$\,area(II)",(5/3*endp,k/2)); [/asy]

Let $ABC$ be a triangle and $L$ its circumscribed circle. The internal bisector of angle $A$ meets $BC$ at point $P$. Let $L_1$ be the circle tangent to $AP,BP$ and $L$. Similarly, let $L_2$ be the circle tangent to $AP,CP$ and $L$. Prove that the tangency points of $L_1$ and $L_2$ with $AP$ coincide.

George has two coins, one of which is fair and the other of which always comes up heads. Jacob takes one of them at random and flips it twice. Given that it came up heads both times, what is the probability that it is the coin that always comes up heads?

Let $D$ be the midpoint of the side $BC$ of a triangle $ABC$. Let $M$ be a point on the side $BC$ such that $\angle BAM = \angle DAC$. Further, let $L$ be the second intersection point of the circumcircle of the triangle $CAM$ with the side $AB$, and let $K$ be the second intersection point of the circumcircle of the triangle $BAM$ with the side $AC$. Prove that $KL \parallel BC$.

Find all $(a, b, c, d)\in \mathbb{R}$ satisfying \[\begin{aligned} \begin{cases} a+b+c+d=0,\\ a^2+b^2+c^2+d^2=12,\\ abcd=-3.\\ \end{cases} \end{aligned}\]