Found problems: 800
Find all integers $n\geq 3$ for which the following statement is true: If $\mathcal{P}$ is a convex $n$-gon such that $n-1$ of its sides have equal length and $n-1$ of its angles have equal measure, then $\mathcal{P}$ is a regular polygon. (A [i]regular [/i]polygon is a polygon with all sides of equal length, and all angles of equal measure.)
[i]Proposed by Ivan Borsenco and Zuming Feng[/i]
Let $n$ be a positive integer. Define a chameleon to be any sequence of $3n$ letters, with exactly $n$ occurrences of each of the letters $a, b,$ and $c$. Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon $X$ , there exists a chameleon $Y$ such that $X$ cannot be changed to $Y$ using fewer than $3n^2/2$ swaps.
Determine all integers $m$ for which the $m \times m$ square can be dissected into five rectangles, the side lengths of which are the integers $1,2,3,\ldots,10$ in some order.
Prove that in any set of $2000$ distinct real numbers there exist two pairs $a>b$ and $c>d$ with $a \neq c$ or $b \neq d $, such that \[ \left| \frac{a-b}{c-d} - 1 \right|< \frac{1}{100000}. \]
Graph $G$ has $n$ vertices and $mn$ edges, where $n>2m$, show that there exists a path with $m+1$ vertices.
(A path is an open walk without repeating vertices )
A number is called [i]Norwegian[/i] if it has three distinct positive divisors whose sum is equal to $2022$. Determine the smallest Norwegian number.
(Note: The total number of positive divisors of a Norwegian number is allowed to be larger than $3$.)
Let $n$ be a positive integer. Given is a subset $A$ of $\{0,1,...,5^n\}$ with $4n+2$ elements. Prove that there exist three elements $a<b<c$ from $A$ such that $c+2a>3b$.
[i]Proposed by Dominik Burek and Tomasz Ciesla, Poland[/i]
Does there exist a sequence $ \{b_{i}\}_{i=1}^\infty$ of positive real numbers such that for each natural $ m$: \[ b_{m}+b_{2m}+b_{3m}+\dots=\frac1m\]
Find all positive integers $n$ with the following property: the $k$ positive divisors of $n$ have a permutation $(d_1,d_2,\ldots,d_k)$ such that for $i=1,2,\ldots,k$, the number $d_1+d_2+\cdots+d_i$ is a perfect square.
Let $K$ be the set of all positive integers that do not contain the digit $7$ in their base-$10$ representation. Find all polynomials $f$ with nonnegative integer coefficients such that $f(n)\in K$ whenever $n\in K$.
[i]Proposed by Titu Andreescu, Cosmin Pohoata, and Vlad Matei[/i]
A social network has $2019$ users, some pairs of whom are friends. Whenever user $A$ is friends with user $B$, user $B$ is also friends with user $A$. Events of the following kind may happen repeatedly, one at a time:
[list]
[*] Three users $A$, $B$, and $C$ such that $A$ is friends with both $B$ and $C$, but $B$ and $C$ are not friends, change their friendship statuses such that $B$ and $C$ are now friends, but $A$ is no longer friends with $B$, and no longer friends with $C$. All other friendship statuses are unchanged.
[/list]
Initially, $1010$ users have $1009$ friends each, and $1009$ users have $1010$ friends each. Prove that there exists a sequence of such events after which each user is friends with at most one other user.
[i]Proposed by Adrian Beker, Croatia[/i]
Given any set $S$ of positive integers, show that at least one of the following two assertions holds:
(1) There exist distinct finite subsets $F$ and $G$ of $S$ such that $\sum_{x\in F}1/x=\sum_{x\in G}1/x$;
(2) There exists a positive rational number $r<1$ such that $\sum_{x\in F}1/x\neq r$ for all finite subsets $F$ of $S$.
Find all triples $(a,b,p)$ of positive integers with $p$ prime and \[ a^p=b!+p. \]
Let $n$ be a positive integer. A pair of $n$-tuples $(a_1,\cdots{}, a_n)$ and $(b_1,\cdots{}, b_n)$ with integer entries is called an [i]exquisite pair[/i] if
$$|a_1b_1+\cdots{}+a_nb_n|\le 1.$$
Determine the maximum number of distinct $n$-tuples with integer entries such that any two of them form an exquisite pair.
[i]Pakawut Jiradilok and Warut Suksompong, Thailand[/i]
Let $P$ be a point inside triangle $ABC$. Let $AP$ meet $BC$ at $A_1$, let $BP$ meet $CA$ at $B_1$, and let $CP$ meet $AB$ at $C_1$. Let $A_2$ be the point such that $A_1$ is the midpoint of $PA_2$, let $B_2$ be the point such that $B_1$ is the midpoint of $PB_2$, and let $C_2$ be the point such that $C_1$ is the midpoint of $PC_2$. Prove that points $A_2, B_2$, and $C_2$ cannot all lie strictly inside the circumcircle of triangle $ABC$.
(Australia)
Suppose that $1000$ students are standing in a circle. Prove that there exists an integer $k$ with $100 \leq k \leq 300$ such that in this circle there exists a contiguous group of $2k$ students, for which the first half contains the same number of girls as the second half.
[i]Proposed by Gerhard Wöginger, Austria[/i]
Let $ n$ be a positive integer. Consider
\[ S \equal{} \left\{ (x,y,z) \mid x,y,z \in \{ 0, 1, \ldots, n\}, x \plus{} y \plus{} z > 0 \right \}
\]
as a set of $ (n \plus{} 1)^{3} \minus{} 1$ points in the three-dimensional space. Determine the smallest possible number of planes, the union of which contains $ S$ but does not include $ (0,0,0)$.
[i]Author: Gerhard Wöginger, Netherlands [/i]
In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that
[list]
[*] the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and
[*] every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color.
[/list]
The terms of the sequence $ (a_i)$ defined by $ a_{n \plus{} 2} \equal{} \frac {a_n \plus{} 2009} {1 \plus{} a_{n \plus{} 1}}$ for $ n \ge 1$ are positive integers. Find the minimum possible value of $ a_1 \plus{} a_2$.
Determine all functions $f$ defined on the set of all positive integers and taking non-negative integer values, satisfying the three conditions:
[list]
[*] $(i)$ $f(n) \neq 0$ for at least one $n$;
[*] $(ii)$ $f(x y)=f(x)+f(y)$ for every positive integers $x$ and $y$;
[*] $(iii)$ there are infinitely many positive integers $n$ such that $f(k)=f(n-k)$ for all $k<n$.
[/list]
Let $n \geq 2$ be an integer. Carl has $n$ books arranged on a bookshelf. Each book has a height and a width. No two books have the same height, and no two books have the same width. Initially, the books are arranged in increasing order of height from left to right. In a move, Carl picks any two adjacent books where the left book is wider and shorter than the right book, and swaps their locations. Carl does this repeatedly until no further moves are possible. Prove that regardless of how Carl makes his moves, he must stop after a finite number of moves, and when he does stop, the books are sorted in increasing order of width from left to right.
[i]Proposed by Milan Haiman[/i]
An apple orchard’s layout is a rectangular grid of unit squares. Some pairs of adjacent squares have a thick wall of grape vines between them. The orchard wants to post some robot sentries to guard its prized apple trees. Each sentry occupies a single square of the layout, and from there it can guard both its square and any square in the same row and column that it can see, where only walls and the edges of the orchard block its sight. A sample layout (not the layout of the actual orchard, which is not given) is shown below.
Although a square may be guarded by multiple sentries, the sentries have not been programmed to avoid attacking other sentries. Thus, no sentry may be placed on a square guarded by another sentry. The orchard’s expert has found a way to guard all the squares of the orchard by placing 1000 sentries. However, the contractor shipped 2020 sentries. Show that it is impossible for the orchard to place all 2020 of the sentries without two of them attacking each other.
Let $m,n\geq 2$ be integers. Let $f(x_1,\dots, x_n)$ be a polynomial with real coefficients such that $$f(x_1,\dots, x_n)=\left\lfloor \frac{x_1+\dots + x_n}{m} \right\rfloor\text{ for every } x_1,\dots, x_n\in \{0,1,\dots, m-1\}.$$ Prove that the total degree of $f$ is at least $n$.
For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.
In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that
[list]
[*] the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and
[*] every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color.
[/list]