Found problems: 85335
2007 Greece Junior Math Olympiad, 4
Each of the $50$ students in a class sent greeting cards to $25$ of the others. Prove that there exist two students who greeted each other.
2017 Abels Math Contest (Norwegian MO) Final, 3a
Nils has a telephone number with eight different digits.
He has made $28$ cards with statements of the type “The digit $a$ occurs earlier than the digit $b$ in my telephone number” – one for each pair of digits appearing in his number.
How many cards can Nils show you without revealing his number?
2014 Contests, 3
Fix positive integers $m$ and $n$. Suppose that $a_1, a_2, \dots, a_m$ are reals, and that pairwise distinct vectors $v_1, \dots, v_m\in \mathbb{R}^n$ satisfy $$\sum_{j\neq i} a_j \frac{v_j-v_i}{||v_j-v_i||^3}=0$$ for $i=1,2,\dots,m$.
Prove that $$\sum_{1\le i<j\le m} \frac{a_ia_j}{||v_j-v_i||}=0.$$
2016 Saudi Arabia IMO TST, 1
Let $ n \geq 3 $ be an integer and let
\begin{align*}
x_1,x_2, \ldots, x_n
\end{align*}
be $ n $ distinct integers. Prove that
\begin{align*}
(x_1 - x_2)^2 + (x_2 - x_3)^2 + \ldots + (x_n - x_1)^2 \geq 4n - 6.
\end{align*}
2011 Princeton University Math Competition, A1 / B2
Consider the sum $\overline{a b} + \overline{ c d e}$, where each of the letters is a distinct digit between $1$ and $5$. How many values are possible for this sum?
1966 IMO Shortlist, 4
Given $5$ points in the plane, no three of them being collinear. Show that among these $5$ points, we can always find $4$ points forming a convex quadrilateral.
2014 Middle European Mathematical Olympiad, 2
Determine all functions $f : \mathbb{R} \to \mathbb{R}$ such that
\[ xf(xy) + xyf(x) \ge f(x^2)f(y) + x^2y \]
holds for all $x,y \in \mathbb{R}$.
2009 AIME Problems, 10
Four lighthouses are located at points $ A$, $ B$, $ C$, and $ D$. The lighthouse at $ A$ is $ 5$ kilometers from the lighthouse at $ B$, the lighthouse at $ B$ is $ 12$ kilometers from the lighthouse at $ C$, and the lighthouse at $ A$ is $ 13$ kilometers from the lighthouse at $ C$. To an observer at $ A$, the angle determined by the lights at $ B$ and $ D$ and the angle determined by the lights at $ C$ and $ D$ are equal. To an observer at $ C$, the angle determined by the lights at $ A$ and $ B$ and the angle determined by the lights at $ D$ and $ B$ are equal. The number of kilometers from $ A$ to $ D$ is given by $ \displaystyle\frac{p\sqrt{r}}{q}$, where $ p$, $ q$, and $ r$ are relatively prime positive integers, and $ r$ is not divisible by the square of any prime. Find $ p\plus{}q\plus{}r$,
2000 National Olympiad First Round, 9
$ABCDE$ is convex pentagon. $m(\widehat{B})=m(\widehat{D})=90^\circ$, $m(\widehat{C})=120^\circ$, $|AB|=2$, $|BC|=|CD|=\sqrt3$, and $|ED|=1$. $|AE|=?$
$ \textbf{(A)}\ \frac{3\sqrt3}{2}
\qquad\textbf{(B)}\ \frac{2\sqrt3}{3}
\qquad\textbf{(C)}\ \frac{3}{2}
\qquad\textbf{(D)}\ \sqrt3 - 1
\qquad\textbf{(E)}\ \sqrt3
$
1982 Tournament Of Towns, (026) 4
(a) $10$ points dividing a circle into $10$ equal arcs are connected in pairs by $5$ chords.
Is it necessary that two of these chords are of equal length?
(b) $20$ points dividing a circle into $20$ equal arcs are connected in pairs by $10$ chords.
Prove that among these $10$ chords there are two chords of equal length.
(VV Proizvolov, Moscow)
2020 JBMO Shortlist, 5
The positive integer $k$ and the set $A$ of distinct integers from $1$ to $3k$ inclusively are such that there are no distinct $a$, $b$, $c$ in $A$ satisfying $2b = a + c$. The numbers from $A$ in the interval $[1, k]$ will be called [i]small[/i]; those in $[k + 1, 2k]$ - [i]medium[/i] and those in $[2k + 1, 3k]$ - [i]large[/i]. It is always true that there are [b]no[/b] positive integers $x$ and $d$ such that if $x$, $x + d$, and $x + 2d$ are divided by $3k$ then the remainders belong to $A$ and those of $x$ and $x + d$ are different and are:
a) small? $\hspace{1.5px}$ b) medium? $\hspace{1.5px}$ c) large?
([i]In this problem we assume that if a multiple of $3k$ is divided by $3k$ then the remainder is $3k$ rather than $0$[/i].)
2009 Switzerland - Final Round, 2
A [i]palindrome [/i] is a natural number that works in the decimal system forwards and backwards read is the same size (e.g. $1129211$ or $7337$). Determine all pairs $(m, n)$ of natural numbers, such that
$$(\underbrace{11... 11}_{m}) \cdot (\underbrace{11... 11}_{n})$$ is a palindrome.
2018 Azerbaijan IMO TST, 3
Find the smallest positive integer $n$ or show no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $(a_1, a_2, \ldots, a_n)$ such that both
$$a_1+a_2+\dots +a_n \quad \text{and} \quad \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_n}$$
are integers.
2021 Honduras National Mathematical Olympiad, Problem 5
A positive integer $m$ is called [i]growing[/i] if its digits, read from left to right, are non-increasing. Prove that for each natural number $n$ there exists a growing number $m$ with $n$ digits such that the sum of its digits is a perfect square.
2016 AMC 12/AHSME, 8
What is the area of the shaded region of the given $8 \times 5$ rectangle?
[asy]
size(6cm);
defaultpen(fontsize(9pt));
draw((0,0)--(8,0)--(8,5)--(0,5)--cycle);
filldraw((7,0)--(8,0)--(8,1)--(0,4)--(0,5)--(1,5)--cycle,gray(0.8));
label("$1$",(1/2,5),dir(90));
label("$7$",(9/2,5),dir(90));
label("$1$",(8,1/2),dir(0));
label("$4$",(8,3),dir(0));
label("$1$",(15/2,0),dir(270));
label("$7$",(7/2,0),dir(270));
label("$1$",(0,9/2),dir(180));
label("$4$",(0,2),dir(180));
[/asy]
$\textbf{(A)}\ 4\dfrac{3}{5} \qquad \textbf{(B)}\ 5\qquad \textbf{(C)}\ 5\dfrac{1}{4} \qquad \textbf{(D)}\ 6\dfrac{1}{2} \qquad \textbf{(E)}\ 8$
1958 Czech and Slovak Olympiad III A, 3
Find all real $x$ such that $$\sqrt{2+\frac{5}{2}\cos x}\leq\sin x.$$
2009 Korea Junior Math Olympiad, 3
For two arbitrary reals $x, y$ which are larger than $0$ and less than $1.$ Prove that$$\frac{x^2}{x+y}+\frac{y^2}{1-x}+\frac{(1-x-y)^2}{1-y}\geq\frac{1}{2}.$$
2012 Peru IMO TST, 1
Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a function such that $$\displaystyle{f(f(x)) = \frac{x^2 - x}{2}\cdot f(x) + 2-x,}$$ for all $x \in \mathbb{R}.$ Find all possible values of $f(2).$
2015 HMNT, 9
Rosencrantz plays $n \leq 2015$ games of question, and ends up with a win rate $\left(\text{i.e.}\: \frac{\text{\# of games won}}{\text{\# of games played}}\right)$ of $k$. Guildenstern has also played several games, and has a win rate less than $k$. He realizes that if, after playing some more games, his win rate becomes higher than $k$, then there must have been some point in time when Rosencrantz and Guildenstern had the exact same win-rate. Find the product of all possible values of $k$.
1979 IMO Shortlist, 22
Two circles in a plane intersect. $A$ is one of the points of intersection. Starting simultaneously from $A$ two points move with constant speed, each travelling along its own circle in the same sense. The two points return to $A$ simultaneously after one revolution. Prove that there is a fixed point $P$ in the plane such that the two points are always equidistant from $P.$
III Soros Olympiad 1996 - 97 (Russia), 9.2
How many solutions, depending on the value of the parameter $a$, has the equation $$\sqrt{x^2-4}+\sqrt{2x^2-7x+5}=a ?$$
2009 AMC 12/AHSME, 10
In quadrilateral $ ABCD$, $ AB \equal{} 5$, $ BC \equal{} 17$, $ CD \equal{} 5$, $ DA \equal{} 9$, and $ BD$ is an integer. What is $ BD$?
[asy]unitsize(4mm);
defaultpen(linewidth(.8pt)+fontsize(8pt));
dotfactor=4;
pair C=(0,0), B=(17,0);
pair D=intersectionpoints(Circle(C,5),Circle(B,13))[0];
pair A=intersectionpoints(Circle(D,9),Circle(B,5))[0];
pair[] dotted={A,B,C,D};
draw(D--A--B--C--D--B);
dot(dotted);
label("$D$",D,NW);
label("$C$",C,W);
label("$B$",B,E);
label("$A$",A,NE);[/asy]$ \textbf{(A)}\ 11 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 13 \qquad \textbf{(D)}\ 14 \qquad \textbf{(E)}\ 15$
2001 Portugal MO, 6
Let $n$ be a natural number. Prove that there is a multiple of $n$ that can be written only with the digits $0$ and $1$.
2020 Jozsef Wildt International Math Competition, W48
Let $ABC$ be a triangle such that
$$S^2=2R^2+8Rr+3r^2$$
Then prove that $\frac Rr=2$ or $\frac Rr\ge\sqrt2+1$.
[i]Proposed by Marian Cucoanoeş and Marius Drăgan[/i]
2001 Canada National Olympiad, 2
There is a board numbered $-10$ to $10$. Each square is coloured either red or white, and the sum of the numbers on the red squares is $n$. Maureen starts with a token on the square labeled $0$. She then tosses a fair coin ten times. Every time she flips heads, she moves the token one square to the right. Every time she flips tails, she moves the token one square to the left. At the end of the ten flips, the probability that the token finishes on a red square is a rational number of the form $\frac a b$. Given that $a + b = 2001$, determine the largest possible value for $n$.