Found problems: 603
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 $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]
The points $P = (a, b)$ and $Q = (c, d)$ are in the first quadrant of the $xy$ plane, and $a, b, c$ and $d$ are integers satisfying $a < b, a < c, b < d$ and $c < d$. A route from point $P$ to point $Q$ is a broken line consisting of unit steps in the directions of the positive coordinate axes. An allowed route is a route not touching the line $x = y$. Tetermine the number of allowed routes.
The diagonals of the convex quadrilateral $ABCD$ are mutually perpendicular. Through the midpoint of the sides $AB$ and $AD$ draw lines, which are perpendicular to the opposite sides. Prove that they intersect on line $AC$.
Isosceles $ \triangle ABC$ has a right angle at $ C$. Point $ P$ is inside $ \triangle ABC$, such that $ PA \equal{} 11, PB \equal{} 7,$ and $ PC \equal{} 6$. Legs $ \overline{AC}$ and $ \overline{BC}$ have length $ s \equal{} \sqrt {a \plus{} b\sqrt {2}}$, where $ a$ and $ b$ are positive integers. What is $ a \plus{} b$?
[asy]pointpen = black;
pathpen = linewidth(0.7);
pen f = fontsize(10);
size(5cm);
pair B = (0,sqrt(85+42*sqrt(2)));
pair A = (B.y,0);
pair C = (0,0);
pair P = IP(arc(B,7,180,360),arc(C,6,0,90));
D(A--B--C--cycle);
D(P--A);
D(P--B);
D(P--C);
MP("A",D(A),plain.E,f);
MP("B",D(B),plain.N,f);
MP("C",D(C),plain.SW,f);
MP("P",D(P),plain.NE,f);[/asy]
$ \textbf{(A) } 85 \qquad \textbf{(B) } 91 \qquad \textbf{(C) } 108 \qquad \textbf{(D) } 121 \qquad \textbf{(E) } 127$
Let $ABC$ be an acute-angled triangle with $AB<AC$ and let $O$ be the centre of its circumcircle $\omega$. Let $D$ be a point on the line segment $BC$ such that $\angle BAD = \angle CAO$. Let $E$ be the second point of intersection of $\omega$ and the line $AD$. If $M$, $N$ and $P$ are the midpoints of the line segments $BE$, $OD$ and $AC$, respectively, show that the points $M$, $N$ and $P$ are collinear.
A rectangle that is inscribed in a larger rectangle (with one vertex on each side) is called [i]unstuck[/i] if it is possible to rotate (however slightly) the smaller rectangle about its center within the confines of the larger. Of all the rectangles that can be inscribed unstuck in a 6 by 8 rectangle, the smallest perimeter has the form $\sqrt{N}$, for a positive integer $N$. Find $N$.
A homogeneous solid body is made by joining a base of a circular cylinder of height $h$ and radius $r,$ and the base of a hemisphere of radius $r.$ This body is placed with the hemispherical end on a horizontal table, with the axis of the cylinder in a vertical position, and then slightly oscillated. It is intuitively evident that if $r$ is large as compared to $h$, the equilibrium will be stable; but if $r$ is small compared to $h$, the equilibrium will be unstable. What is the critical value of the ratio $r\slash h$ which enables the body to rest in neutral equilibrium in any position?
Consider a $9 \times 9$ grid of squares. Haruki fills each square in this grid with an integer between 1 and 9, inclusive. The grid is called a $\textit{super-sudoku}$ if each of the following three conditions hold:
[list]
[*] Each column in the grid contains each of the numbers $1, 2, 3, 4, 5, 6, 7, 8, 9$ exactly once.
[*] Each row in the grid contains each of the numbers $1, 2, 3, 4, 5, 6, 7, 8, 9$ exactly once.
[*] Each $3 \times 3$ subsquare in the grid contains each of the numbers $1, 2, 3, 4, 5, 6, 7, 8, 9$ exactly once.
[/list]
How many possible super-sudoku grids are there?
A $39$-tuple of real numbers $(x_1,x_2,\ldots x_{39})$ satisfies
\[2\sum_{i=1}^{39} \sin(x_i) = \sum_{i=1}^{39} \cos(x_i) = -34.\]
The ratio between the maximum of $\cos(x_1)$ and the maximum of $\sin(x_1)$ over all tuples $(x_1,x_2,\ldots x_{39})$ satisfying the condition is $\tfrac ab$ for coprime positive integers $a$, $b$ (these maxima aren't necessarily achieved using the same tuple of real numbers). Find $a + b$.
[i]Proposed by Evan Chang[/i]
An arbitrary point $M$ is selected in the interior of the segment $AB$. The square $AMCD$ and $MBEF$ are constructed on the same side of $AB$, with segments $AM$ and $MB$ as their respective bases. The circles circumscribed about these squares, with centers $P$ and $Q$, intersect at $M$ and also at another point $N$. Let $N'$ denote the point of intersection of the straight lines $AF$ and $BC$.
a) Prove that $N$ and $N'$ coincide;
b) Prove that the straight lines $MN$ pass through a fixed point $S$ independent of the choice of $M$;
c) Find the locus of the midpoints of the segments $PQ$ as $M$ varies between $A$ and $B$.
Let ${A_1, \dots , A_n }$ and ${B_1, \dots , B_n}$ be sets of points in the plane. Suppose that for all points $x$,
$$D \left( x , A_1 \right) + D \left( x , A_2 \right) + \cdots + D \left( x , A_n \right) \ge D \left( x , B_1 \right) + D \left( x , B_2 \right) + \cdots + D \left( x , B_n \right)$$
where $D \left( x , y \right)$ denotes the distance between $x$ and $y$. Show that the $A_i$'s and the $B_i$'s share the same center of mass.
A square $ABCD$ lies in the coordinate plane with its vertices $A$ and $C$ lying on different coordinate axes. Prove that one of the vertices $B$ or $D$ lies on the line $y = x$ and the other one on $y = -x$.
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.
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]
A scanning code consists of a $7 \times 7$ grid of squares, with some of its squares colored black and the rest colored white. There must be at least one square of each color in this grid of $49$ squares. A scanning code is called [i]symmetric[/i] if its look does not change when the entire square is rotated by a multiple of $90 ^{\circ}$ counterclockwise around its center, nor when it is reflected across a line joining opposite corners or a line joining midpoints of opposite sides. What is the total number of possible symmetric scanning codes?
$\textbf{(A)} \text{ 510} \qquad \textbf{(B)} \text{ 1022} \qquad \textbf{(C)} \text{ 8190} \qquad \textbf{(D)} \text{ 8192} \qquad \textbf{(E)} \text{ 65,534}$
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.$
A [i]lattice point[/i] in the Cartesian plane is a point whose coordinates are both integers. A [i]lattice polygon[/i] is a polygon all of whose vertices are lattice points.
Let $\Gamma$ be a convex lattice polygon. Prove that $\Gamma$ is contained in a convex lattice polygon $\Omega$ such that the vertices of $\Gamma$ all lie on the boundary of $\Omega$, and exactly one vertex of $\Omega$ is not a vertex of $\Gamma$.
Two positive integers $a$ and $b$ are prime-related if $a = pb$ or $b = pa$ for some prime $p$. Find all positive integers $n$, such that $n$ has at least three divisors, and all the divisors can be arranged without repetition in a circle so that any two adjacent divisors are prime-related.
Note that $1$ and $n$ are included as divisors.
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.)
Albrecht writes numbers on the points of the first quadrant with integer coordinates in the following way: If at least one of the coordinates of a point is 0, he writes 0; in all other cases the number written on point $(a, b)$ is one greater than the average of the numbers written on points $ (a+1 , b-1) $ and $ (a-1,b+1)$ . Which numbers could he write on point $(121, 212)$?
Note: The elements of the first quadrant are points where both of the coordinates are non- negative.
In a triangle $ABC$, let $D$ be the point on the segment $BC$ such that $AB+BD=AC+CD$. Suppose that the points $B$, $C$ and the centroids of triangles $ABD$ and $ACD$ lie on a circle. Prove that $AB=AC$.
A laser is placed at the point (3,5). The laser bean travels in a straight line. Larry wants the beam to hit and bounce off the $y$-axis, then hit and bounce off the $x$-axis, then hit the point $(7,5)$. What is the total distance the beam will travel along this path?
$\textbf{(A) }2\sqrt{10} \qquad \textbf{(B) }5\sqrt2 \qquad \textbf{(C) }10\sqrt2 \qquad \textbf{(D) }15\sqrt2 \qquad \textbf{(E) }10\sqrt5$
Prove that among any five distinct rays $ Ox$, $ Oy$, $ Oz$, $ Ot$, $ Or$ in space there exist two which form an angle less than or equal to $ 90^{\circ}$.
Frog is in the origin of decartes coordinate system. Every second frog jumpes horizontally or vertically in some of the $4$ adjacent points which coordinates are integers. Find number of different points in which frog can be found in $2015$ seconds.