This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 85335

Show that there are infinitely many pairs $(m, n)$ of natural numbers $m, n \ge 2$, for $m^m- 1$ is divisible by $n$ and $n^n- 1$ is divisible by $m$.
In an acute triangle $ABC$ the points $D,E$ and $F$ are the feet of the altitudes through $A,B$ and $C$ respectively. The incenters of the triangles $AEF$ and $BDF$ are $I_1$ and $I_2$ respectively; the circumcenters of the triangles $ACI_1$ and $BCI_2$ are $O_1$ and $O_2$ respectively. Prove that $I_1I_2$ and $O_1O_2$ are parallel.
Prove there are no such integers $ k, m $ which satisfy $ k \ge 0, m \ge 0 $ and $ k!+48=48(k+1)^m $.
Find all real solutions to the following system of equations. Carefully justify your answer. \[ \left\{ \begin{array}{c} \displaystyle\frac{4x^2}{1+4x^2} = y \\ \\ \displaystyle\frac{4y^2}{1+4y^2} = z \\ \\ \displaystyle\frac{4z^2}{1+4z^2} = x \end{array} \right. \]
Solve in the set of real numbers: \[ 3\left(x^2 \plus{} y^2 \plus{} z^2\right) \equal{} 1, \] \[ x^2y^2 \plus{} y^2z^2 \plus{} z^2x^2 \equal{} xyz\left(x \plus{} y \plus{} z\right)^3. \]
Let $\mathcal A = A_0A_1A_2A_3 \cdots A_{2013}A_{2014}$ be a [i]regular 2014-simplex[/i], meaning the $2015$ vertices of $\mathcal A$ lie in $2014$-dimensional Euclidean space and there exists a constant $c > 0$ such that $A_iA_j = c$ for any $0 \le i < j \le 2014$. Let $O = (0,0,0,\dots,0)$, $A_0 = (1,0,0,\dots,0)$, and suppose $A_iO$ has length $1$ for $i=0,1,\dots,2014$. Set $P=(20,14,20,14,\dots,20,14)$. Find the remainder when \[PA_0^2 + PA_1^2 + \dots + PA_{2014}^2 \] is divided by $10^6$. [i]Proposed by Robin Park[/i]
There are $2019$ points given in the plane. A child wants to draw $k$ (closed) discs in such a manner, that for any two distinct points there exists a disc that contains exactly one of these two points. What is the minimal $k$, such that for any initial configuration of points it is possible to draw $k$ discs with the above property?
Consider the set $X$ = $\{ 1,2 \ldots 10 \}$ . Find two disjoint nonempty sunsets $A$ and $B$ of $X$ such that a) $A \cup B = X$; b) $\prod_{x\in A}x$ is divisible by $\prod_{x\in B}x$, where $\prod_{x\in C}x$ is the product of all numbers in $C$; c) $\frac{ \prod\limits_{x\in A}x}{ \prod\limits_{x\in B}x}$ is as small as possible.
Let $ABC$ be a triangle. Let $x_1$ and $x_2$ be two congruent circles, which touch each other and the segment $BC$, and which both lie within triangle $ABC$, and for which it also holds that $x_1$ touches the segment $CA$, and that $x_2$ is the segment $AB$. Let $X$ be the contact point of these two circles $x_1$ and $x_2$. Let $y_1$ and $y_2$ two congruent circles that touch each other and the segment $CA$, and both within of triangle $ABC$, and for which it also holds that $y_1$ touches the segment $AB$, and that $y_2$ the segment $BC$. Let $Y$ be the contact point of these two circles $y_1$ and $y_2$. Let $z_1$ and $z_2$ be two congruent circles that touch each other and the segment $AB$, and both within triangle $ABC$, and for which it also holds that $z_1$ touches the segment $BC$, and that $z_2$ the segment $CA$. Let $Z$ be the contact point of these two circles $z_1$ and $z_2$. Prove that the straight lines $AX, BY$ and $CZ$ intersect at a point.
Let $ a, b, c$ be positive real numbers such that $ abc = 1. $ Prove that: $$ 2 (a^ 2 + b^ 2 + c^ 2) \left (\frac 1 {a^ 2} + \frac 1{b^ 2}+ \frac 1{c^2}\right)\geq 3(a+ b + c + ab + bc + ca).$$
Evaluate $\int^{a}_{0}{\int^{b}_{0}{e^{max(b^{2}x^{2},a^{2}y^{2})}dy dx}}$
There are $ 3n, n \in \mathbb{Z}^\plus{}$ girl students who took part in a summer camp. There were three girl students to be on duty every day. When the summer camp ended, it was found that any two of the $ 3n$ students had just one time to be on duty on the same day. (1) When $ n\equal{}3,$ is there any arrangement satisfying the requirement above. Prove yor conclusion. (2) Prove that $ n$ is an odd number.
Let $O$ be the center of a circle. Let $OU,OV$ be perpendicular radii of the circle. The chord $PQ$ passes through the midpoint $M$ of $UV$. Let $W$ be a point such that $PM = PW$, where $U, V,M,W$ are collinear. Let $R$ be a point such that $PR = MQ$, where $R$ lies on the line $PW$. Prove that $MR = UV$. [u]Alternative version:[/u] A circle $S$ is given with center $O$ and radius $r$. Let $M$ be a point whose distance from $O$ is $\frac{r}{\sqrt{2}}$. Let $PMQ$ be a chord of $S$. The point $N$ is defined by $\overrightarrow{PN} =\overrightarrow{MQ}$. Let $R$ be the reflection of $N$ by the line through $P$ that is parallel to $OM$. Prove that $MR =\sqrt{2}r$.
Let $AD$ be the bisector of angle $A$ of the triangle $ABC$. One considers the points M, N on the half-lines $(AB$ and $(AC$, respectively, such that $\angle MDA = \angle B$ and $\angle NDA = \angle C$. Let $AD \cap MN=\{P\}$. Prove that: $$AD^3 = AB \cdot AC\cdot AP$$
In triangle $ABC$ with $AB<AC$ and $AB+AC=2BC$, let $M$ be the midpoint of $\overline{BC}$. Choose point $P$ on the extension of $\overline{BA}$ past $A$ and point $Q$ on segment $\overline{AC}$ such that $M$ lies on $\overline{PQ}$. Let $X$ be on the opposite side of $\overline{AB}$ from $C$ such that $\overline{AX} \parallel \overline{BC}$ and $AX=AP=AQ$. Let $\overline{BX}$ intersect the circumcircle of $BMQ$ again at $Y \neq B$, and let $\overline{CX}$ intersect the circumcircle of $CMP$ again at $Z \neq C$. Prove that $A$, $Y$, and $Z$ are collinear. [i]Tiger Zhang[/i]
On the circumference of a circle are $21$ points. Prove that among the arcs which join any two of these points, at least $100$ of them must subtend an angle at the centre of the circle not exceeding $120^o$ . ( A . F . Sidorenko)
A triangular corner with side lengths $DB=EB=1$ is cut from equilateral triangle $ABC$ of side length $3$. The perimeter of the remaining quadrilateral is [asy] draw((0,0)--(2,0)--(2.5,.87)--(1.5,2.6)--cycle, linewidth(1)); draw((2,0)--(3,0)--(2.5,.87)); label("3", (0.75,1.3), NW); label("1", (2.5, 0), S); label("1", (2.75,.44), NE); label("A", (1.5,2.6), N); label("B", (3,0), S); label("C", (0,0), W); label("D", (2.5,.87), NE); label("E", (2,0), S);[/asy] $\text{(A)} \ 6 \qquad \text{(B)} \ 6\frac12 \qquad \text{(C)} \ 7 \qquad \text{(D)} \ 7\frac12 \qquad \text{(E)} \ 8$
Let $f(x)$ be a differentiable function defined on the interval $(0,1)$ such that $|f'(x)| \leq M$ for $0<x<1$ and a positive real number $M.$ Prove that $$\left| \int_{0}^{1} f(x)\; dx - \frac{1}{n} \sum_{k=1}^{n} f\left(\frac{k}{n} \right) \right | \leq \frac{M}{n}.$$
For all positive real numbers $a_1, a_2, \dots, a_n$, prove that $$ \frac{a_1\! +\! a_2}{2} \cdot \frac{a_2\! +\! a_3}{2} \cdot \dots \cdot \frac{a_n\! +\! a_1}{2} \leq \frac{a_1\!+\!a_2\!+\!a_3}{2 \sqrt{2}} \cdot \frac{a_2\!+\!a_3\!+\!a_4}{2 \sqrt{2}} \cdot \dots \cdot \frac{a_n\!+\!a_1\!+\!a_2}{2 \sqrt{2}}.$$
Determine all triples of positive integers $(x,y,z)$ such that $x^4+y^4 =2z^2$ and $x$ and $y$ are relatively prime.
If $f(n)=\frac{2n+1+\sqrt{n(n+1)}}{\sqrt{n+1}+\sqrt{n}}$ for all positive integers $n$, evaluate (a) $f(1)$, (b) the sum $A=f(1)+f(2)+...+f(400)$.
In a tree with $n$ vertices, for each vertex $x_i$, denote the longest paths passing through it by $l_i^1,l_i^2,...,l_i^{k_i}$. $x_i$ cuts those longest paths into two parts with $(a_i^1,b_i^1),(a_i^2,b_i^2),...,(a_i^{k_i},b_i^{k_i})$ vertices respectively. If $\max_{j=1,...,k_i} \{a_i^j\times b_i^j\}=p_i$, find the maximum and minimum values of $\sum_{i=1}^{n} p_i$. [i]Proposed by Sina Rezaei[/i]
With expressions containing the symbol $*$, the following transformations can be performed: 1) rewrite the expression in the form $x * (y * z) as ((1 * x) * y) * z$; 2) rewrite the expression in the form $x * 1$ as $x$. Conversions can only be performed with an integer expression, but not with its parts. For example, $(1 *1) * (1 *1)$ can be rewritten according to the first rule as $((1 * (1 * 1)) * 1) * 1$ (taking $x = 1 * 1$, $y = 1$ and $z = 1$), but not as $1 * (1 * 1)$ or $(1* 1) * 1$ (in the last two cases, the second rule would be applied separately to the left or right side $1 * 1$). Find all positive integers $n$ for which the expression $\underbrace{1 * (1 * (1 * (...* (1 * 1)...))}_{n units}$ it is possible to lead to a form in which there is not a single asterisk. Note. The expressions $(x * y) * $z and $x * (y * z)$ are considered different, also, in the general case, the expressions $x * y$ and $y * x$ are different.
Let $A$ be a non-empty subset of the set of all positive integers $N^*$. If any sufficient big positive integer can be expressed as the sum of $2$ elements in $A$(The two integers do not have to be different), then we call that $A$ is a divalent radical. For $x \geq 1$, let $A(x)$ be the set of all elements in $A$ that do not exceed $x$, prove that there exist a divalent radical $A$ and a constant number $C$ so that for every $x \geq 1$, there is always $\left| A(x) \right| \leq C \sqrt{x}$.
If an acute-angled triangle $ABC$ is given, construct an equilateral triangle $A'B'C'$ in space such that lines $AA',BB', CC'$ pass through a given point.