Given pairwise different real numbers $a,b,c,d,e$ such that $$ \left\{ \begin{array}{ll} ab + b = ac + a, \\ bc + c = bd + b, \\ cd + d = ce + c, \\ de + e = da + d. \end{array} \right. $$ Prove that $abcde=1$.

Let $ x$, $ y$, $ z \in\mathbb{R}^+$ satisfying $ xyz = 1$. Prove that \[ \frac {(x + y - 1)^2}{z} + \frac {(y + z - 1)^2}{x} + \frac {(z + x - 1)^2}{y}\geqslant x + y + z\mbox{.}\]

Nüx has three moira daughters, whose ages are three distinct prime numbers, and the sum of their squares is also a prime number. What is the age of the youngest moira?

Assume that $P(x)$ is a polynomial with integer non negative coefficients, different from constant. Baron Munchausen claims that he can restore $P(x)$ provided he knows the values of $P(2)$ and $P(P(2))$ only. Is the baron's claim valid?

Solve the following system for real $x,y,z$ \[ \{ \begin{array}{ccc} x+ y -z & =& 4 \\ x^2 - y^2 + z^2 & = & -4 \\ xyz & =& 6. \end{array} \]

Find the greatest integer less than $$\sqrt{10}+ \sqrt{80}.$$

Let $\mathbb{R}^{+}$ be the set of positive real numbers. Determine all non-negative real number $\alpha$ such that there exist a function $f:\mathbb{R}^{+} \rightarrow \mathbb{R}^{+}$ such that $$f(x^{\alpha}+y)=(f(x+y))^{\alpha}+f(y)$$ for any $x,y$ positive real numbers.

$a_1,a_2,\cdots,a_n$ are positive real numbers, $a_1+a_2+\cdots,a_n=1$. Prove that $$\sum_{m=1}^n\frac{a_m}{\prod\limits_{k=1}^m(1+a_k)}\leq1-\frac{1}{2^n}.$$

Given any set $S$ of positive integers, show that at least one of the following two assertions holds: (1) There exist distinct finite subsets $F$ and $G$ of $S$ such that $\sum_{x\in F}1/x=\sum_{x\in G}1/x$; (2) There exists a positive rational number $r<1$ such that $\sum_{x\in F}1/x\neq r$ for all finite subsets $F$ of $S$.

Solve the system of equations $$\begin{cases} \sin \frac{\pi}{2}xy =z \\ \sin \frac{\pi}{2}yz =x \\ \sin \frac{\pi}{2}zx =y \end{cases} \,\,\, ?$$

Find all angles a for which the set of numbers $\sin a$, $\sin 2a$, $\sin 3a$ coincides with the set $cos a$, $cos 2a$, $cos 3a$.

Let $F$ be the set of all polynomials $\Gamma$ such that all the coefficients of $\Gamma (x)$ are integers and $\Gamma (x) = 1$ has integer roots. Given a positive intger $k$, find the smallest integer $m(k) > 1$ such that there exist $\Gamma \in F$ for which $\Gamma (x) = m(k)$ has exactly $k$ distinct integer roots.

(a) Find all prime numbers $p$ such that $4p^2+1$ and $6p^2+1$ are also primes. (b)Find real numbers $x,y,z,u$ such that \[xyz+xy+yz+zx+x+y+z=7\]\[yzu+yz+zu+uy+y+z+u=10\]\[zux+zu+ux+xz+z+u+x=10\]\[uxy+ux+xy+yu+u+x+y=10\]

[b](i)[/b] Solve the equation: \[ \sin^3(x) + \sin^3\left( \frac{2 \pi}{3} + x\right) + \sin^3\left( \frac{4 \pi}{3} + x\right) + \frac{3}{4} \cos {2x} = 0.\] [b](ii)[/b] Supposing the solutions are in the form of arcs $AB$ with one end at the point $A$, the beginning of the arcs of the trigonometric circle, and $P$ a regular polygon inscribed in the circle with one vertex in $A$, find: 1) The subsets of arcs having the other end in $B$ in one of the vertices of the regular dodecagon. 2) Prove that no solution can have the end $B$ in one of the vertices of polygon $P$ whose number of sides is prime or having factors other than 2 or 3.

