Found problems: 603
In $\triangle ABC$ points $D$, $E$ lie on segment $BC$ where $BD = DE = EC.$ Points $X$, $Y$ lie on the perpendicular bisectors of $AD$, $AE$ respectively. If $XE$, $YD$ are tangent to the circumcircles of $\triangle AEC$, $\triangle ADB$ respectively, prove $X,A,Y$ are collinear.
Find all integers $n\geq 3$ for which every convex equilateral $n$-gon of side length $1$ contains an equilateral triangle of side length $1$. (Here, polygons contain their boundaries.)
Let $ABC$ be an acute-angled triangle with $AC > AB$, let $O$ be its circumcentre, and let $D$ be a point on the segment $BC$. The line through $D$ perpendicular to $BC$ intersects the lines $AO, AC,$ and $AB$ at $W, X,$ and $Y,$ respectively. The circumcircles of triangles $AXY$ and $ABC$ intersect again at $Z \ne A$.
Prove that if $W \ne D$ and $OW = OD,$ then $DZ$ is tangent to the circle $AXY.$
Let $A_1A_2 \dots A_n$ be a polygon (not necessarily regular) with $n$ sides. Suppose there is a translation that maps each point $A_i$ to a point $B_i$ in the same plane. For convenience, define $A_0 = A_n$ and $B_0 = B_n$. Prove that
\[
\sum_{i=1}^{n} (A_{i-1} B_{i})^2 = \sum_{i=1}^{n} (B_{i-1} A_{i})^2 \, .
\]
The numbers $1,\, 2,\, \ldots\, , n^{2}$ are written in the squares of an $n \times n$ board in some order. Initially there is a token on the square labelled with $n^{2}.$ In each step, the token can be moved to any adjacent square (by side). At the beginning, the token is moved to the square labelled with the number $1$ along a path with the minimum number of steps. Then it is moved to the square labelled with $2,$ then to square $3,$ etc, always taking the shortest path, until it returns to the initial square. If the total trip takes $N$ steps, find the smallest and greatest possible values of $N.$
An empty $2020 \times 2020 \times 2020$ cube is given, and a $2020 \times 2020$ grid of square unit cells is drawn on each of its six faces. A [i]beam[/i] is a $1 \times 1 \times 2020$ rectangular prism. Several beams are placed inside the cube subject to the following conditions:
[list=]
[*]The two $1 \times 1$ faces of each beam coincide with unit cells lying on opposite faces of the cube. (Hence, there are $3 \cdot {2020}^2$ possible positions for a beam.)
[*]No two beams have intersecting interiors.
[*]The interiors of each of the four $1 \times 2020$ faces of each beam touch either a face of the cube or the interior of the face of another beam.
[/list]
What is the smallest positive number of beams that can be placed to satisfy these conditions?
[i]Proposed by Alex Zhai[/i]
A closed recticular polygon with 100 sides (may be concave) is given such that it's vertices have integer coordinates, it's sides are parallel to the axis and all it's sides have odd length. Prove that it's area is odd.
Let $ p,q,n$ be three positive integers with $ p \plus{} q < n$. Let $ (x_{0},x_{1},\cdots ,x_{n})$ be an $ (n \plus{} 1)$-tuple of integers satisfying the following conditions :
(a) $ x_{0} \equal{} x_{n} \equal{} 0$, and
(b) For each $ i$ with $ 1\leq i\leq n$, either $ x_{i} \minus{} x_{i \minus{} 1} \equal{} p$ or $ x_{i} \minus{} x_{i \minus{} 1} \equal{} \minus{} q$.
Show that there exist indices $ i < j$ with $ (i,j)\neq (0,n)$, such that $ x_{i} \equal{} x_{j}$.
Let \(n\) be a positive integer and consider an \(n\times n\) square grid. For \(1\le k\le n\), a [i]python[/i] of length \(k\) is a snake that occupies \(k\) consecutive cells in a single row, and no other cells. Similarly, an [i]anaconda[/i] of length \(k\) is a snake that occupies \(k\) consecutive cells in a single column, and no other cells.
The grid contains at least one python or anaconda, and it satisfies the following properties: [list] [*]No cell is occupied by multiple snakes. [*]If a cell in the grid is immediately to the left or immediately to the right of a python, then that cell must be occupied by an anaconda. [*]If a cell in the grid is immediately to above or immediately below an anaconda, then that cell must be occupied by a python. [/list]
Prove that the sum of the squares of the lengths of the snakes is at least \(n^2\).
[i]Proposed by Linus Tang[/i]
What fraction of the Earth's volume lies above the $45$ degrees north parallel? You may assume the Earth is a perfect sphere. The volume in question is the smaller piece that we would get if the sphere were sliced into two pieces by a plane.
There are $2015$ distinct circles in a plane, with radius $1$.
Prove that you can select $27$ circles, which form a set $C$, which satisfy the following.
For two arbitrary circles in $C$, they intersect with each other or
For two arbitrary circles in $C$, they don't intersect with each other.
Cosider ellipse $\epsilon$ with two foci $A$ and $B$ such that the lengths of it's major axis and minor axis are $2a$ and $2b$ respectively. From a point $T$ outside of the ellipse, we draw two tangent lines $TP$ and $TQ$ to the ellipse $\epsilon$. Prove that
\[\frac{TP}{TQ}\ge \frac{b}{a}.\]
[i]Proposed by Morteza Saghafian[/i]
A configuration of $4027$ points in the plane is called Colombian if it consists of $2013$ red points and $2014$ blue points, and no three of the points of the configuration are collinear. By drawing some lines, the plane is divided into several regions. An arrangement of lines is good for a Colombian configuration if the following two conditions are satisfied:
i) No line passes through any point of the configuration.
ii) No region contains points of both colors.
Find the least value of $k$ such that for any Colombian configuration of $4027$ points, there is a good arrangement of $k$ lines.
Proposed by [i]Ivan Guo[/i] from [i]Australia.[/i]
Let $ p$ and $ q$ be relatively prime positive integers. A subset $ S$ of $ \{0, 1, 2, \ldots \}$ is called [b]ideal[/b] if $ 0 \in S$ and for each element $ n \in S,$ the integers $ n \plus{} p$ and $ n \plus{} q$ belong to $ S.$ Determine the number of ideal subsets of $ \{0, 1, 2, \ldots \}.$
Find all integers $n\geq 3$ for which every convex equilateral $n$-gon of side length $1$ contains an equilateral triangle of side length $1$. (Here, polygons contain their boundaries.)
On the coordinate plane, draw a set of points $M(x;y)$, whose coordinates satisfy the equation $$\sqrt{(x - 1)^2+ y^2} +\sqrt{x^2 + (y -1)^2} = \sqrt2.$$
A bug (of negligible size) starts at the origin on the coordinate plane. First, it moves one unit right to $(1,0)$. Then it makes a $90^\circ$ counterclockwise and travels $\frac 12$ a unit to $\left(1, \frac 12 \right)$. If it continues in this fashion, each time making a $90^\circ$ degree turn counterclockwise and traveling half as far as the previous move, to which of the following points will it come closest?
$\text{(A)} \ \left(\frac 23, \frac 23 \right) \qquad \text{(B)} \ \left( \frac 45, \frac 25 \right) \qquad \text{(C)} \ \left( \frac 23, \frac 45 \right) \qquad \text{(D)} \ \left(\frac 23, \frac 13 \right) \qquad \text{(E)} \ \left(\frac 25, \frac 45 \right)$
Let $ABC$ be a triangle with $AB=3$ and $AC=4$. It is given that there does not exist a point $D$, different from $A$ and not lying on line $BC$, such that the Euler line of $ABC$ coincides with the Euler line of $DBC$. The square of the product of all possible lengths of $BC$ can be expressed in the form $m+n\sqrt p$, where $m$, $n$, and $p$ are positive integers and $p$ is not divisible by the square of any prime. Find $100m+10n+p$.
Note: For this problem, consider every line passing through the center of an equilateral triangle to be an Euler line of the equilateral triangle. Hence, if $D$ is chosen such that $DBC$ is an equilateral triangle and the Euler line of $ABC$ passes through the center of $DBC$, then consider the Euler line of $ABC$ to coincide with "the" Euler line of $DBC$.
[i]Proposed by Michael Ren[/i]
Let $n>1$ be an integer. A rook stands in one of the cells of an infinite chessboard that is initially all white. Each move of the rook is exactly $n{}$ cells in a single direction, either vertically or horizontally, and causes the $n{}$ cells passed over by the rook to be painted black. After several such moves, without visiting any cell twice, the rook returns to its starting cell, with the resulting black cells forming a closed path. Prove that the number of white cells inside the black path gives a remainder of $1{}$ when divided by $n{}$.
In a scalene triangle $ABC$, $H$ is the orthocenter, and $G$ is the centroid. Let $A_b$ and $A_c$ be points on $AB$ and $AC$, respectively, such that $B$, $C$, $A_b$, $A_c$ are cyclic, and the points $A_b$, $A_c$, $H$ are collinear. $O_a$ is the circumcenter of the triangle $AA_bA_c$. $O_b$ and $O_c$ are defined similarly. Prove that the centroid of the triangle $O_aO_bO_c$ lies on the line $HG$.
The graphs of a square trinomial and its derivative divide the coordinate plane into four parts. How many roots does this
square trinomial has?
Let $ABC$ be an acute triangle with altitude $\overline{AH}$, and let $P$ be a variable point such that the angle bisectors $k$ and $\ell$ of $\angle PBC$ and $\angle PCB$, respectively, meet on $\overline{AH}$. Let $k$ meet $\overline{AC}$ at $E$, $\ell$ meet $\overline{AB}$ at $F$, and $\overline{EF}$ meet $\overline{AH}$ at $Q$. Prove that as $P$ varies, line $PQ$ passes through a fixed point.
In a rectangular array of points, with 5 rows and $N$ columns, the points are numbered consecutively from left to right beginning with the top row. Thus the top row is numbered 1 through $N,$ the second row is numbered $N+1$ through $2N,$ and so forth. Five points, $P_1, P_2, P_3, P_4,$ and $P_5,$ are selected so that each $P_i$ is in row $i.$ Let $x_i$ be the number associated with $P_i.$ Now renumber the array consecutively from top to bottom, beginning with the first column. Let $y_i$ be the number associated with $P_i$ after the renumbering. It is found that $x_1=y_2,$ $x_2=y_1,$ $x_3=y_4,$ $x_4=y_5,$ and $x_5=y_3.$ Find the smallest possible value of $N.$
Let $ABC$ be an acute triangle with altitude $\overline{AH}$, and let $P$ be a variable point such that the angle bisectors $k$ and $\ell$ of $\angle PBC$ and $\angle PCB$, respectively, meet on $\overline{AH}$. Let $k$ meet $\overline{AC}$ at $E$, $\ell$ meet $\overline{AB}$ at $F$, and $\overline{EF}$ meet $\overline{AH}$ at $Q$. Prove that as $P$ varies, line $PQ$ passes through a fixed point.
A [i]lattice point[/i] is a point in the plane whose two coordinates are both integers. A [i]lattice line[/i] is a line in the plane that contains at least two lattice points. Is it possible to color every lattice point red or blue such that every lattice line contains exactly 2017 red lattice points? Prove that your answer is correct.