We are given 4 similar dices. Denote $x_i (1\le x_i \le 6)$ be the number of dots on a face appearing on the $i$-th dice $1\le i \le 4$ a) Find the numbers of $(x_1,x_2,x_3,x_4)$ b) Find the probability that there is a number $x_j$ such that $x_j$ is equal to the sum of the other 3 numbers c) Find the probability that we can divide $x_1,x_2,x_3,x_4$ into 2 groups has the same sum

In an arcade game, the "monster" is the shaded sector of a circle of radius $ 1$ cm, as shown in the figure. The missing piece (the mouth) has central angle $ 60^{\circ}$. What is the perimeter of the monster in cm? [asy]size(100); defaultpen(linewidth(0.7)); filldraw(Arc(origin,1,30,330)--dir(330)--origin--dir(30)--cycle, yellow, black); label("1", (sqrt(3)/4, 1/4), NW); label("$60^\circ$", (1,0)); [/asy] $ \textbf{(A)}\ \pi \plus{} 2 \qquad \textbf{(B)}\ 2\pi \qquad \textbf{(C)}\ \frac53 \pi \qquad \textbf{(D)}\ \frac56 \pi \plus{} 2 \qquad \textbf{(E)}\ \frac53 \pi \plus{} 2$

If $a,b \ge 0$ are real numbers, prove the inequality $$\left(\frac{\sqrt{a}+\sqrt{b}}{2}\right)^2\leq\frac{a+\sqrt[3] {a^2b}+\sqrt[3] {ab^2}+b}{4}\leq\frac{a+\sqrt{ab}+b}{3} \leq \sqrt{\left(\frac{a^{2/3}+b^{2/3}}{2}\right)^{3}}$$ For each of the inequalities, find the cases of equality.

Bob’s Rice ID number has six digits, each a number from $1$ to $9$, and any digit can be used any number of times. The ID number satifies the following property: the first two digits is a number divisible by $2$, the first three digits is a number divisible by $3$, etc. so that the ID number itself is divisible by $6$. One ID number that satisfies this condition is $123252$. How many different possibilities are there for Bob’s ID number?

Given is an acute angled triangle $ABC$ with orthocenter $H$ and circumcircle $k$. Let $\omega$ be the circle with diameter $AH$ and $P$ be the point of intersection of $\omega$ and $k$ other than $A$. Assume that $BP$ and $CP$ intersect $\omega$ for the second time at points $Q$ and $R$, respectively. If $D$ is the foot of the altitude from $A$ to $BC$ and $S$ is the point of the intersection of $\omega$ and $QD$, prove that $HR = HS$.

Let $n$ be a positive integer, which gives remainder $4$ of dividing by $8$. Numbers $1 = k_1 < k_2 < ... < k_m = n$ are all positive diivisors of $n$. Show that if $i \in \{ 1, 2, ..., m - 1 \}$ isn't divisible by $3$, then $k_{i + 1} \le 2k_{i}$.

Let $\triangle ABC$ be an acute triangle, $H$ is its orthocenter. $\overrightarrow{AH},\overrightarrow{BH},\overrightarrow{CH}$ intersect $\triangle ABC$'s circumcircle at $A',B',C'$ respectively. Find the range (minimum value and the maximum upper bound) of $$\dfrac{AH}{AA'}+\dfrac{BH}{BB'}+\dfrac{CH}{CC'}$$

Eric and Christina are playing a game with $n$ stones. They alternate taking some number of stones from the pile, with Eric going first. The number of stones Eric takes from the pile must be a power of $3$ (e.g. 1, 3, 9, 27, ...), while the number of stones Christina takes must be a power of $2$ (e.g. 1, 2, 4, 8, ...). Whoever takes the last stone wins. Find the sum of all $1\leq n \leq 100$ for which Eric has a winning strategy. [i]Proposed by Connor Gordon[/i]

Prove that the number $\left(\sqrt2+\sqrt3+\sqrt5\right)^{1997}$ can be represented as $$A\sqrt2+B\sqrt3+C\sqrt5+D\sqrt{30}$$ where $A$, $B$, $C$, $D$ are integers. Find with approximation to $10^{-10}$ the ratio $\frac{D}{A}$

Find the sum (in base $10$) of the three greatest numbers less than $1000_{10}$ that are palindromes in both base $10$ and base $5$.

Let $a,b\in\mathbb R$, $a\le b$. Assume that $f:[a,b]\to[a,b]$ satisfies $f(x)-f(y)\le|x-y|$ for every $x,y\in[a,b]$. Choose an $x_1\in[a,b]$ and define $$x_{n+1}=\frac{x_n+f(x_n)}2,\qquad n=1,2,3,\ldots.$$Show that $\{x_n\}^\infty_{n=1}$ converges to some fixed point of $f$.

Find all pairs $(m,n)$ of integers with $m > n > 7$ for which there exists a polynomial $p(x)$ with integer coefficients such that $p(7) = 77, p(m) = 0$, and $p(n) = 85$.

The product $20! \cdot 21! \cdot 22! \cdot \cdot \cdot 28!$ can be expressed in the form $m$ $\cdot$ $n^3$, where m and n are positive integers, and m is not divisible by the cube of any prime. Find m.

Determine all positive integers $n > 2$ , such that \[ \frac{1}{2} \varphi(n) \equiv 1 ( \bmod 6) \]

The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection. Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$. [i]Proposed by Warut Suksompong, Thailand[/i]

Given triangle $ABC$. $D$ lies on $BC$ such that $AD$ bisects $BAC$. Given $AB=3$, $AC=9$, and $BC=8$. Find $AD$.

Find all real numbers $k $ such that $x^2 - 2 x [x] + x - k = 0$ has at least two non-negative roots.