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: 892

2001 IMO, 3

Twenty-one girls and twenty-one boys took part in a mathematical competition. It turned out that each contestant solved at most six problems, and for each pair of a girl and a boy, there was at least one problem that was solved by both the girl and the boy. Show that there is a problem that was solved by at least three girls and at least three boys.

1977 Germany Team Selection Test, 1

We consider two sequences of real numbers $x_{1} \geq x_{2} \geq \ldots \geq x_{n}$ and $\ y_{1} \geq y_{2} \geq \ldots \geq y_{n}.$ Let $z_{1}, z_{2}, .\ldots, z_{n}$ be a permutation of the numbers $y_{1}, y_{2}, \ldots, y_{n}.$ Prove that $\sum \limits_{i=1}^{n} ( x_{i} -\ y_{i} )^{2} \leq \sum \limits_{i=1}^{n}$ $( x_{i} - z_{i})^{2}.$

1970 IMO Longlists, 18

Find all positive integers $n$ such that the set $\{n,n+1,n+2,n+3,n+4,n+5\}$ can be partitioned into two subsets so that the product of the numbers in each subset is equal.

2005 IMO Shortlist, 1

Determine all positive integers relatively prime to all the terms of the infinite sequence \[ a_n=2^n+3^n+6^n -1,\ n\geq 1. \]

1998 IMO, 2

In a contest, there are $m$ candidates and $n$ judges, where $n\geq 3$ is an odd integer. Each candidate is evaluated by each judge as either pass or fail. Suppose that each pair of judges agrees on at most $k$ candidates. Prove that \[{\frac{k}{m}} \geq {\frac{n-1}{2n}}. \]

1998 IMO Shortlist, 5

Determine the least possible value of $f(1998),$ where $f:\Bbb{N}\to \Bbb{N}$ is a function such that for all $m,n\in {\Bbb N}$, \[f\left( n^{2}f(m)\right) =m\left( f(n)\right) ^{2}. \]

1973 IMO, 1

Prove that the sum of an odd number of vectors of length 1, of common origin $O$ and all situated in the same semi-plane determined by a straight line which goes through $O,$ is at least 1.

2021 IMO, 5

Two squirrels, Bushy and Jumpy, have collected 2021 walnuts for the winter. Jumpy numbers the walnuts from 1 through 2021, and digs 2021 little holes in a circular pattern in the ground around their favourite tree. The next morning Jumpy notices that Bushy had placed one walnut into each hole, but had paid no attention to the numbering. Unhappy, Jumpy decides to reorder the walnuts by performing a sequence of 2021 moves. In the $k$-th move, Jumpy swaps the positions of the two walnuts adjacent to walnut $k$. Prove that there exists a value of $k$ such that, on the $k$-th move, Jumpy swaps some walnuts $a$ and $b$ such that $a<k<b$.

2014 Contests, 1

Let $a_0 < a_1 < a_2 < \dots$ be an infinite sequence of positive integers. Prove that there exists a unique integer $n\geq 1$ such that \[a_n < \frac{a_0+a_1+a_2+\cdots+a_n}{n} \leq a_{n+1}.\] [i]Proposed by Gerhard Wöginger, Austria.[/i]

1962 IMO, 1

Find the smallest natural number $n$ which has the following properties: a) Its decimal representation has a 6 as the last digit. b) If the last digit 6 is erased and placed in front of the remaining digits, the resulting number is four times as large as the original number $n$.

2002 IMO Shortlist, 6

Find all pairs of positive integers $m,n\geq3$ for which there exist infinitely many positive integers $a$ such that \[ \frac{a^m+a-1}{a^n+a^2-1} \] is itself an integer. [i]Laurentiu Panaitopol, Romania[/i]

2006 IMO, 4

Determine all pairs $(x, y)$ of integers such that \[1+2^{x}+2^{2x+1}= y^{2}.\]

1989 IMO, 1

Prove that in the set $ \{1,2, \ldots, 1989\}$ can be expressed as the disjoint union of subsets $ A_i, \{i \equal{} 1,2, \ldots, 117\}$ such that [b]i.)[/b] each $ A_i$ contains 17 elements [b]ii.)[/b] the sum of all the elements in each $ A_i$ is the same.

2009 IMO Shortlist, 3

Determine all functions $ f$ from the set of positive integers to the set of positive integers such that, for all positive integers $ a$ and $ b$, there exists a non-degenerate triangle with sides of lengths \[ a, f(b) \text{ and } f(b \plus{} f(a) \minus{} 1).\] (A triangle is non-degenerate if its vertices are not collinear.) [i]Proposed by Bruno Le Floch, France[/i]