Suppose that the positive numbers $a_1, a_2,.. , a_n$ form an arithmetic progression; hence $a_{k+1}- a_k = d,$ for $k = 1, 2,... , n - 1.$ Prove that \[\frac{1}{a_1a_2}+\frac{1}{a_2a_3}+...+\frac{1}{a_{n-1}a_n}=\frac{n-1}{a_1a_n}.\]

Ted's favorite number is equal to \[1\cdot\binom{2007}1+2\cdot\binom{2007}2+3\cdot\binom{2007}3+\cdots+2007\cdot\binom{2007}{2007}.\] Find the remainder when Ted's favorite number is divided by $25$. $\begin{array}{@{\hspace{-1em}}l@{\hspace{14em}}l@{\hspace{14em}}l} \textbf{(A) }0&\textbf{(B) }1&\textbf{(C) }2\\\\ \textbf{(D) }3&\textbf{(E) }4&\textbf{(F) }5\\\\ \textbf{(G) }6&\textbf{(H) }7&\textbf{(I) }8\\\\ \textbf{(J) }9&\textbf{(K) }10&\textbf{(L) }11\\\\ \textbf{(M) }12&\textbf{(N) }13&\textbf{(O) }14\\\\ \textbf{(P) }15&\textbf{(Q) }16&\textbf{(R) }17\\\\ \textbf{(S) }18&\textbf{(T) }19&\textbf{(U) }20\\\\ \textbf{(V) }21&\textbf{(W) }22 & \textbf{(X) }23\\\\ \textbf{(Y) }24 \end{array}$

Solve the equation, where $x$ and $y$ are positive integers: $$ x^3-y^3=999$$

For a real number $a$, $[a]$ denotes the largest integer not exceeding $a$. Find all positive real numbers $x$ satisfying the equation $$x\cdot [x]+2022=[x^2]$$

[hide=Intro]The answers to each of the ten questions in this section are integers containing only the digits $ 1$ through $ 8$, inclusive. Each answer can be written into the grid on the answer sheet, starting from the cell with the problem number, and continuing across or down until the entire answer has been written. Answers may cross dark lines. If the answers are correctly filled in, it will be uniquely possible to write an integer from $ 1$ to $ 8$ in every cell of the grid, so that each number will appear exactly once in every row, every column, and every marked $2$ by $4$ box. You will get $7$ points for every correctly filled answer, and a $15$ point bonus for filling in every gridcell. It will help to work back and forth between the grid and the problems, although every problem is uniquely solvable on its own. Please write clearly within the boxes. No points will be given for a cell without a number, with multiple numbers, or with illegible handwriting.[/hide] [img]https://cdn.artofproblemsolving.com/attachments/9/b/f4db097a9e3c2602b8608be64f06498bd9d58c.png[/img] [b]1 ACROSS:[/b] Jack puts $ 10$ red marbles, $ 8$ green marbles and 4 blue marbles in a bag. If he takes out $11$ marbles, what is the expected number of green marbles taken out? [b]2 DOWN:[/b] What is the closest integer to $6\sqrt{35}$ ? [b]3 ACROSS: [/b]Alan writes the numbers $ 1$ to $64$ in binary on a piece of paper without leading zeroes. How many more times will he have written the digit $ 1$ than the digit $0$? [b]4 ACROSS:[/b] Integers a and b are chosen such that $-50 < a, b \le 50$. How many ordered pairs $(a, b)$ satisfy the below equation? $$(a + b + 2)(a + 2b + 1) = b$$ [b]5 DOWN: [/b]Zach writes the numbers $ 1$ through $64$ in binary on a piece of paper without leading zeroes. How many times will he have written the two-digit sequence “$10$”? [b]6 ACROSS:[/b] If you are in a car that travels at $60$ miles per hour, $\$1$ is worth $121$ yen, there are $8$ pints in a gallon, your car gets $10$ miles per gallon, a cup of coffee is worth $\$2$, there are 2 cups in a pint, a gallon of gas costs $\$1.50$, 1 mile is about $1.6$ kilometers, and you are going to a coffee shop 32 kilometers away for a gallon of coffee, how much, in yen, will it cost? [b]7 DOWN:[/b] Clive randomly orders the letters of “MIXING THE LETTERS, MAN”. If $\frac{p}{m^nq}$ is the probability that he gets “LMT IS AN EXTREME THING” where p and q are odd integers, and $m$ is a prime number, then what is $m + n$? [b]8 ACROSS:[/b] Joe is playing darts. A dartboard has scores of $10, 7$, and $4$ on it. If Joe can throw $12$ darts, how many possible scores can he end up with? [b]9 ACROSS:[/b] What is the maximum number of bounded regions that $6$ overlapping ellipses can cut the plane into? [b]10 DOWN:[/b] Let $ABC$ be an equilateral triangle, such that $A$ and $B$ both lie on a unit circle with center $O$. What is the maximum distance between $O$ and $C$? Write your answer be in the form $\frac{a\sqrt{b}}{c}$ where $b$ is not divisible by the square of any prime, and $a$ and $c$ share no common factor. What is $abc$ ? PS. You had better use hide for answers.

