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

1987 Tournament Of Towns, (160) 4

From point $M$ in triangle $ABC$ perpendiculars are dropped to each altitude. It can be shown that each of the line segments of altitudes, measured between the vertex and the foot of the perpendicular drawn to it, are of equal length. Prove that these lengths are each equal to the diameter of the circle inscribed in the triangle.

2019 CCA Math Bonanza, I14

Tags:
Call an odd prime $p$ [i]adjective[/i] if there exists an infinite sequence $a_0,a_1,a_2,\ldots$ of positive integers such that \[a_0\equiv1+\frac{1}{a_1}\equiv1+\frac{1}{1+\frac{1}{a_2}}\equiv1+\frac{1}{1+\frac{1}{1+\frac{1}{a_3}}}\equiv\ldots\pmod p.\] What is the sum of the first three odd primes that are [i]not[/i] adjective? Note: For two common fractions $\frac{a}{b}$ and $\frac{c}{d}$, we say that $\frac{a}{b}\equiv\frac{c}{d}\pmod p$ if $p$ divides $ad-bc$ and $p$ does not divide $bd$. [i]2019 CCA Math Bonanza Individual Round #14[/i]

2002 AMC 12/AHSME, 7

How many three-digit numbers have at least one $2$ and at least one $3$? $\textbf{(A) }52\qquad\textbf{(B) }54\qquad\textbf{(C) }56\qquad\textbf{(D) }58\qquad\textbf{(E) }60$

1982 IMO Longlists, 37

The diagonals $AC$ and $CE$ of the regular hexagon $ABCDEF$ are divided by inner points $M$ and $N$ respectively, so that \[ {AM\over AC}={CN\over CE}=r. \] Determine $r$ if $B,M$ and $N$ are collinear.

2017 Regional Olympiad of Mexico Southeast, 1

Let $ABC$ a triangle and $C$ it´s circuncircle. Let $D$ a point in arc $AB$ that not contain $A$, diferent of $B$ and $C$ such that $CD$ and $AB$ are not parallel. Let $E$ the intersection of $CD$ and $AB$ and $O$ the circumcircle of triangle $DBE$. Prove that the measure of $\angle OBE$ does not depend of the choice of $D$.

2008 IberoAmerican Olympiad For University Students, 6

[i][b]a)[/b][/i] Determine if there are matrices $A,B,C\in\mathrm{SL}_{2}(\mathbb{Z})$ such that $A^2+B^2=C^2$. [b][i]b)[/i][/b] Determine if there are matrices $A,B,C\in\mathrm{SL}_{2}(\mathbb{Z})$ such that $A^4+B^4=C^4$. [b]Note[/b]: The notation $A\in \mathrm{SL}_{2}(\mathbb{Z})$ means that $A$ is a $2\times 2$ matrix with integer entries and $\det A=1$.

2011 Indonesia TST, 3

