Found problems: 603
On the coordinate plane, at some points with integer coordinates, there is a pebble (a finite number of pebbles). It is allowed to make the following move: select a pair of pebbles, take some vector $\vec{a}$ with integer coordinates and then move one of the selected pebbles to vector $\vec{a}$, and the other to the opposite vector $-\vec{a}$; it is forbidden that there should be more than one pebble at one point. Is it always possible to achieve a situation in which all the pebbles lie on the same straight line in a few moves?
[i] K. Ivanov [/i]
Every point with integer coordinates in the plane is the center of a disk with radius $1/1000$.
(1) Prove that there exists an equilateral triangle whose vertices lie in different discs.
(2) Prove that every equilateral triangle with vertices in different discs has side-length greater than $96$.
[i]Radu Gologan, Romania[/i]
[hide="Remark"]
The "> 96" in [b](b)[/b] can be strengthened to "> 124". By the way, part [b](a)[/b] of this problem is the place where I used [url=http://mathlinks.ro/viewtopic.php?t=5537]the well-known "Dedekind" theorem[/url].
[/hide]
Let $ABC$ be a fixed acute triangle inscribed in a circle $\omega$ with center $O$. A variable point $X$ is chosen on minor arc $AB$ of $\omega$, and segments $CX$ and $AB$ meet at $D$. Denote by $O_1$ and $O_2$ the circumcenters of triangles $ADX$ and $BDX$, respectively. Determine all points $X$ for which the area of triangle $OO_1O_2$ is minimized.
[i]Proposed by Zuming Feng[/i]
Given six real numbers $a$, $b$, $c$, $x$, $y$, $z$ such that $0 < b-c < a < b+c$ and $ax + by + cz = 0$.
What is the sign of the sum $ayz + bzx + cxy$ ?
Let $m$ and $n$ be positive integers greater than $1$. In each unit square of an $m\times n$ grid lies a coin with its tail side up. A [i]move[/i] consists of the following steps.
[list=1]
[*]select a $2\times 2$ square in the grid;
[*]flip the coins in the top-left and bottom-right unit squares;
[*]flip the coin in either the top-right or bottom-left unit square.
[/list]
Determine all pairs $(m,n)$ for which it is possible that every coin shows head-side up after a finite number of moves.
[i]Thanasin Nampaisarn, Thailand[/i]
In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements.
[i]Proposed by Jorge Tipe, Peru[/i]
In an isosceles right-angled triangle shaped billiards table , a ball starts moving from one of the vertices adjacent to hypotenuse. When it reaches to one side then it will reflect its path. Prove that if we reach to a vertex then it is not the vertex at initial position
[i]By Sam Nariman[/i]
Let $ABC$ be a triangle with $\angle{A}=90^{\circ}$ and $AB<AC$. Let $AD$ be the altitude from $A$ on to $BC$, Let $P,Q$ and $I$ denote respectively the incentres of triangle $ABD,ACD$ and $ABC$. Prove that $AI$ is perpendicular to $PQ$ and $AI=PQ$.
Let us consider a triangle $\Delta{PQR}$ in the co-ordinate plane. Show for every function $f: \mathbb{R}^2\to \mathbb{R}\;,f(X)=ax+by+c$ where $X\equiv (x,y) \text{ and } a,b,c\in\mathbb{R}$ and every point $A$ on $\Delta PQR$ or inside the triangle we have the inequality:
\begin{align*} & f(A)\le \text{max}\{f(P),f(Q),f(R)\} \end{align*}
Triangle $ABC$ has side lengths $AB=231$, $BC=160$, and $AC=281$. Point $D$ is constructed on the opposite side of line $AC$ as point $B$ such that $AD=178$ and $CD=153$. Compute the distance from $B$ to the midpoint of segment $AD$.
Every cell of a $2017\times 2017$ grid is colored either black or white, such that every cell has at least one side in common with another cell of the same color. Let $V_1$ be the set of all black cells, $V_2$ be the set of all white cells. For set $V_i (i=1,2)$, if two cells share a common side, draw an edge with the centers of the two cells as endpoints, obtaining graphs $G_i$. If both $G_1$ and $G_2$ are connected paths (no cycles, no splits), prove that the center of the grid is one of the endpoints of $G_1$ or $G_2$.
A line $d$ is given in the plane. Let $B\in d$ and $A$ another point, not on $d$, and such that $AB$ is not perpendicular on $d$. Let $\omega$ be a variable circle touching $d$ at $B$ and letting $A$ outside, and $X$ and $Y$ the points on $\omega$ such that $AX$ and $AY$ are tangent to the circle. Prove that the line $XY$ passes through a fixed point.
[i]Proposed by F. Bakharev [/i]
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.$
Consider the points of intersection of the graphs $y = \cos x$ and $x = 100 \cos (100y)$ for which both coordinates are positive. Let $a$ be the sum of their $x$-coordinates and $b$ be the sum of their $y$-coordinates. Determine the value of $\frac{a}{b}$.
Determine, with proof, whether or not there exists a [i]non-isosceles[/i] trapezoid $ABCD$ such that the lengths $AC$ and $BD$ both lie in the set $\{ DA+AB, AB+BC, BC+CD, CD+DA, AB+CD, BC+DA \}$.
Let $ C$ be the circle with radius 1 centered on the origin. Fix the endpoint of the string with length $ 2\pi$ on the point $ A(1,\ 0)$ and put the other end point $ P$ on the point $ P_0(1,\ 2\pi)$. From this situation, when we twist the string around $ C$ by moving the point $ P$ in anti clockwise with the string streched tightly, find the length of the curve that the point $ P$ draws from sarting point $ P_0$ to reaching point $ A$.
Let $EFGH$, $EFDC$, and $EHBC$ be three adjacent square faces of a cube, for which $EC=8$, and let $A$ be the eighth vertex of the cube. Let $I$, $J$, and $K$, be the points on $\overline{EF}$, $\overline{EH}$, and $\overline{EC}$, respectively, so that $EI=EJ=EK=2$. A solid $S$ is obtained by drilling a tunnel through the cube. The sides of the tunnel are planes parallel to $\overline{AE}$, and containing the edges, $\overline{IJ}$, $\overline{JK}$, and $\overline{KI}$. The surface area of $S$, including the walls of the tunnel, is $m+n\sqrt{p}$, where $m$, $n$, and $p$ are positive integers and $p$ is not divisible by the square of any prime. Find $m+n+p$.
Let $n \geq 2$ be an integer. An $n \times n$ board is initially empty. Each minute, you may perform one of three moves:
[list]
[*] If there is an L-shaped tromino region of three cells without stones on the board (see figure; rotations not allowed), you may place a stone in each of those cells.
[*] If all cells in a column have a stone, you may remove all stones from that column.
[*] If all cells in a row have a stone, you may remove all stones from that row.
[/list]
[asy]
unitsize(20);
draw((0,0)--(4,0)--(4,4)--(0,4)--(0,0));
fill((0.2,3.8)--(1.8,3.8)--(1.8, 1.8)--(3.8, 1.8)--(3.8, 0.2)--(0.2, 0.2)--cycle, grey);
draw((0.2,3.8)--(1.8,3.8)--(1.8, 1.8)--(3.8, 1.8)--(3.8, 0.2)--(0.2, 0.2)--(0.2, 3.8), linewidth(2));
draw((0,2)--(4,2));
draw((2,4)--(2,0));
[/asy]
For which $n$ is it possible that, after some non-zero number of moves, the board has no stones?
Let $\Gamma$ be a circle in the plane and $S$ be a point on $\Gamma$. Mario and Luigi drive around the circle $\Gamma$ with their go-karts. They both start at $S$ at the same time. They both drive for exactly $6$ minutes at constant speed counterclockwise around the circle. During these $6$ minutes, Luigi makes exactly one lap around $\Gamma$ while Mario, who is three times as fast, makes three laps.
While Mario and Luigi drive their go-karts, Princess Daisy positions herself such that she is always exactly in the middle of the chord between them. When she reaches a point she has already visited, she marks it with a banana.
How many points in the plane, apart from $S$, are marked with a banana by the end of the $6$ minutes.
In the coordinate plane, find the area of the region bounded by the curve $ C: y\equal{}\frac{x\plus{}1}{x^2\plus{}1}$ and the line $ L: y\equal{}1$.
Which of the following sets could NOT be the lengths of the external diagonals of a right rectangular prism [a "box"]? (An [i]external diagonal[/i] is a diagonal of one of the rectangular faces of the box.)
$ \textbf{(A)}\ \{4, 5, 6\} \qquad\textbf{(B)}\ \{4, 5, 7\} \qquad\textbf{(C)}\ \{4, 6, 7\} \qquad\textbf{(D)}\ \{5, 6, 7\} \qquad\textbf{(E)}\ \{5, 7, 8\} $
Describe the amount of points $P(x, y)$ that are twice as far apart $A(3, 0)$ as to $0(0, 0)$.
In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements.
[i]Proposed by Jorge Tipe, Peru[/i]
A dartboard is the region B in the coordinate plane consisting of points $(x, y)$ such that $|x| + |y| \le 8$. A target T is the region where $(x^2 + y^2 - 25)^2 \le 49$. A dart is thrown at a random point in B. The probability that the dart lands in T can be expressed as $\frac{m}{n} \pi$, where $m$ and $n$ are relatively prime positive integers. What is $m + n$?
$
\textbf{(A) }39 \qquad
\textbf{(B) }71 \qquad
\textbf{(C) }73 \qquad
\textbf{(D) }75 \qquad
\textbf{(E) }135 \qquad
$
Two nonhorizontal, non vertical lines in the $xy$-coordinate plane intersect to form a $45^{\circ}$ angle. One line has slope equal to $6$ times the slope of the other line. What is the greatest possible value of the product of the slopes of the two lines?
$\textbf{(A)}\ \frac16 \qquad\textbf{(B)}\ \frac23 \qquad\textbf{(C)}\ \frac32 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 6$