Let $\mathbb{Z}$ denote the set of integers and $S \subset \mathbb{Z} $ be the set of integers that are at least $10^{100}$. Fix a positive integer $c$. Determine all functions $f: S \rightarrow \mathbb{Z} $ satisfying $f(xy+c)=f(x)+f(y)$, for all $x,y \in S$

Let $a, b, c$ be positive reals such that their sum is $1$. Prove that \[\frac{1}{ab+2c^{2}+2c}+\frac{1}{bc+2a^{2}+2a}+\frac{1}{ac+2b^{2}+2b}\geq \frac{1}{ab+bc+ac}.\]

Given the set of numbers $ \{1, 2, 3, \ldots, 100\} $. From this set, create 10 pairwise disjoint subsets $ N_i = \{a_{i,1}, a_{i,2}, ... a_{i,10} $ ($ i = 1, 2, \ldots, 10 $ ) so that the sum of the products $$ \sum_{i=10}^{10}\prod_{j=1}^{10} a_{i,j} $$ was the biggest.

Let $ a_1\geq \cdots \geq a_n \geq a_{n \plus{} 1} \equal{} 0$ be real numbers. Show that \[ \sqrt {\sum_{k \equal{} 1}^n a_k} \leq \sum_{k \equal{} 1}^n \sqrt k (\sqrt {a_k} \minus{} \sqrt {a_{k \plus{} 1}}). \] [i]Proposed by Romania[/i]

A polynomial $p(x) = \sum_{j=1}^{2n-1} a_j x^j$ with real coefficients is called [i]mountainous[/i] if $n \ge 2$ and there exists a real number such that the polynomial's coefficients satisfy $a_1=1, a_{j+1}-a_j=k$ for $1 \le j \le n-1,$ and $a_{j+1}-a_j=-k$ for $n \le j \le 2n-2;$ we call $k$ the [i]step size[/i] of $p(x).$ A real number $k$ is called [i]good[/i] if there exists a mountainous polynomial $p(x)$ with step size $k$ such that $p(-3)=0.$ Let $S$ be the sum of all good numbers $k$ satisfying $k \ge 5$ or $k \le 3.$ If $S=\tfrac{b}{c}$ for relatively prime positive integers $b,c,$ find $b+c.$

Let $A$ denote the set of real numbers $x$ such that $0\le x<1$. A function $f:A\to \mathbb{R}$ has the properties: (i) $f(x)=2f(\frac{x}{2})$ for all $x\in A$; (ii) $f(x)=1-f(x-\frac{1}{2})$ if $\frac{1}{2}\le x<1$. Prove that (a) $f(x)+f(1-x)\ge \frac{2}{3}$ if $x$ is rational and $0<x<1$. (b) There are infinitely many odd positive integers $q$ such that equality holds in (a) when $x=\frac{1}{q}$.