1996 IMO Shortlist, 2

Let $ P$ be a point inside a triangle $ ABC$ such that \[ \angle APB \minus{} \angle ACB \equal{} \angle APC \minus{} \angle ABC. \] Let $ D$, $ E$ be the incenters of triangles $ APB$, $ APC$, respectively. Show that the lines $ AP$, $ BD$, $ CE$ meet at a point.

1981 IMO, 3

The function $f(x,y)$ satisfies: $f(0,y)=y+1, f(x+1,0) = f(x,1), f(x+1,y+1)=f(x,f(x+1,y))$ for all non-negative integers $x,y$. Find $f(4,1981)$.

1973 IMO Shortlist, 6

Establish if there exists a finite set $M$ of points in space, not all situated in the same plane, so that for any straight line $d$ which contains at least two points from M there exists another straight line $d'$, parallel with $d,$ but distinct from $d$, which also contains at least two points from $M$.

1974 IMO, 6

Let $P(x)$ be a polynomial with integer coefficients. We denote $\deg(P)$ its degree which is $\geq 1.$ Let $n(P)$ be the number of all the integers $k$ for which we have $(P(k))^{2}=1.$ Prove that $n(P)- \deg(P) \leq 2.$

1993 IMO, 1

Let $n > 1$ be an integer and let $f(x) = x^n + 5 \cdot x^{n-1} + 3.$ Prove that there do not exist polynomials $g(x),h(x),$ each having integer coefficients and degree at least one, such that $f(x) = g(x) \cdot h(x).$

1962 IMO, 3

Consider the cube $ABCDA'B'C'D'$ ($ABCD$ and $A'B'C'D'$ are the upper and lower bases, repsectively, and edges $AA', BB', CC', DD'$ are parallel). The point $X$ moves at a constant speed along the perimeter of the square $ABCD$ in the direction $ABCDA$, and the point $Y$ moves at the same rate along the perimiter of the square $B'C'CB$ in the direction $B'C'CBB'$. Points $X$ and $Y$ begin their motion at the same instant from the starting positions $A$ and $B'$, respectively. Determine and draw the locus of the midpionts of the segments $XY$.

2009 IMO Shortlist, 7

Let $ a_1, a_2, \ldots , a_n$ be distinct positive integers and let $ M$ be a set of $ n \minus{} 1$ positive integers not containing $ s \equal{} a_1 \plus{} a_2 \plus{} \ldots \plus{} a_n.$ A grasshopper is to jump along the real axis, starting at the point $ 0$ and making $ n$ jumps to the right with lengths $ a_1, a_2, \ldots , a_n$ in some order. Prove that the order can be chosen in such a way that the grasshopper never lands on any point in $ M.$ [i]Proposed by Dmitry Khramtsov, Russia[/i]

2013 IMO Shortlist, N2

Assume that $k$ and $n$ are two positive integers. Prove that there exist positive integers $m_1 , \dots , m_k$ such that \[1+\frac{2^k-1}{n}=\left(1+\frac1{m_1}\right)\cdots \left(1+\frac1{m_k}\right).\] [i]Proposed by Japan[/i]

2008 IMO, 2

[b](a)[/b] Prove that \[\frac {x^{2}}{\left(x \minus{} 1\right)^{2}} \plus{} \frac {y^{2}}{\left(y \minus{} 1\right)^{2}} \plus{} \frac {z^{2}}{\left(z \minus{} 1\right)^{2}} \geq 1\] for all real numbers $x$, $y$, $z$, each different from $1$, and satisfying $xyz=1$. [b](b)[/b] Prove that equality holds above for infinitely many triples of rational numbers $x$, $y$, $z$, each different from $1$, and satisfying $xyz=1$. [i]Author: Walther Janous, Austria[/i]

1985 IMO, 3

For any polynomial $P(x)=a_0+a_1x+\ldots+a_kx^k$ with integer coefficients, the number of odd coefficients is denoted by $o(P)$. For $i-0,1,2,\ldots$ let $Q_i(x)=(1+x)^i$. Prove that if $i_1,i_2,\ldots,i_n$ are integers satisfying $0\le i_1<i_2<\ldots<i_n$, then: \[ o(Q_{i_1}+Q_{i_2}+\ldots+Q_{i_n})\ge o(Q_{i_1}). \]

1984 IMO Shortlist, 14

Let $ABCD$ be a convex quadrilateral with the line $CD$ being tangent to the circle on diameter $AB$. Prove that the line $AB$ is tangent to the circle on diameter $CD$ if and only if the lines $BC$ and $AD$ are parallel.