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

2006 Moldova MO 11-12, 8

Given an alfabet of $n$ letters. A sequence of letters such that between any 2 identical letters there are no 2 identical letters is called a [i]word[/i]. a) Find the maximal possible length of a [i]word[/i]. b) Find the number of the [i]words[/i] of maximal length.

2020 Bulgaria Team Selection Test, 2

Given two odd natural numbers $ a,b$ prove that for each $ n\in\mathbb{N}$ there exists $ m\in\mathbb{N}$ such that either $ a^mb^2-1$ or $ b^ma^2-1$ is multiple of $ 2^n.$

2025 JBMO TST - Turkey, 2

Let $n$ be a positive integer. Aslı and Zehra are playing a game on an $n\times n$ grid. Initially, $10n^2$ stones are placed on some of the unit squares of this grid. On each move (starting with Aslı), Aslı chooses a row or a column that contains at least two squares with different numbers of stones, and Zehra redistributes the stones in that row or column so that after redistribution, the difference in the number of stones between any two squares in that row or column is at most one. Furthermore, this move must change the number of stones in at least one square. For which values of $n$, regardless of the initial placement of the stones, can Aslı guarantee that every square ends up with the same number of stones?

1995 Mexico National Olympiad, 3

$A, B, C, D$ are consecutive vertices of a regular $7$-gon. $AL$ and $AM$ are tangents to the circle center $C$ radius $CB$. $N$ is the intersection point of $AC$ and $BD$. Show that $L, M, N$ are collinear.

2021 Dutch IMO TST, 2

Stekel and Prick play a game on an $ m \times n$ board, where $m$ and $n$ are positive are integers. They alternate turns, with Stekel starting. Spine bets on his turn, he always takes a pawn on a square where there is no pawn yet. Prick does his turn the same, but his pawn must always come into a square adjacent to the square that Spike just placed a pawn in on his previous turn. Prick wins like the whole board is full of pawns. Spike wins if Prik can no longer move a pawn on his turn, while there is still at least one empty square on the board. Determine for all pairs $(m, n)$ who has a winning strategy.

2011 Today's Calculation Of Integral, 759

Given a regular tetrahedron $PQRS$ with side length $d$. Find the volume of the solid generated by a rotation around the line passing through $P$ and the midpoint $M$ of $QR$.

1966 IMO Longlists, 55

Given the vertex $A$ and the centroid $M$ of a triangle $ABC$, find the locus of vertices $B$ such that all the angles of the triangle lie in the interval $[40^\circ, 70^\circ].$

2008 F = Ma, 23

Tags:
Consider two uniform spherical planets of equal density but unequal radius. Which of the following quantities is the same for both planets? (a) The escape velocity from the planet’s surface. (b) The acceleration due to gravity at the planet’s surface. (c) The orbital period of a satellite in a circular orbit just above the planet’s surface. (d) The orbital period of a satellite in a circular orbit at a given distance from the planet’s center. (e) None of the above.

2017 Miklós Schweitzer, 5

For every non-constant polynomial $p$, let $H_p=\big\{z\in \mathbb{C} \, \big| \, |p(z)|=1\big\}$. Prove that if $H_p=H_q$ for some polynomials $p,q$, then there exists a polynomial $r$ such that $p=r^m$ and $q=\xi\cdot r^n$ for some positive integers $m,n$ and constant $|\xi|=1$.

1998 Korea Junior Math Olympiad, 8

$T$ is a set of all the positive integers of the form $2^k 3^l$, where $k, l$ are some non-negetive integers. Show that there exists $1998$ different elements of $T$ that satisfy the following condition. [b]Condition[/b] The sum of the $1998$ elements is again an element of $T$.

2008 Argentina Iberoamerican TST, 1

We have $ 100$ equal cubes. Player $ A$ has to paint the faces of the cubes, each white or black, such that every cube has at least one face of each colour, at least $ 50$ cubes have more than one black face and at least $ 50$ cubes have more than one white face . Player $ B$ has to place the coloured cubes in a table in a way that their bases form the frame that surrounds a $ 40*12$ rectangle. There are some faces that can not been seen because they are overlapped with other faces or based on the table, we call them invisible faces. On the other hand, the ones which can be seen are called visible faces. Prove that player $ B$ can always place the cubes in such a way that the number of visible faces is the the same as the number of invisible faces, despite the initial colouring of player $ A$ Note: It is easy to see that in the configuration, each cube has three visible faces and three invisible faces

1985 Traian Lălescu, 2.3

