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

MathLinks Contest 5th, 6.2

We say that a positive integer $n$ is nice if $\frac{4}{n}$ cannot be written as $\frac{1}{x}+\frac{1}{xy}+\frac{1}{z}$ for any positive integers $x, y, z$. Let us denote by $ a_n$ the number of nice numbers smaller than $n$. Prove that the sequence $\frac{n}{a_n}$ is not bounded.

1955 Moscow Mathematical Olympiad, 309

A point $O$ inside a convex $n$-gon $A_1A_2 . . .A_n$ is connected with segments to its vertices. The sides of this $n$-gon are numbered $1$ to $n$ (distinct sides have distinct numbers). The segments $OA_1,OA_2, . . . ,OA_n$ are similarly numbered. a) For $n = 9$ find a numeration such that the sum of the sides’ numbers is the same for all triangles $A_1OA_2, A_2OA_3, . . . , A_nOA_1$. b) Prove that for $n = 10$ there is no such numeration.

2005 AMC 12/AHSME, 22

A rectangular box $ P$ is inscribed in a sphere of radius $ r$. The surface area of $ P$ is 384, and the sum of the lengths of its 12 edges is 112. What is $ r$? $ \textbf{(A)}\ 8 \qquad \textbf{(B)}\ 10 \qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ 14 \qquad \textbf{(E)}\ 16$

2024/2025 TOURNAMENT OF TOWNS, P4

Given $2N$ real numbers. It is known that if they are arbitrarily divided into two groups of $N$ numbers each then the products of the numbers of each group differ by $2$ at most. Is it necessarily true that if we arbitrarily place these numbers along a circle then there are two neighboring numbers that differ by $2$ at most, for a) $N=50$; (3 marks) b) $N=25$? (5 marks)

2009 China Team Selection Test, 2

Given an integer $ n\ge 2$, find the maximal constant $ \lambda (n)$ having the following property: if a sequence of real numbers $ a_{0},a_{1},a_{2},\cdots,a_{n}$ satisfies $ 0 \equal{} a_{0}\le a_{1}\le a_{2}\le \cdots\le a_{n},$ and $ a_{i}\ge\frac {1}{2}(a_{i \plus{} 1} \plus{} a_{i \minus{} 1}),i \equal{} 1,2,\cdots,n \minus{} 1,$ then $ (\sum_{i \equal{} 1}^n{ia_{i}})^2\ge \lambda (n)\sum_{i \equal{} 1}^n{a_{i}^2}.$

2011 Cuba MO, 7

Find a set of positive integers with the greatest possible number of elements such that the least common multiple of all of them is less than $2011$.

2014 Dutch BxMO/EGMO TST, 3

Tags: geometry
In triangle $ABC$, $I$ is the centre of the incircle. There is a circle tangent to $AI$ at $I$ which passes through $B$. This circle intersects $AB$ once more in $P$ and intersects $BC$ once more in $Q$. The line $QI$ intersects $AC$ in $R$. Prove that $|AR|\cdot |BQ|=|P I|^2$

2010 Turkey MO (2nd round), 3

Let $K$ be the set of all sides and diagonals of a convex $2010-gon$ in the plane. For a subset $A$ of $K,$ if every pair of line segments belonging to $A$ intersect, then we call $A$ as an [i]intersecting set.[/i] Find the maximum possible number of elements of union of two [i]intersecting sets.[/i]

2011 Purple Comet Problems, 2

The diagram below shows a $12$-sided figure made up of three congruent squares. The figure has total perimeter $60$. Find its area. [asy] size(150); defaultpen(linewidth(0.8)); path square=unitsquare; draw(rotate(360-135)*square^^rotate(345)*square^^rotate(105)*square); [/asy]

Cono Sur Shortlist - geometry, 2009.G3

Tags: geometry
We have a convex polygon $P$ in the plane and two points $S,T$ in the boundary of $P$, dividing the perimeter in a proportion $1:2$. Three distinct points in the boundary, denoted by $A,B,C$ start to move simultaneously along the boundary, in the same direction and with the same speed. Prove that there will be a moment in which one of the segments $AB, BC, CA$ will have a length smaller or equal than $ST$.

2016 BMT Spring, 9

On $5 \times 5$ grid of lattice points, every point is uniformly randomly colored blue, red, or green. Find the expected number of monochromatic triangles T with vertices chosen from the lattice grid, such that some two sides of $T$ are parallel to the axis.

2011 ELMO Shortlist, 5

Given positive reals $x,y,z$ such that $xy+yz+zx=1$, show that \[\sum_{\text{cyc}}\sqrt{(xy+kx+ky)(xz+kx+kz)}\ge k^2,\]where $k=2+\sqrt{3}$. [i]Victor Wang.[/i]

1999 National High School Mathematics League, 1

Tags: geometry
In convex quadrilateral $ABCD$, $\angle BAC=\angle CAD$. $E$ lies on segment $CD$, $BE$ and $AC$ intersect at $F,$ $DF$ and $BC$ intersect at $G.$ Prove that $\angle GAC=\angle EAC$.

