Found problems: 396
2012 China Team Selection Test, 2
Prove that there exists a positive real number $C$ with the following property: for any integer $n\ge 2$ and any subset $X$ of the set $\{1,2,\ldots,n\}$ such that $|X|\ge 2$, there exist $x,y,z,w \in X$(not necessarily distinct) such that
\[0<|xy-zw|<C\alpha ^{-4}\]
where $\alpha =\frac{|X|}{n}$.
2015 Czech and Slovak Olympiad III A, 6
Integer $n>2$ is given. Find the biggest integer $d$, for which holds, that from any set $S$ consisting of $n$ integers, we can find three different (but not necesarilly disjoint) nonempty subsets, such that sum of elements of each of them is divisible by $d$.
2015 Purple Comet Problems, 8
Gwendoline rolls a pair of six-sided dice and records the product of the two values rolled. Gwendoline
repeatedly rolls the two dice and records the product of the two values until one of the values she records
appears for a third time. What is the maximum number of times Gwendoline will need to roll the two dice?
1988 USAMO, 3
A function $f(S)$ assigns to each nine-element subset of $S$ of the set $\{1,2,\ldots, 20\}$ a whole number from $1$ to $20$. Prove that regardless of how the function $f$ is chosen, there will be a ten-element subset $T\subset\{1,2,\ldots, 20\}$ such that $f(T - \{k\})\neq k$ for all $k\in T$.
2002 USA Team Selection Test, 4
Let $n$ be a positive integer and let $S$ be a set of $2^n+1$ elements. Let $f$ be a function from the set of two-element subsets of $S$ to $\{0, \dots, 2^{n-1}-1\}$. Assume that for any elements $x, y, z$ of $S$, one of $f(\{x,y\}), f(\{y,z\}), f(\{z, x\})$ is equal to the sum of the other two. Show that there exist $a, b, c$ in $S$ such that $f(\{a,b\}), f(\{b,c\}), f(\{c,a\})$ are all equal to 0.
2008 Romanian Master of Mathematics, 4
Consider a square of sidelength $ n$ and $ (n\plus{}1)^2$ interior points. Prove that we can choose $ 3$ of these points so that they determine a triangle (eventually degenerated) of area at most $ \frac12$.
2012 ELMO Shortlist, 5
Prove that if $m,n$ are relatively prime positive integers, $x^m-y^n$ is irreducible in the complex numbers. (A polynomial $P(x,y)$ is irreducible if there do not exist nonconstant polynomials $f(x,y)$ and $g(x,y)$ such that $P(x,y) = f(x,y)g(x,y)$ for all $x,y$.)
[i]David Yang.[/i]
2009 USAMO, 2
Let $n$ be a positive integer. Determine the size of the largest subset of $\{ -n, -n+1, \dots, n-1, n\}$ which does not contain three elements $a$, $b$, $c$ (not necessarily distinct) satisfying $a+b+c=0$.
1961 AMC 12/AHSME, 39
Any five points are taken inside or on a square with side length $1$. Let $a$ be the [i]smallest[/i] possible number with the property that it is always possible to select one pair of points from these five such that the distance between them is equal to or less than $a$. Then $a$ is:
${{ \textbf{(A)}\ \sqrt{3}/3 \qquad\textbf{(B)}\ \sqrt{2}/2 \qquad\textbf{(C)}\ 2\sqrt{2}/3 \qquad\textbf{(D)}\ 1 }\qquad\textbf{(E)}\ \sqrt{2} } $
2011 AMC 10, 11
There are $52$ people in a room. What is the largest value of $n$ such that the statement "At least $n$ people in this room have birthdays falling in the same month" is always true?
$ \textbf{(A)}\ 2 \qquad
\textbf{(B)}\ 3 \qquad
\textbf{(C)}\ 4 \qquad
\textbf{(D)}\ 5 \qquad
\textbf{(E)}\ 12 $
2021 Cyprus JBMO TST, 4
We colour every square of a $4\times 19$ chess board with one of the colours red, green and blue. Prove that however this colouring is done, we can always find two horizontal rows and two vertical columns such that the $4$ squares on the intersections of these lines all have the same colour.
2022 Estonia Team Selection Test, 4
Let $n\ge 3$ be a fixed integer. There are $m\ge n+1$ beads on a circular necklace. You wish to paint the beads using $n$ colors, such that among any $n+1$ consecutive beads every color appears at least once. Find the largest value of $m$ for which this task is $\emph{not}$ possible.
[i]Carl Schildkraut, USA[/i]
2012 USA TSTST, 1
Find all infinite sequences $a_1, a_2, \ldots$ of positive integers satisfying the following properties:
(a) $a_1 < a_2 < a_3 < \cdots$,
(b) there are no positive integers $i$, $j$, $k$, not necessarily distinct, such that $a_i+a_j=a_k$,
(c) there are infinitely many $k$ such that $a_k = 2k-1$.
2013 ELMO Shortlist, 3
Let $a_1,a_2,...,a_9$ be nine real numbers, not necessarily distinct, with average $m$. Let $A$ denote the number of triples $1 \le i < j < k \le 9$ for which $a_i + a_j + a_k \ge 3m$. What is the minimum possible value of $A$?
[i]Proposed by Ray Li[/i]
2007 Singapore MO Open, 1
Let $x_1,x_2,\ldots,x_n$ be real numbers satisfying $x_1^2+x_2^2+\ldots+x_n^2=1$. Prove that for every integer $k\ge2$ there are integers $a_1,a_2,\ldots,a_n$, not all zero, such that $|a_i|\le k-1$ for all $i$, and $|a_1x_1+a_2x_2+\ldots+a_nx_n|\le{(k-1)\sqrt n\over k^n-1}$.
2009 Argentina Team Selection Test, 1
On a $ 50 \times 50$ board, the centers of several unit squares are colored black. Find the maximum number of centers that can be colored black in such a way that no three black points form a right-angled triangle.
1993 IberoAmerican, 2
Let $P$ and $Q$ be two distinct points in the plane. Let us denote by $m(PQ)$ the segment bisector of $PQ$. Let $S$ be a finite subset of the plane, with more than one element, that satisfies the following properties:
(i) If $P$ and $Q$ are in $S$, then $m(PQ)$ intersects $S$.
(ii) If $P_1Q_1, P_2Q_2, P_3Q_3$ are three diferent segments such that its endpoints are points of $S$, then, there is non point in $S$ such that it intersects the three lines $m(P_1Q_1)$, $m(P_2Q_2)$, and $m(P_3Q_3)$.
Find the number of points that $S$ may contain.
1985 IberoAmerican, 2
To each positive integer $ n$ it is assigned a non-negative integer $f(n)$ such that the following conditions are satisfied:
(1) $ f(rs) \equal{} f(r)\plus{}f(s)$
(2) $ f(n) \equal{} 0$, if the first digit (from right to left) of $ n$ is 3.
(3) $ f(10) \equal{} 0$.
Find $f(1985)$. Justify your answer.
2011 Romania Team Selection Test, 2
Prove that the set $S=\{\lfloor n\pi\rfloor \mid n=0,1,2,3,\ldots\}$ contains arithmetic progressions of any finite length, but no infinite arithmetic progressions.
[i]Vasile Pop[/i]
2005 USAMO, 5
Let $n$ be an integer greater than 1. Suppose $2n$ points are given in the plane, no three of which are collinear. Suppose $n$ of the given $2n$ points are colored blue and the other $n$ colored red. A line in the plane is called a [i]balancing line[/i] if it passes through one blue and one red point and, for each side of the line, the number of blue points on that side is equal to the number of red points on the same side.
Prove that there exist at least two balancing lines.
2004 Romania National Olympiad, 4
Let $\mathcal U = \left\{ \left( x,y \right) | x,y \in \mathbb Z, \ 0 \leq x,y < 4 \right\}$.
(a) Prove that we can choose $6$ points from $\mathcal U$ such that there are no isosceles triangles with the vertices among the chosen points.
(b) Prove that no matter how we choose $7$ points from $\mathcal U$, there are always three which form an isosceles triangle.
[i]Radu Gologan, Dinu Serbanescu[/i]