Let $ z_1,z_2,z_3\in\mathbb{C} , $ different two by two, having the same modulus $ \rho . $ Show that: $$ \frac{1}{\left| z_1-z_2\right|\cdot \left| z_1-z_3\right|} +\frac{1}{\left| z_2-z_1\right|\cdot \left| z_2-z_3\right|} +\frac{1}{\left| z_3-z_1\right|\cdot \left| z_3-z_2\right|}\ge\frac{1}{\rho^2} . $$

1967 AMC 12/AHSME, 35

Tags:
The roots of $64x^3-144x^2+92x-15=0$ are in arithmetic progression. The difference between the largest and smallest roots is: $\textbf{(A)}\ 2\qquad \textbf{(B)}\ 1\qquad \textbf{(C)}\ \frac{1}{2}\qquad \textbf{(D)}\ \frac{3}{8}\qquad \textbf{(E)}\ \frac{1}{4}$

2019 Germany Team Selection Test, 3

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

2008 Postal Coaching, 5

Let $\omega$ be the semicircle on diameter $AB$. A line parallel to $AB$ intersects $\omega$ at $C$ and $D$ so that $B$ and $C$ lie on opposite sides of $AD$. The line through $C$ parallel to $AD$ meets $\omega$ again in $E$. Lines $BE$ and $CD$ meet in $F$ and the line through $F$ parallel to $AD$ meets $AB$ in $P$. Prove that $PC$ is tangent to $\omega$.

2011 JHMT, 1

Tags: geometry
Let $D_{x,y}$ denote the half-disk of radius $1$ with its curved boundary externally tangent to the unit circle at the point $(x, y)$, such that the straight boundary of the disk is parallel to the tangent line (so the point of tangency is the middle of the curved boundary). Find the area of the union of the $D_{x,y}$ over all $(x, y)$ with $x^2 + y^2 = 1$ (that is, $(x,y)$ is on the unit circle).

2009 Kyrgyzstan National Olympiad, 8

Tags: function , limit , algebra
Does there exist a function $ f: {\Bbb N} \to {\Bbb N}$ such that $ f(f(n \minus{} 1)) \equal{} f(n \plus{} 1) \minus{} f(n)$ for all $ n > 2$.

1991 Swedish Mathematical Competition, 3

Tags: sequence , algebra
The sequence $x_0, x_1, x_2, ...$ is defined by $x_0 = 0$, $x_{k+1} = [(n - \sum_0^k x_i)/2]$. Show that $x_k = 0$ for all sufficiently large $k$ and that the sum of the non-zero terms $x_k$ is $n-1$.

1973 Chisinau City MO, 67

The product of $10$ natural numbers is equal to $10^{10}$. What is the largest possible sum of these numbers?

2017 Purple Comet Problems, 10

Tags:
Find the number of rearrangements of the letters in the word MATHMEET that begin and end with the same letter such as TAMEMHET.

2012 France Team Selection Test, 1

Let $n$ and $k$ be two positive integers. Consider a group of $k$ people such that, for each group of $n$ people, there is a $(n+1)$-th person that knows them all (if $A$ knows $B$ then $B$ knows $A$). 1) If $k=2n+1$, prove that there exists a person who knows all others. 2) If $k=2n+2$, give an example of such a group in which no-one knows all others.

1972 Bulgaria National Olympiad, Problem 2

Solve the system of equations: $$\begin{cases}\sqrt{\frac{y(t-y)}{t-x}-\frac4x}+\sqrt{\frac{z(t-z)}{t-x}-\frac4x}=\sqrt x\\\sqrt{\frac{z(t-z)}{t-y}-\frac4y}+\sqrt{\frac{x(t-x)}{t-y}-\frac4y}=\sqrt y\\\sqrt{\frac{x(t-x)}{t-z}-\frac4z}+\sqrt{\frac{y(t-y)}{t-z}-\frac4z}=\sqrt z\\x+y+z=2t\end{cases}$$ if the following conditions are satisfied: $0<x<t$, $0<y<t$, $0<z<t$. [i]H. Lesov[/i]

2022 Ecuador NMO (OMEC), 1

Prove that it is impossible to divide a square with side length $7$ into exactly $36$ squares with integer side lengths.

2006 Sharygin Geometry Olympiad, 8.1

Inscribe the equilateral triangle of the largest perimeter in a given semicircle.

2015 Saudi Arabia JBMO TST, 3

A right triangle $ABC$ with $\angle C=90^o$ is inscribed in a circle. Suppose that $K$ is the midpoint of the arc $BC$ that does not contain $A$. Let $N$ be the midpoint of the segment $AC$, and $M$ be the intersection point of the ray $KN$ and the circle.The tangents to the circle drawn at $A$ and $C$ meet at $E$. prove that $\angle EMK = 90^o$