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

2017 Israel Oral Olympiad, 5

A mink is standing in the center of a field shaped like a regular polygon. The field is surrounded by a fence, and the mink can only exit through the vertices of the polygon. A dog is standing on one of the vertices, and can move along the fence. The mink wants to escape the field, while the dog tries to prevent it. Each of them moves with constant velocity. For what ratio of velocities could the mink escape if: a. The field is a regular triangle? b. The field is a square?

1988 IMO Shortlist, 30

A point $ M$ is chosen on the side $ AC$ of the triangle $ ABC$ in such a way that the radii of the circles inscribed in the triangles $ ABM$ and $ BMC$ are equal. Prove that \[ BM^{2} \equal{} X \cot \left( \frac {B}{2}\right) \] where X is the area of triangle $ ABC.$

1967 IMO Shortlist, 4

The square $ABCD$ has to be decomposed into $n$ triangles (which are not overlapping) and which have all angles acute. Find the smallest integer $n$ for which there exist a solution of that problem and for such $n$ construct at least one decomposition. Answer whether it is possible to ask moreover that (at least) one of these triangles has the perimeter less than an arbitrarily given positive number.

2001 Tournament Of Towns, 7

Several boxes are arranged in a circle. Each box may be empty or may contain one or several chips. A move consists of taking all the chips from some box and distributing them one by one into subsequent boxes clockwise starting from the next box in the clockwise direction. (a) Suppose that on each move (except for the first one) one must take the chips from the box where the last chip was placed on the previous move. Prove that after several moves the initial distribution of the chips among the boxes will reappear. (b) Now, suppose that in each move one can take the chips from any box. Is it true that for every initial distribution of the chips you can get any possible distribution?

2001 IberoAmerican, 3

Show that it is impossible to cover a unit square with five equal squares with side $s<\frac{1}{2}$.

2000 Slovenia National Olympiad, Problem 1

Tags: digit
In the expression $4\cdot\text{RAKEC}=\text{CEKAR}$, each letter represents a (decimal) digit. Replace the letters so that the equality is true.

2015 Dutch IMO TST, 4

Each of the numbers $1$ up to and including $2014$ has to be coloured; half of them have to be coloured red the other half blue. Then you consider the number $k$ of positive integers that are expressible as the sum of a red and a blue number. Determine the maximum value of $k$ that can be obtained.

2012 ELMO Shortlist, 4

A tournament on $2k$ vertices contains no $7$-cycles. Show that its vertices can be partitioned into two sets, each with size $k$, such that the edges between vertices of the same set do not determine any $3$-cycles. [i]Calvin Deng.[/i]

1989 China Team Selection Test, 2

Let $v_0 = 0, v_1 = 1$ and $v_{n+1} = 8 \cdot v_n - v_{n-1},$ $n = 1,2, ...$. Prove that in the sequence $\{v_n\}$ there aren't terms of the form $3^{\alpha} \cdot 5^{\beta}$ with $\alpha, \beta \in \mathbb{N}.$

2020 Poland - Second Round, 4.

Tags: geometry
Let $ABCDEF$ be a such convex hexagon that $$ AB=CD=EF\; \text{and} \; BC=DE=.FA$$ Prove that if $\sphericalangle FAB + \sphericalangle ABC=\sphericalangle FAB + \sphericalangle EFA = 240^{\circ}$, then $\sphericalangle FAB+\sphericalangle CDE=240^{\circ}$.

2000 Denmark MO - Mohr Contest, 4

A rectangular floor is covered by a certain number of equally large quadratic tiles. The tiles along the edge are red, and the rest are white. There are equally many red and white tiles. How many tiles can there be?

III Soros Olympiad 1996 - 97 (Russia), 11.1

Tags: algebra
The sum of several consecutive natural numbers is $20$ times greater than the largest of them and $30$ times greater than the smallest. Find these numbers.

2021 MOAA, 2

Tags:
Add one pair of brackets to the expression \[1+2\times 3+4\times 5+6\] so that the resulting expression has a valid mathematical value, e.g., $1+2\times (3 + 4\times 5)+6=53$. What is the largest possible value that one can make? [i]Proposed by Nathan Xiong[/i]

2022 CMIMC, 2.3 1.2

Tags: geometry
Let $ABC$ be an acute triangle with $\angle ABC=60^{\circ}.$ Suppose points $D$ and $E$ are on lines $AB$ and $CB,$ respectively, such that $CDB$ and $AEB$ are equilateral triangles. Given that the positive difference between the perimeters of $CDB$ and $AEB$ is $60$ and $DE=45,$ what is the value of $AB \cdot BC?$ [i]Proposed by Kyle Lee[/i]

2014 Contests, Problem 2

Clau writes all four-digit natural numbers where $3$ and $7$ are always together. How many digits does she write in total?

Russian TST 2021, P3

