Found problems: 85335
2003 Estonia National Olympiad, 5
On a lottery ticket a player has to mark $6$ numbers from $36$. Then $6$ numbers from these $36$ are drawn randomly and the ticket wins if none of the numbers that came out is marked on the ticket. Prove that
a) it is possible to mark the numbers on $9$ tickets so that one of these tickets always wins,
b) it is not possible to mark the numbers on $8$ tickets so that one of tickets always wins.
2023 Kyiv City MO Round 1, Problem 1
Which number is larger: $A = \frac{1}{9} : \sqrt[3]{\frac{1}{2023}}$, or $B = \log_{2023} 91125$?
2005 AMC 8, 14
The Little Twelve Basketball Conference has two divisions, with six teams in each division. Each team plays each of the other teams in its own division twice and every team in the other division once. How many conference games are scheduled?
$ \textbf{(A)}\ 80\qquad\textbf{(B)}\ 96\qquad\textbf{(C)}\ 100\qquad\textbf{(D)}\ 108\qquad\textbf{(E)}\ 192 $
1991 IMTS, 1
For every positive integer $n$, form the number $n/s(n)$, where $s(n)$ is the sum of digits of $n$ in base 10. Determine the minimum value of $n/s(n)$ in each of the following cases:
(i) $10 \leq n \leq 99$
(ii) $100 \leq n \leq 999$
(iii) $1000 \leq n \leq 9999$
(iv) $10000 \leq n \leq 99999$
2019 Tuymaada Olympiad, 7
A circle $\omega$ touches the sides $A$B and $BC$ of a triangle $ABC$ and intersects its side $AC$ at $K$. It is known that the tangent to $\omega$ at $K$ is symmetrical to the line $AC$ with respect to the line $BK$. What can be the difference $AK -CK$ if $AB = 9$ and $BC = 11$?
1995 IMO Shortlist, 2
Let $ A, B$ and $ C$ be non-collinear points. Prove that there is a unique point $ X$ in the plane of $ ABC$ such that \[ XA^2 \plus{} XB^2 \plus{} AB^2 \equal{} XB^2 \plus{} XC^2 \plus{} BC^2 \equal{} XC^2 \plus{} XA^2 \plus{} CA^2.\]
2020 Kazakhstan National Olympiad, 2
Let $x_1, x_2, ... , x_n$ be a real numbers such that\\
1) $1 \le x_1, x_2, ... , x_n \le 160$
2) $x^{2}_{i} + x^{2}_{j} + x^{2}_{k} \ge 2(x_ix_j + x_jx_k + x_kx_i)$ for all $1\le i < j < k \le n$
Find the largest possible $n$.
2025 China Team Selection Test, 7
Let $k$, $a$, and $b$, be fixed integers such that $0 \le a < k$, $0 \le b < k+1$, and $a$, $b$ are not both zero.
The sequence $\{T_n\}_{n \ge k}$ satisfies $T_n = T_{n-1}+T_{n-2} \pmod{n}$, $0 \le T_n < n$, $T_k = a$, and $T_{k+1} = b$. Let the decimal expression of $T_n$ form a sequence $x=\overline{0.T_kT_{k+1} \dots}$. For instance, when $k = 66, a = 5, b = 20$, we get $T_{66}=5$, $T_{67}=20$, $T_{68}=25$, $T_{69}=45$, $T_{70}=0$, $T_{71}=45, \dots$, and thus $x=0.522545045 \dots$.
Prove that $x$ is irrational.
2016 CMIMC, 6
In parallelogram $ABCD$, angles $B$ and $D$ are acute while angles $A$ and $C$ are obtuse. The perpendicular from $C$ to $AB$ and the perpendicular from $A$ to $BC$ intersect at a point $P$ inside the parallelogram. If $PB=700$ and $PD=821$, what is $AC$?
2014 PUMaC Algebra A, 1
On the number line, consider the point $x$ that corresponds to the value $10$. Consider $24$ distinct integer points $y_1$, $y_2$, $\ldots$, $y_{24}$ on the number line such that for all $k$ such that $1\leq k\leq 12$, we have that $y_{2k-1}$ is the reflection of $y_{2k}$ across $x$. Find the minimum possible value of \[\textstyle\sum_{n=1}^{24}(|y_n-1|+|y_n+1|).\]
Russian TST 2019, P1
A circle $\omega$ with radius $1$ is given. A collection $T$ of triangles is called [i]good[/i], if the following conditions hold:
[list=1]
[*] each triangle from $T$ is inscribed in $\omega$;
[*] no two triangles from $T$ have a common interior point.
[/list]
Determine all positive real numbers $t$ such that, for each positive integer $n$, there exists a good collection of $n$ triangles, each of perimeter greater than $t$.
2014 China National Olympiad, 1
Let $ABC$ be a triangle with $AB>AC$. Let $D$ be the foot of the internal angle bisector of $A$. Points $F$ and $E$ are on $AC,AB$ respectively such that $B,C,F,E$ are concyclic. Prove that the circumcentre of $DEF$ is the incentre of $ABC$ if and only if $BE+CF=BC$.
2012 Harvard-MIT Mathematics Tournament, 7
Let $S$ be the set of the points $(x_1, x_2, . . . , x_{2012})$ in $2012$-dimensional space such that $|x_1|+|x_2|+...+|x_{2012}| \le 1$. Let $T$ be the set of points in $2012$-dimensional space such that $\max^{2012}_{i=1}|x_i| = 2$. Let $p$ be a randomly chosen point on $T$. What is the probability that the closest point in $S$ to $p$ is a vertex of $S$?
2019 CMIMC, 5
Let $MATH$ be a trapezoid with $MA=AT=TH=5$ and $MH=11$. Point $S$ is the orthocenter of $\triangle ATH$. Compute the area of quadrilateral $MASH$.
2002 AMC 12/AHSME, 16
Juan rolls a fair regular octahedral die marked with the numbers $ 1$ through $ 8$. Then Amal rolls a fair six-sided die. What is the probability that the product of the two rolls is a multiple of $ 3$?
$ \textbf{(A)}\ \frac{1}{12} \qquad
\textbf{(B)}\ \frac{1}{3} \qquad
\textbf{(C)}\ \frac{1}{2} \qquad
\textbf{(D)}\ \frac{7}{12} \qquad
\textbf{(E)}\ \frac{2}{3}$
2017 District Olympiad, 2
Let be a group and two coprime natural numbers $ m,n. $ Show that if the applications $ G\ni x\mapsto x^{m+1},x^{n+1} $ are surjective endomorphisms, then the group is commutative.
2006 Vietnam Team Selection Test, 1
Given an acute angles triangle $ABC$, and $H$ is its orthocentre. The external bisector of the angle $\angle BHC$ meets the sides $AB$ and $AC$ at the points $D$ and $E$ respectively. The internal bisector of the angle $\angle BAC$ meets the circumcircle of the triangle $ADE$ again at the point $K$. Prove that $HK$ is through the midpoint of the side $BC$.
2018 India PRMO, 28
Let $N$ be the number of ways of distributing $8$ chocolates of different brands among $3$ children such that each child gets at least one chocolate, and no two children get the same number of chocolates. Find the sum of the digits of $N$.
1987 AMC 12/AHSME, 23
If $p$ is a prime and both roots of $x^2+px-444p=0$ are integers, then
$ \textbf{(A)}\ 1<p\le 11 \qquad\textbf{(B)}\ 11<p \le 21 \qquad\textbf{(C)}\ 21< p \le 31 \\ \qquad\textbf{(D)}\ 31< p \le 41 \qquad\textbf{(E)}\ 41< p \le 51 $
2012 Purple Comet Problems, 21
Each time you click a toggle switch, the switch either turns from [i]off[/i] to [i]on[/i] or from [i]on[/i] to [i]off[/i]. Suppose that you start with three toggle switches with one of them [i]on[/i] and two of them [i]off[/i]. On each move you randomly select one of the three switches and click it. Let $m$ and $n$ be relatively prime positive integers so that $\frac{m}{n}$ is the probability that after four such clicks, one switch will be [i]on[/i] and two of them will be [i]off[/i]. Find $m+n$.
2017 USAMTS Problems, 4
Zan starts with a rational number $\tfrac{a}{b}$ written on the board in lowest terms. Then, every second, Zan adds $1$ to both the numerator and denominator of the latest fraction and writes the result in lowest terms. Zan stops as soon as he writes a fraction of the form $\tfrac{n}{n+1}$, for some positive integer $n$. If $\tfrac{a}{b}$ started in that form, Zan does nothing.
As an example, if Zan starts with $\tfrac{13}{19}$, then after one second he writes $\tfrac{14}{20} = \tfrac{7}{10}$, then after two seconds $\tfrac{8}{11}$, then $\tfrac{9}{12} = \tfrac{3}{4}$, at which point he stops.
(a) Prove that Zan will stop in less than $b-a$ seconds.
(b) Show that if $\tfrac{n}{n+1}$ is the final number, then \[\frac{n-1}{n} < \frac{a}{b} \le \frac{n}{n+1}.\]
[i](Proposed by Michael Tang.)[/i]
1987 IMO Shortlist, 5
Find, with proof, the point $P$ in the interior of an acute-angled triangle $ABC$ for which $BL^2+CM^2+AN^2$ is a minimum, where $L,M,N$ are the feet of the perpendiculars from $P$ to $BC,CA,AB$ respectively.
[i]Proposed by United Kingdom.[/i]
1985 AMC 12/AHSME, 19
Consider the graphs $ y \equal{} Ax^2$ and and $ y^2 \plus{} 3 \equal{} x^2 \plus{} 4y$, where $ A$ is a positive constant and $ x$ and $ y$ are real variables. In how many points do the two graphs intersect?
$ \textbf{(A)}\ \text{exactly } 4 \qquad \textbf{(B)}\ \text{exactly } 2$
$ \textbf{(C)}\ \text{at least } 1, \text{ but the number varies for different positive values of } A$
$ \textbf{(D)}\ 0 \text{ for at least one positive value of } A \qquad \textbf{(E)}\ \text{none of these}$
2016 Romanian Masters in Mathematic, 6
A set of $n$ points in Euclidean 3-dimensional space, no four of which are coplanar, is partitioned into two subsets $\mathcal{A}$ and $\mathcal{B}$. An $\mathcal{AB}$-tree is a configuration of $n-1$ segments, each of which has an endpoint in $\mathcal{A}$ and an endpoint in $\mathcal{B}$, and such that no segments form a closed polyline. An $\mathcal{AB}$-tree is transformed into another as follows: choose three distinct segments $A_1B_1$, $B_1A_2$, and $A_2B_2$ in the $\mathcal{AB}$-tree such that $A_1$ is in $\mathcal{A}$ and $|A_1B_1|+|A_2B_2|>|A_1B_2|+|A_2B_1|$, and remove the segment $A_1B_1$ to replace it by the segment $A_1B_2$. Given any $\mathcal{AB}$-tree, prove that every sequence of successive transformations comes to an end (no further transformation is possible) after finitely many steps.
1984 Austrian-Polish Competition, 7
A $m\times n$ matrix $(a_{ij})$ of real numbers satisfies $|a_{ij}| <1$ and $\sum_{i=1}^m a_{ij}= 0$ for all$ j$. Show that one can permute the entries in each column in such a way that the obtained matrix $(b_{ij})$ satisfies $\sum_{j=1}^n b_{ij} < 2$ for all $i$.