PEN M Problems, 34

The sequence of integers $\{ x_{n}\}_{n\ge1}$ is defined as follows: \[x_{1}=1, \;\; x_{n+1}=1+{x_{1}}^{2}+\cdots+{x_{n}}^{2}\;(n=1,2,3 \cdots).\] Prove that there are no squares of natural numbers in this sequence except $x_{1}$.

2018 Costa Rica - Final Round, LRP3

Jordan is in the center of a circle whose radius is $100$ meters and can move one meter at a time, however, there is a giant who at every step can force you to move in the opposite direction to the one he chose (it does not mean returning to the place of departure, but advance but in the opposite direction to the chosen one). Determine the minimum number of steps that Jordan must give to get out of the circle.

2004 Miklós Schweitzer, 10

Let $\mathcal{N}_p$ stand for a $p$ dimensional random variable of standard normal distribution. For $a\in\mathbb{R}^p$, let $H_p(a)$ stand for the expectation $E|\mathcal{N}_p+a|$. For $p>1$, prove that $$H_p(a)=(p-1)\int_0^{\infty} H_1\left( \frac{|a|}{\sqrt{r^2+1}}\right) \frac{r^{p-2}}{\sqrt{(r^2+1)^p}} \mathrm{d}r$$

2015 Switzerland - Final Round, 3

Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$, such that for arbitrary $x,y \in \mathbb{R}$: \[ (y+1)f(x)+f(xf(y)+f(x+y))=y.\]

1981 Romania Team Selection Tests, 3.

Let $n>r\geqslant 3$ be two integers and $d$ be a positive integer such that $nd\geqslant \dbinom{n+r}{r+1}$. Show that \[(n-t)(d-t)>\dbinom{n-t+r}{r+1},\] for $t=1,2,\ldots,n-1$ [i]Vasile Brânzănescu[/i]

2011 Macedonia National Olympiad, 2

Acute-angled $~$ $\triangle{ABC}$ $~$ is given. A line $~$ $l$ $~$ parallel to side $~$ $AB$ $~$ passing through vertex $~$ $C$ $~$ is drawn. Let the angle bisectors of $~$ $\angle{BAC}$ $~$ and $~$ $\angle{ABC}$ $~$ intersect the sides $~$ $BC$ and $~$ $AC$ at points $~$ $D$ $~$ and $~$ $F$, and line $~$ $l$ $~$ at points $~$ $E$ $~$ and $~$ $G$ $~$ respectively. Prove that if $~$ $\overline{DE}=\overline{GF}$ $~$ then $~$ $\overline{AC}=\overline{BC}\, .$

2016 Romania National Olympiad, 1

Prove that there exists an unique sequence $ \left( c_n \right)_{n\ge 1} $ of real numbers from the interval $ (0,1) $ such that$$ \int_0^1 \frac{dx}{1+x^m} =\frac{1}{1+c_m^m } , $$ for all natural numbers $ m, $ and calculate $ \lim_{k\to\infty } kc_k^k. $ [i]Radu Pop[/i]

2007 USA Team Selection Test, 2

Let $n$ be a positive integer and let $a_1 \le a_2 \le \dots \le a_n$ and $b_1 \le b_2 \le \dots \le b_n$ be two nondecreasing sequences of real numbers such that \[ a_1 + \dots + a_i \le b_1 + \dots + b_i \text{ for every } i = 1, \dots, n \] and \[ a_1 + \dots + a_n = b_1 + \dots + b_n. \] Suppose that for every real number $m$, the number of pairs $(i,j)$ with $a_i-a_j=m$ equals the numbers of pairs $(k,\ell)$ with $b_k-b_\ell = m$. Prove that $a_i = b_i$ for $i=1,\dots,n$.

2015 China Northern MO, 4

It is known that $a_1, a_2,...a_{108}$ are $108$ different positive integers not exceeding $2015$. Prove that there is a positive integer $k$ such that there are at least four different pairs $(i, j) $satisfying $a_i-a_j =k$.

Kvant 2021, M2671

Let $x_1$ and $x_2$ be the roots of the equation $x^2-px+1=0$ where $p>2$ is a prime number. Prove that $x_1^p+x_2^p$ is an integer divisible by $p^2$. [i]From the folklore[/i]

2009 Bundeswettbewerb Mathematik, 4

A positive integer is called [i]decimal palindrome[/i] if its decimal representation $z_n...z_0$ with $z_n\ne 0$ is mirror symmetric, i.e. if $z_k = z_{n-k}$ applies to all $k= 0, ..., n$. Show that each integer that is not divisible by $10$ has a positive multiple, which is a decimal palindrome.

1993 Mexico National Olympiad, 4

$f(n,k)$ is defined by (1) $f(n,0) = f(n,n) = 1$ and (2) $f(n,k) = f(n-1,k-1) + f(n-1,k)$ for $0 < k < n$. How many times do we need to use (2) to find $f(3991,1993)$?