Let $ABC$ be a triangle with incenter $I$ and circumcircle $\Gamma$. Circles $\omega_{B}$ passing through $B$ and $\omega_{C}$ passing through $C$ are tangent at $I$. Let $\omega_{B}$ meet minor arc $AB$ of $\Gamma$ at $P$ and $AB$ at $M\neq B$, and let $\omega_{C}$ meet minor arc $AC$ of $\Gamma$ at $Q$ and $AC$ at $N\neq C$. Rays $PM$ and $QN$ meet at $X$. Let $Y$ be a point such that $YB$ is tangent to $\omega_{B}$ and $YC$ is tangent to $\omega_{C}$. Show that $A,X,Y$ are collinear.

2015 Balkan MO Shortlist, G4

Tags: conic , geometry
Let $\triangle{ABC}$ be a scalene triangle with incentre $I$ and circumcircle $\omega$. Lines $AI, BI, CI$ intersect $\omega$ for the second time at points $D, E, F$, respectively. The parallel lines from $I$ to the sides $BC, AC, AB$ intersect $EF, DF, DE$ at points $K, L, M$, respectively. Prove that the points $K, L, M$ are collinear. [i](Cyprus)[/i]

Ukrainian TYM Qualifying - geometry, 2014.9

Construct a point $Q$ in triangle $ABC$ such that at least two of the segments $CQ, BQ, AQ$, divide the inscribed circle in half. For which triangles is this possible?

2011 IFYM, Sozopol, 4

Let $n$ be some natural number. One boss writes $n$ letters a day numerated from 1 to $n$ consecutively. When he writes a letter he piles it up (on top) in a box. When his secretary is free, she gets the letter on the top of the pile and prints it. Sometimes the secretary isn’t able to print the letter before her boss puts another one or more on the pile in the box. Though she is always able to print all of the letters at the end of the day. A permutation is called [i]“printable”[/i] if it is possible for the letters to be printed in this order. Find a formula for the number of [i]“printable”[/i] permutations.

2024 JHMT HS, 15

Let $N_{14}$ be the answer to problem 14. Rectangle $ABCD$ has area $\sqrt{2N_{14}}$. Points $E$, $F$, $G$, and $H$ lie on the rays $\overrightarrow{AB}$, $\overrightarrow{BC}$, $\overrightarrow{CD}$, and $\overrightarrow{DA}$, respectively, such that $EFGH$ is a rectangle with area $2\sqrt{2N_{14}}$ that contains all of $ABCD$ in its interior. If \[ \tan\angle AEH = \tan\angle BFE = \tan\angle CGF = \tan\angle DHG = \sqrt{\frac{1}{48}}, \] then $EG=\tfrac{m\sqrt{n}}{p}$, where $m$, $n$, and $p$ are positive integers, $m$ and $p$ are relatively prime, and $n$ is not divisible by the square of any prime. Compute $m + n + p$.

1983 IMO Longlists, 32

Let $a, b, c$ be positive real numbers and let $[x]$ denote the greatest integer that does not exceed the real number $x$. Suppose that $f$ is a function defined on the set of non-negative integers $n$ and taking real values such that $f(0) = 0$ and \[f(n) \leq an + f([bn]) + f([cn]), \qquad \text{ for all } n \geq 1.\] Prove that if $b + c < 1$, there is a real number $k$ such that \[f(n) \leq kn \qquad \text{ for all } n \qquad (1)\] while if $b + c = 1$, there is a real number $K$ such that $f(n) \leq K n \log_2 n$ for all $n \geq 2$. Show that if $b + c = 1$, there may not be a real number $k$ that satisfies $(1).$

1979 IMO Longlists, 79

Tags: geometry
Let $S$ be a unit circle and $K$ a subset of $S$ consisting of several closed arcs. Let $K$ satisfy the following properties: $(\text{i})$ $K$ contains three points $A,B,C$, that are the vertices of an acute-angled triangle $(\text{ii})$ For every point $A$ that belongs to $K$ its diametrically opposite point $A'$ and all points $B$ on an arc of length $\frac{1}{9}$ with center $A'$ do not belong to $K$. Prove that there are three points $E,F,G$ on $S$ that are vertices of an equilateral triangle and that do not belong to $K$.

2018 Balkan MO Shortlist, G2

Let $ABC$ be a triangle inscribed in circle $\Gamma$ with center $O$. Let $H$ be the orthocenter of triangle $ABC$ and let $K$ be the midpoint of $OH$. Tangent of $\Gamma$ at $B$ intersects the perpendicular bisector of $AC$ at $L$. Tangent of $\Gamma$ at $C$ intersects the perpendicular bisector of $AB$ at $M$. Prove that $AK$ and $LM$ are perpendicular. by Michael Sarantis, Greece

2006 Harvard-MIT Mathematics Tournament, 9

Four spheres, each of radius $r$, lie inside a regular tetrahedron with side length $1$ such that each sphere is tangent to three faces of the tetrahedron and to the other three spheres. Find $r$.

2013 CHMMC (Fall), 9

A $ 7 \times 7$ grid of unit-length squares is given. Twenty-four $1 \times 2$ dominoes are placed in the grid, each covering two whole squares and in total leaving one empty space. It is allowed to take a domino adjacent to the empty square and slide it lengthwise to fill the whole square, leaving a new one empty and resulting in a different configuration of dominoes. Given an initial configuration of dominoes for which the maximum possible number of distinct configurations can be reached through any number of slides, compute the maximum number of distinct configurations.