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

2009 Hong Kong TST, 3

Let $ ABCDE$ be an arbitrary convex pentagon. Suppose that $ BD\cap CE \equal{} A'$, $ CE\cap DA \equal{} B'$, $ DA\cap EB \equal{} C'$, $ EB\cap AC \equal{} D'$ and $ AC\cap BD \equal{} E'$. Suppose also that $ eABD'\cap eAC'E \equal{} A''$, $ eBCE'\cap eBD'A \equal{} B''$, $ eCDA'\cap eCE'B \equal{} C''$, $ eDEB'\cap eDA'C \equal{} D''$, $ eEAC'\cap eEB'D \equal{} E''$. Prove that $ AA'', BB'', CC'', DD'', EE''$ are concurrent. (Here $ l_1\cap l_2 \equal{} P$ means that $ P$ is the intersection of lines $ l_1$ and $ l_2$. Also $ eA_1A_2A_3\cap eB_1B_2B_3 \equal{} Q$ means that $ Q$ is the intersection of the circumcircles of $ \Delta A_1A_2A_3$ and $ \Delta B_1B_2B_3$.)

2023 Harvard-MIT Mathematics Tournament, 22

Tags: guts
Let $a_0, a_1, a_2, \ldots$ be an infinite sequence where each term is independently and uniformly at random in the set $\{1, 2, 3, 4\}.$ Define an infinite sequence $b_0, b_1, b_2, \ldots$ recursively by $b_0=1$ and $b_{i+1}=a_i^{b_i}.$ Compute the expected value of the smallest positive integer $k$ such that $b_k \equiv 1 \pmod{5}.$

2010 Contests, 2

Tags: geometry
Given a triangle $ABC$, let $D$ be the point where the incircle of the triangle $ABC$ touches the side $BC$. A circle through the vertices $B$ and $C$ is tangent to the incircle of triangle $ABC$ at the point $E$. Show that the line $DE$ passes through the excentre of triangle $ABC$ corresponding to vertex $A$.

Kyiv City MO Juniors 2003+ geometry, 2014.851

On the side $AB$ of the triangle $ABC$ mark the point $K$. The segment $CK$ intersects the median $AM$ at the point $F$. It is known that $AK = AF$. Find the ratio $MF: BK$.

Novosibirsk Oral Geo Oly IX, 2017.5

Point $K$ is marked on the diagonal $AC$ in rectangle $ABCD$ so that $CK = BC$. On the side $BC$, point $M$ is marked so that $KM = CM$. Prove that $AK + BM = CM$.

2013 Hanoi Open Mathematics Competitions, 13

Solve the system of equations $\begin{cases} xy=1 \\ \frac{x}{x^4+y^2}+\frac{y}{x^2+y^4}=1\end{cases}$

2023 JBMO Shortlist, A3

Tags: inequality
Prove that for all non-negative real numbers $x,y,z$, not all equal to $0$, the following inequality holds $\displaystyle \dfrac{2x^2-x+y+z}{x+y^2+z^2}+\dfrac{2y^2+x-y+z}{x^2+y+z^2}+\dfrac{2z^2+x+y-z}{x^2+y^2+z}\geq 3.$ Determine all the triples $(x,y,z)$ for which the equality holds. [i]Milan Mitreski, Serbia[/i]

1969 Spain Mathematical Olympiad, 2

Find the locus of the affix $M$, of the complex number $z$, so that it is aligned with the affixes of $i$ and $iz$ .

2006 Taiwan TST Round 1, 1

Find the largest integer that is a factor of $(a-b)(b-c)(c-d)(d-a)(a-c)(b-d)$ for all integers $a,b,c,d$.

2004 Brazil Team Selection Test, Problem 4

Let $b$ be a number greater than $5$. For each positive integer $n$, consider the number $$x_n=\underbrace{11\ldots1}_{n-1}\underbrace{22\ldots2}_n5,$$ written in base $b$. Prove that the following condition holds if and only if $b=10$: There exists a positive integer $M$ such that for every integer $n$ greater than $M$, the number $x_n$ is a perfect square.

2001 Estonia Team Selection Test, 6

Let $C_1$ and $C_2$ be the incircle and the circumcircle of the triangle $ABC$, respectively. Prove that, for any point $A'$ on $C_2$, there exist points $B'$ and $C'$ such that $C_1$ and $C_2$ are the incircle and the circumcircle of triangle $A'B'C'$, respectively.

2014 District Olympiad, 1

[list=a] [*]Give an example of matrices $A$ and $B$ from $\mathcal{M}_{2}(\mathbb{R})$, such that $ A^{2}+B^{2}=\left( \begin{array} [c]{cc} 2 & 3\\ 3 & 2 \end{array} \right) . $ [*]Let $A$ and $B$ be matrices from $\mathcal{M}_{2}(\mathbb{R})$, such that $\displaystyle A^{2}+B^{2}=\left( \begin{array} [c]{cc} 2 & 3\\ 3 & 2 \end{array} \right) $. Prove that $AB\neq BA$.[/list]