Let $M$ be a point in the interior of triangle $ABC$. Let $A'$ lie on $BC$ with $MA'$ perpendicular to $BC$. Define $B'$ on $CA$ and $C'$ on $AB$ similarly. Define \[ p(M) = \frac{MA' \cdot MB' \cdot MC'}{MA \cdot MB \cdot MC}. \] Determine, with proof, the location of $M$ such that $p(M)$ is maximal. Let $\mu(ABC)$ denote this maximum value. For which triangles $ABC$ is the value of $\mu(ABC)$ maximal?

2011 Gheorghe Vranceanu, 2

Let $ \left( a_i \right)_{1\le i\le n} $ and $ \left( b_i \right)_{1\le i\le n} $ be two sequences, the former being a decreasing sequence and the latter being an increasing sequence. All the terms of $ \left( a_i \right)_{1\le i\le n} $ and $ \left( b_i \right)_{1\le i\le n} $ form the set $ \{1,2,3,\ldots ,2n \} . $ Prove that: $$ \left| a_1-b_1 \right| +\left| a_2-b_2 \right| +\cdots +\left| a_n-b_n \right|=n^2 $$

2016 Math Prize for Girls Problems, 2

Tags:
Katrine has a bag containing 4 buttons with distinct letters M, P, F, G on them (one letter per button). She picks buttons randomly, one at a time, without replacement, until she picks the button with letter G. What is the probability that she has at least three picks and her third pick is the button with letter M?

2018 Mexico National Olympiad, 4

Let $n\geq 2$ be an integer. For each $k$-tuple of positive integers $a_1, a_2, \ldots, a_k$ such that $a_1+a_2+\cdots +a_k=n$, consider the sums $S_i=1+2+\ldots +a_i$ for $1\leq i\leq k$. Determine, in terms of $n$, the maximum possible value of the product $S_1S_2\cdots S_k$. [i]Proposed by Misael Pelayo[/i]

2012 HMNT, 2

Tags: algebra
If $x^x = 2012^{2012^{2013}}$ , find $x$.

2016 Flanders Math Olympiad, 2

Determine the smallest natural number $n$ such that $n^n$ is not a divisor of the product $1\cdot 2\cdot 3\cdot ... \cdot 2015\cdot 2016$.

2022 Dutch IMO TST, 3

For real numbers $x$ and $y$ we define $M(x, y)$ to be the maximum of the three numbers $xy$, $(x- 1)(y - 1)$, and $x + y - 2xy$. Determine the smallest possible value of $M(x, y)$ where $x$ and $y$ range over all real numbers satisfying $0 \le x, y \le 1$.

2020 Miklós Schweitzer, 7

Let $p(n)\geq 0$ for all positive integers $n$. Furthermore, $x(0)=0, v(0)=1$, and \[x(n)=x(n-1)+v(n-1), \qquad v(n)=v(n-1)-p(n)x(n) \qquad (n=1,2,\dots).\] Assume that $v(n)\to 0$ in a decreasing manner as $n \to \infty$. Prove that the sequence $x(n)$ is bounded if and only if $\sum_{n=1}^{\infty}n\cdot p(n)<\infty$.

1992 China Team Selection Test, 3

Tags: inequalities
For any $n,T \geq 2, n, T \in \mathbb{N}$, find all $a \in \mathbb{N}$ such that $\forall a_i > 0, i = 1, 2, \ldots, n$, we have \[\sum^n_{k=1} \frac{a \cdot k + \frac{a^2}{4}}{S_k} < T^2 \cdot \sum^n_{k=1} \frac{1}{a_k},\] where $S_k = \sum^k_{i=1} a_i.$

2008 Princeton University Math Competition, B4

A $2008 \times 2009$ rectangle is divided into unit squares. In how many ways can you remove a pair of squares such that the remainder can be covered with $1 \times 2$ dominoes?

2012 Czech-Polish-Slovak Junior Match, 5

Find all triplets $(a, k, m)$ of positive integers that satisfy the equation $k + a^k = m + 2a^m$.

1999 China National Olympiad, 1

Let $m$ be a positive integer. Prove that there are integers $a, b, k$, such that both $a$ and $b$ are odd, $k\geq0$ and \[2m=a^{19}+b^{99}+k\cdot2^{1999}\]

1988 IMO Longlists, 31

For what values of $ n$ does there exist an $ n \times n$ array of entries -1, 0 or 1 such that the $ 2 \cdot n$ sums obtained by summing the elements of the rows and the columns are all different?

2016 NIMO Summer Contest, 12

Let $p$ be a prime. It is given that there exists a unique nonconstant function $\chi:\{1,2,\ldots, p-1\}\to\{-1,1\}$ such that $\chi(1) = 1$ and $\chi(mn) = \chi(m)\chi(n)$ for all $m, n \not\equiv 0 \pmod p$ (here the product $mn$ is taken mod $p$). For how many positive primes $p$ less than $100$ is it true that \[\sum_{a=1}^{p-1}a^{\chi(a)}\equiv 0\pmod p?\] Here as usual $a^{-1}$ denotes multiplicative inverse. [i]Proposed by David Altizio[/i]

2001 All-Russian Olympiad Regional Round, 8.2

$N$ numbers - ones and twos - are arranged in a circle. We mean a number formed by several digits arranged in a row (clockwise or counterclockwise). For what is the smallest value of $N$, all four-digit numbers whose writing contains only numbers $1$ and $2$, could they be among those shown?

2014 Mediterranean Mathematics Olympiad, 2

Consider increasing integer sequences with elements from $1,\ldots,10^6$. Such a sequence is [i]Adriatic[/i] if its first element equals 1 and if every element is at least twice the preceding element. A sequence is [i]Tyrrhenian[/i] if its final element equals $10^6$ and if every element is strictly greater than the sum of all preceding elements. Decide whether the number of Adriatic sequences is smaller than, equal to, or greater than the number of Tyrrhenian sequences. (Proposed by Gerhard Woeginger, Austria)

2024 German National Olympiad, 6

Decide whether there exists a largest positive integer $n$ such that the inequality \[\frac{\frac{a^2}{b}+\frac{b^2}{a}}{2} \ge \sqrt[n]{\frac{a^n+b^n}{2}}\] holds for all positive real numbers $a$ and $b$. If such a largest positive integer $n$ exists, determine it.

1972 Vietnam National Olympiad, 3

$ABC$ is a triangle. $U$ is a point on the line $BC$. $I$ is the midpoint of $BC$. The line through $C$ parallel to $AI$ meets the line $AU$ at $E$. The line through $E$ parallel to $BC$ meets the line $AB$ at $F$. The line through $E$ parallel to $AB$ meets the line $BC$ at $H$. The line through $H$ parallel to $AU$ meets the line $AB$ at $K$. The lines $HK$ and $FG$ meet at $T. V$ is the point on the line $AU$ such that $A$ is the midpoint of $UV$. Show that $V, T$ and $I$ are collinear.

1986 AMC 8, 5

Tags:
A contest began at noon one day and ended $ 1000$ minutes later. At what time did the contest end? \[ \textbf{(A)}\ 10: 00 \text{ p.m.} \qquad \textbf{(B)}\ \text{midnight} \qquad \textbf{(C)}\ 2: 30 \text{ a.m.} \\ \textbf{(D)}\ 4: 40 \text{ a.m.} \qquad \textbf{(E)}\ 6: 40 \text{ a.m.} \]