Found problems: 85335
2002 District Olympiad, 2
Solve in $ \mathbb{C}^3 $ the following chain of equalities:
$$ x(x-y)(x-z)=y(y-x)(y-z)=z(z-x)(z-y)=3. $$
2011 Today's Calculation Of Integral, 692
Evaluate $\int_0^{\frac{\pi}{12}} \frac{\tan ^ 2 x-3}{3\tan ^ 2 x-1}dx$.
created by kunny
1995 Poland - First Round, 7
Nonnegative numbers $a, b, c, p, q, r$ satisfy the conditions:
$a + b + c = p + q + r = 1; ~~~~~~ p, q, r \leq \frac{1}{2}$.
Prove that $8abc \leq pa + qb + rc$ and determine when equality holds.
2020 Thailand TST, 4
Let $u_1, u_2, \dots, u_{2019}$ be real numbers satisfying \[u_{1}+u_{2}+\cdots+u_{2019}=0 \quad \text { and } \quad u_{1}^{2}+u_{2}^{2}+\cdots+u_{2019}^{2}=1.\] Let $a=\min \left(u_{1}, u_{2}, \ldots, u_{2019}\right)$ and $b=\max \left(u_{1}, u_{2}, \ldots, u_{2019}\right)$. Prove that
\[
a b \leqslant-\frac{1}{2019}.
\]
2023 Assara - South Russian Girl's MO, 1
A survey of participants was conducted at the Olympiad. $50\%$ of the participants liked the first round, $60\%$ of the participants liked the second round, $70\%$ of the participants liked the opening of the Olympiad. It is known that each participant liked either one option or all three. Determine the percentage of participants who rated all three events positively.
2005 Vietnam National Olympiad, 1
Let $x,y$ be real numbers satisfying the condition:
\[x-3\sqrt {x+1}=3\sqrt{y+2} -y\]
Find the greatest value and the smallest value of:
\[P=x+y\]
2019 Tournament Of Towns, 1
The King gives the following task to his two wizards. The First Wizard should choose $7$ distinct positive integers with total sum $100$ and secretly submit them to the King. To the Second Wizard he should tell only the fourth largest number. The Second Wizard must figure out all the chosen numbers. Can the wizards succeed for sure? The wizards cannot discuss their strategy beforehand.
(Mikhail Evdokimov)
2012 Iran MO (3rd Round), 2
Suppose $N\in \mathbb N$ is not a perfect square, hence we know that the continued fraction of $\sqrt{N}$ is of the form $\sqrt{N}=[a_0,\overline{a_1,a_2,...,a_n}]$. If $a_1\neq 1$ prove that $a_i\le 2a_0$.
2014 Iran MO (3rd Round), 3
Distinct points $B,B',C,C'$ lie on an arbitrary line $\ell$. $A$ is a point not lying on $\ell$. A line passing through $B$ and parallel to $AB'$ intersects with $AC$ in $E$ and a line passing through $C$ and parallel to $AC'$ intersects with $AB$ in $F$. Let $X$ be the intersection point of the circumcircles of $\triangle{ABC}$ and $\triangle{AB'C'}$($A \neq X$). Prove that $EF \parallel AX$.
2010 HMNT, 6
When flipped, a coin has a probability $p$ of landing heads. When flipped twice, it is twice as likely to land on the same side both times as it is to land on each side once. What is the larger possible value of $p$?
Kvant 2022, M2697
There are some gas stations on a circular highway. The total amount of gasoline in them is enough for two laps. Two drivers want to refuel at one station and starting from it, go in different directions, both of them completing an entire lap. Along the way, they can refuel at other stations, without necessarily taking all the gasoline. Prove that drivers will always be able to do this.
[i]Proposed by I. Bogdanov[/i]
2020 Thailand TSTST, 5
Let $P$ be an interior point of a circle $\Gamma$ centered at $O$ where $P \ne O$. Let $A$ and $B$ be distinct points on $\Gamma$. Lines $AP$ and $BP$ meet $\Gamma$ again at $C$ and $D$, respectively. Let $S$ be any interior point on line segment $PC$. The circumcircle of $\vartriangle ABS$ intersects line segment $PD$ at $T$. The line through $S$ perpendicular to $AC$ intersects $\Gamma$ at $U$ and $V$ . The line through $T$ perpendicular to $BD$ intersects $\Gamma$ at $X$ and $Y$ . Let $M$ and $N$ be the midpoints of $UV$ and $XY$ , respectively. Let $AM$ and $BN$ meet at $Q$. Suppose that $AB$ is not parallel to $CD$. Show that $P, Q$, and $O$ are collinear if and only if $S$ is the midpoint of $PC$.
2022 Rioplatense Mathematical Olympiad, 6
In a board, the positive integer $N$ is written. In each round, Olive can realize any one of the following operations:
I - Switch the current number by a positive multiple of the current number.
II - Switch the current number by a number with the same digits of the current number, but the digits are written in another order(leading zeros are allowed). For instance, if the current number is $2022$, Olive can write any of the following numbers $222,2202,2220$.
Determine all the positive integers $N$, such that, Olive can write the number $1$ after a finite quantity of rounds.
2002 Romania National Olympiad, 4
The right prism $[A_1A_2A_3\ldots A_nA_1'A_2'A_3'\ldots A_n'],n\in\mathbb{N},n\ge 3$, has a convex polygon as its base. It is known that $A_1A_2'\perp A_2A_3',A_2A_3'\perp A_3A_4',$$\ldots A_{n-1}A_n'\perp A_nA_1', A_nA_1'\perp A_1A_2'$. Show that:
$a)$ $n=3$;
$b)$ the prism is regular.
2008 Germany Team Selection Test, 2
Let $ ABC$ be a fixed triangle, and let $ A_1$, $ B_1$, $ C_1$ be the midpoints of sides $ BC$, $ CA$, $ AB$, respectively. Let $ P$ be a variable point on the circumcircle. Let lines $ PA_1$, $ PB_1$, $ PC_1$ meet the circumcircle again at $ A'$, $ B'$, $ C'$, respectively. Assume that the points $ A$, $ B$, $ C$, $ A'$, $ B'$, $ C'$ are distinct, and lines $ AA'$, $ BB'$, $ CC'$ form a triangle. Prove that the area of this triangle does not depend on $ P$.
[i]Author: Christopher Bradley, United Kingdom [/i]
1995 AMC 12/AHSME, 22
A pentagon is formed by cutting a triangular corner from a rectangular piece of paper. The five sides of the pentagon have lengths $13,19,20,25$ and $31$, although this is not necessarily their order around the pentagon. The area of the pentagon is
$\textbf{(A)}\ 459 \qquad
\textbf{(B)}\ 600 \qquad
\textbf{(C)}\ 680 \qquad
\textbf{(D)}\ 720\qquad
\textbf{(E)}\ 745$
2017 Princeton University Math Competition, A7
The sum
\[ \sum_{k=0}^{\infty} \frac{2^{k}}{5^{2^{k}}+1}\]
can be written in the form $\frac{p}{q}$ where $p$ and $q$ are relatively prime positive integers. Find $p+q$.
2008 Korean National Olympiad, 3
Points $A,B,C,D,E$ lie in a counterclockwise order on a circle $O$, and $AC = CE$
$P=BD \cap AC$, $Q=BD \cap CE$
Let $O_1$ be the circle which is tangent to $\overline {AP}, \overline {BP}$ and arc $AB$ (which doesn't contain $C$)
Let $O_2$ be the circle which is tangent $\overline {DQ}, \overline {EQ}$ and arc $DE$ (which doesn't contain $C$)
Let $O_1 \cap O = R, O_2 \cap O = S, RP \cap QS = X$
Prove that $XC$ bisects $\angle ACE$
1990 AMC 12/AHSME, 16
At one of George Washington's parties, each man shook hands with everyone except his spouse, and no handshakes took place between women. If $13$ married couples attended, how many handshakes were there among these $26$ people?
$\text{(A)} \ 78 \qquad \text{(B)} \ 185 \qquad \text{(C)} \ 234 \qquad \text{(D)} \ 312 \qquad \text{(E)} \ 325$
1935 Moscow Mathematical Olympiad, 007
Find four consecutive terms $a, b, c, d$ of an arithmetic progression and four consecutive terms $a_1, b_1, c_1, d_1$ of a geometric progression such that $$\begin{cases}a + a_1 = 27 \\\ b + b_1 = 27 \\ c + c_1 = 39 \\ d + d_1 = 87\end{cases}$$.
2010 Indonesia TST, 2
Find maximal numbers of planes, such there are $6$ points and
1) $4$ or more points lies on every plane.
2) No one line passes through $4$ points.
2021 Romanian Master of Mathematics Shortlist, C2
Fix a positive integer $n$ and a finite graph with at least one edge; the endpoints of each
edge are distinct, and any two vertices are joined by at most one edge. Vertices and edges are
assigned (not necessarily distinct) numbers in the range from $0$ to $n-1$, one number each. A
vertex assignment and an edge assignment are [i]compatible[/i] if the following condition is satisfied
at each vertex $v$: The number assigned to $v$ is congruent modulo $n$ to the sum of the numbers
assigned to the edges incident to $v$. Fix a vertex assignment and let $N$ be the total number
of compatible edge assignments; compatibility refers, of course, to the fixed vertex assignment.
Prove that, if $N \neq 0$, then the prime divisors of $N$ are all at most $n$.
2014 Benelux, 2
Let $k\ge 1$ be a positive integer.
We consider $4k$ chips, $2k$ of which are red and $2k$ of which are blue. A sequence of those $4k$ chips can be transformed into another sequence by a so-called move, consisting of interchanging a number (possibly one) of consecutive red chips with an
equal number of consecutive blue chips. For example, we can move from $r\underline{bb}br\underline{rr}b$ to $r\underline{rr}br\underline{bb}b$ where $r$ denotes a red chip and $b$ denotes a blue chip.
Determine the smallest number $n$ (as a function of $k$) such that starting from any initial sequence of the $4k$ chips, we need at most $n$ moves to reach the state in which the first $2k$ chips are red.
2018 Canadian Open Math Challenge, A3
Source: 2018 Canadian Open Math Challenge Part A Problem 3
-----
Points $(0,0)$ and $(3\sqrt7,7\sqrt3)$ are the endpoints of a diameter of circle $\Gamma.$ Determine the other $x$ intercept of $\Gamma.$
1989 China Team Selection Test, 1
Let $\mathbb{N} = \{1,2, \ldots\}.$ Does there exists a function $f: \mathbb{N} \mapsto \mathbb{N}$ such that $\forall n \in \mathbb{N},$ $f^{1989}(n) = 2 \cdot n$ ?