Kyiv City MO Seniors 2003+ geometry, 2015.10.5

Circles ${{w} _ {1}}$ and ${{w} _ {2}}$ with centers at points ${{O} _ {1}}$ and ${{ O} _ {2}}$ intersect at points $A$ and $B$, respectively. Around the triangle ${{O} _ {1}} {{O} _ {2}} B$ circumscribe a circle $w$ centered at the point $O$, which intersects the circles ${{w } _ {1}}$ and ${{w} _ {2}}$ for the second time at points $K$ and $L$, respectively. The line $OA$ intersects the circles ${{w} _ {1}}$ and ${{w} _ {2}}$ at the points $M$ and $N$, respectively. The lines $MK$ and $NL$ intersect at the point $P$. Prove that the point $P$ lies on the circle $w$ and $PM = PN$. (Vadym Mitrofanov)

2003 Brazil National Olympiad, 2

Let $S$ be a set with $n$ elements. Take a positive integer $k$. Let $A_1, A_2, \ldots, A_k$ be any distinct subsets of $S$. For each $i$ take $B_i = A_i$ or $B_i = S - A_i$. Find the smallest $k$ such that we can always choose $B_i$ so that $\bigcup_{i=1}^k B_i = S$, no matter what the subsets $A_i$ are.

2014 Rioplatense Mathematical Olympiad, Level 3, 3

Kiko and Ñoño play with a rod of length $2n$ where $n \le 3$ is an integer. Kiko cuts the rod in $ k \le 2n$ pieces of integer lengths. Then Ñoño has to arrange these pieces so that they form a hexagon of equal opposite sides and equal angles. The pieces can not be split and they all have to be used. If Ñoño achieves his goal, he wins, in any other case, Kiko wins. Determine which victory can be secured based on $k$.

2019 Thailand TST, 3

Determine all polynomials $P (x, y), Q(x, y)$ and $R(x, y)$ with real coefficients satisfying $$P (ux + vy, uy + vx) = Q(x, y)R(u, v)$$ for all real numbers $u, v, x$ and $y$.

2022 Durer Math Competition Finals, 7

The [i]fragments [/i] of a positive integer are the numbers seen when reading one or more of its digits in order. The [i]fragment sum[/i] equals the sum of all the fragments, including the number itself. For example, the fragment sum of $2022$ is $2022+202+022+20+02+22+2+0+2+2 = 2296$. There is another four-digit number with the same fragment sum. What is it? As the example shows, if a fragment occurs multiple times, then all its occurrences are added, and the fragments beginning with $0$ also count (for instance, $022$ is worth $22$).

2022 Belarusian National Olympiad, 8.8

Tags: algebra
Vitya and Masha are playing a game. At first, Vitya thinks of three different integers. In one move Masha can ask one of the following three numbers: the sum of the numbers, the product of the numbers or the sum of pairwise products of the numbers. Masha asks questions and Vitya immediately answers before Masha asks the next question. a) Prove that Masha can always guess Vitya's numbers. b) What is the least amount of questions Masha needs to ask to guaranteely guess them?

2020 Malaysia IMONST 1, 8

Given a rectangle $ABCD$ with a point $P$ inside it. It is known that $PA = 17, PB = 15,$ and $PC = 6.$ What is the length of $PD$?

2025 China Team Selection Test, 6

Fix an odd prime number $p$. Find the largest positive integer $n$ such that there exist points $A_1,A_2,\cdots,A_n$ in the plane with integral coordinates, no three points are collinear. Moreover, for any $1\le i<j<k\le n$, $p \nmid 2S_{\Delta A_iA_j A_k}.$

2008 HMNT, 9

Tags:
Find the product of all real $x$ for which \[ 2^{3x+1} - 17 \cdot 2^{2x} + 2^{x+3} = 0. \]

2009 Today's Calculation Of Integral, 440

For $ a>1$, find $ \lim_{n\to\infty} \int_0^a \frac{e^x}{1\plus{}x^n}dx.$

2016 Rioplatense Mathematical Olympiad, Level 3, 5

Initially one have the number $0$ in each cell of the table $29 \times 29$. A [i]moviment[/i] is when one choose a sub-table $5 \times 5$ and add $+1$ for every cell of this sub-table. Find the maximum value of $n$, where after $1000$ [i]moviments[/i], there are $4$ cells such that your centers are vertices of a square and the sum of this $4$ cells is at least $n$. [b]Note:[/b] A square does not, necessarily, have your sides parallel with the sides of the table.

2013 AIME Problems, 6

Find the least positive integer $N$ such that the set of $1000$ consecutive integers beginning with $1000 \cdot N$ contains no square of an integer.

Kvant 2022, M2723

It is known that among several banknotes of pairwise distinct face values (which are positive integers) there are exactly $N{}$ fakes. In a single test, a detector determines the sum of the face values of all real banknotes in an arbitrary set we have selected. Prove that by using the detector $N{}$ times, all fake banknotes can be identified, if a) $N=2$ and b) $N=3$. [i]Proposed by S. Tokarev[/i]