Found problems: 603
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]
Is it possible to split all straight lines in a plane into the pairs of perpendicular lines, so that every line belongs to a single pair?
Let the [i]taxicab distance[/i] between points $(x_1,y_1)$ and $(x_2,y_2)$ in the coordinate plane is given by $|x_1-x_2|+|y_1-y_2|$. For how many points $P$ with integer coordinates is the taxicab distance between $P$ and the origin less than or equal to $20$?
$\textbf{(A) }441\qquad\textbf{(B) }761\qquad\textbf{(C) }841\qquad\textbf{(D) }921\qquad\textbf{(E) }924$
Given positive integers $m$ and $n$, prove that there is a positive integer $c$ such that the numbers $cm$ and $cn$ have the same number of occurrences of each non-zero digit when written in base ten.
[b]p1.[/b] Solve: $INK + INK + INK + INK + INK + INK = PEN$
($INK$ and $PEN$ are $3$-digit numbers, and different letters stand for different digits).
[b]p2. [/b]Two people play a game. They put $3$ piles of matches on the table:
the first one contains $1$ match, the second one $3$ matches, and the third one $4$ matches. Then they take turns making moves. In a move, a player may take any nonzero number of matches FROM ONE PILE. The player who takes the last match from the table loses the game.
a) The player who makes the first move can win the game. What is the winning first move?
b) How can he win? (Describe his strategy.)
[b]p3.[/b] The planet Naboo is under attack by the imperial forces. Three rebellion camps are located at the vertices of a triangle. The roads connecting the camps are along the sides of the triangle. The length of the first road is less than or equal to $20$ miles, the length of the second road is less than or equal to $30$ miles, and the length of the third road is less than or equal to $45$ miles. The Rebels have to cover the area of this triangle with a defensive field. What is the maximal area that they may need to cover?
[b]p4.[/b] Money in Wonderland comes in $\$5$ and $\$7$ bills. What is the smallest amount of money you need to buy a slice of pizza that costs $\$ 1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do, since the pizza man can only give you $\$5$ back.
[b]p5.[/b] (a) Put $5$ points on the plane so that each $3$ of them are vertices of an isosceles triangle (i.e., a triangle with two equal sides), and no three points lie on the same line.
(b) Do the same with $6$ points.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
In rectangle $ABCD$, $AB=6$, $AD=30$, and $G$ is the midpoint of $\overline{AD}$. Segment $AB$ is extended $2$ units beyond $B$ to point $E$, and $F$ is the intersection of $\overline{ED}$ and $\overline{BC}$. What is the area of $BFDG$?
$ \textbf{(A)}\ \frac{133}{2}\qquad\textbf{(B)}\ 67\qquad\textbf{(C)}\ \frac{135}{2}\qquad\textbf{(D)}\ 68\qquad\textbf{(E)}\ \frac{137}{2}$
An ant is moving on the cooridnate plane, starting form point $(0,-1)$ along a straight line until it reaches the $x$- axis at point $(x,0)$ where $x$ is a real number. After it turns $90^o$ to the left and moves again along a straight line until it reaches the $y$-axis . Then it again turns left and moves along a straight line until it reaches the $x$-axis, where it once more turns left by $90^o$ and moves along a straight line until it finally reached the $y$-axis.
Can both the length of the ant's journey and distance between it's initial and final point be:
(a) rational numbers ?
(b) integers?
Justify your answers
PS. Collected [url=https://artofproblemsolving.com/community/c949609_2019_nigerian_senior_mo_round_4]here[/url]
Let $ n$ and $ k$ be positive integers such that $ \frac{1}{2} n < k \leq \frac{2}{3} n.$ Find the least number $ m$ for which it is possible to place $ m$ pawns on $ m$ squares of an $ n \times n$ chessboard so that no column or row contains a block of $ k$ adjacent unoccupied squares.
A hunter and an invisible rabbit play a game on an infinite square grid. First the hunter fixes a colouring of the cells with finitely many colours. The rabbit then secretly chooses a cell to start in. Every minute, the rabbit reports the colour of its current cell to the hunter, and then secretly moves to an adjacent cell that it has not visited before (two cells are adjacent if they share an edge). The hunter wins if after some finite time either:[list][*]the rabbit cannot move; or
[*]the hunter can determine the cell in which the rabbit started.[/list]Decide whether there exists a winning strategy for the hunter.
[i]Proposed by Aron Thomas[/i]
Let $P_1$, $P_2$, $P_3$, $P_4$, $P_5$, and $P_6$ be six parabolas in the plane, each congruent to the parabola $y = x^2/16$. The vertices of the six parabolas are evenly spaced around a circle. The parabolas open outward with their axes being extensions of six of the circle's radii. Parabola $P_1$ is tangent to $P_2$, which is tangent to $P_3$, which is tangent to $P_4$, which is tangent to $P_5$, which is tangent to $P_6$, which is tangent to $P_1$. What is the diameter of the circle?
Divide the upper right quadrant of the plane into square cells with side length $1$. In this quadrant, $n^2$ cells are colored, show that there’re at least $n^2+n$ cells (possibly including the colored ones) that at least one of its neighbors are colored.
Let $ABCDEF$ be a regular hexagon with side length $1$. Denote by $X, Y,$ and $Z$ the midpoints of $\overline{AB}$, $\overline{CD}$, and $\overline{EF}$, respectively. What is the area of the convex hexagon whose interior is the intersection of the interiors of $\triangle ACE$ and $\triangle XYZ$?
$\textbf{(A) }\dfrac{3}{8}\sqrt{3}\qquad\textbf{(B) }\dfrac{7}{16}\sqrt{3}\qquad\textbf{(C) }\dfrac{15}{32}\sqrt{3}\qquad\textbf{(D) }\dfrac{1}{2}\sqrt{3}\qquad\textbf{(E) }\dfrac{9}{16}\sqrt{3}$
A grasshopper is hopping in the angle $x\ge 0, y\ge 0$ of the coordinate plane (that means that it cannot land in the point with negative coordinate). If it is in the point $(x,y)$, it can either jump to the point $(x+1,y-1)$, or to the point $(x-5,y+7)$. Draw a set of such an initial points $(x,y)$, that having started from there, a grasshopper cannot reach any point farther than $1000$ from the point $(0,0)$. Find its area.
In the coordinate plane, a set of $2000$ points $\{(x_1, y_1), (x_2, y_2), . . . , (x_{2000}, y_{2000})\}$ is called [i]good[/i] if $0\leq x_i \leq 83$, $0\leq y_i \leq 83$ for $i = 1, 2, \dots, 2000$ and $x_i \not= x_j$ when $i\not=j$. Find the largest positive integer $n$ such that, for any good set, the interior and boundary of some unit square contains exactly $n$ of the points in the set on its interior or its boundary.
Let $\gamma_1$ and $\gamma_2$ be two disjoint circles, with centers $O_1$ and $O_2$. One of their exterior tangents cuts $\gamma_1$ in $A_1$ and $\gamma_2$ in $A_2$. One of their common internal tangents cuts $\gamma_1$ in $B_1$ and $\gamma_2$ in $B_2$, and the other common internal tangent cuts $\gamma_1$ in $C_1$ and $\gamma_2$ int $C_2$. Let $B_1B_2$ and $C_1C_2$ intersect in $O$. $X$ is the point where $A_2O$ cuts $\gamma_1$ and $OX<OB_1$. Similarly, $Y$ is the point where $A_1O$ cuts $\gamma_2$ and $OY<OB_2$. The perpendicular in $X$ to $OX$ cuts $O_1B_1$ in $P$ and the perpendicular in $Y$ to $OY$ cuts $O_2C_2$ in $Q$. Prove that $PQ$ and $A_1A_2$ are parallel.
[i]Proposed by Flavian Georgescu[/i]
In an acute-angled triangle $ABC$, we consider the feet $H_a$ and $H_b$ of the altitudes from $A$ and $B$, and the intersections $W_a$ and $W_b$ of the angle bisectors from $A$ and $B$ with the opposite sides $BC$ and $CA$ respectively. Show that the centre of the incircle $I$ of triangle $ABC$ lies on the segment $H_aH_b$ if and only if the centre of the circumcircle $O$ of triangle $ABC$ lies on the segment $W_aW_b$.
Octagon $ABCDEFGH$ with side lengths $AB = CD = EF = GH = 10$ and $BC= DE = FG = HA = 11$ is formed by removing four $6-8-10$ triangles from the corners of a $23\times 27$ rectangle with side $\overline{AH}$ on a short side of the rectangle, as shown. Let $J$ be the midpoint of $\overline{HA}$, and partition the octagon into $7$ triangles by drawing segments $\overline{JB}$, $\overline{JC}$, $\overline{JD}$, $\overline{JE}$, $\overline{JF}$, and $\overline{JG}$. Find the area of the convex polygon whose vertices are the centroids of these $7$ triangles.
[asy]
unitsize(6);
pair P = (0, 0), Q = (0, 23), R = (27, 23), SS = (27, 0);
pair A = (0, 6), B = (8, 0), C = (19, 0), D = (27, 6), EE = (27, 17), F = (19, 23), G = (8, 23), J = (0, 23/2), H = (0, 17);
draw(P--Q--R--SS--cycle);
draw(J--B);
draw(J--C);
draw(J--D);
draw(J--EE);
draw(J--F);
draw(J--G);
draw(A--B);
draw(H--G);
real dark = 0.6;
filldraw(A--B--P--cycle, gray(dark));
filldraw(H--G--Q--cycle, gray(dark));
filldraw(F--EE--R--cycle, gray(dark));
filldraw(D--C--SS--cycle, gray(dark));
dot(A);
dot(B);
dot(C);
dot(D);
dot(EE);
dot(F);
dot(G);
dot(H);
dot(J);
dot(H);
defaultpen(fontsize(10pt));
real r = 1.3;
label("$A$", A, W*r);
label("$B$", B, S*r);
label("$C$", C, S*r);
label("$D$", D, E*r);
label("$E$", EE, E*r);
label("$F$", F, N*r);
label("$G$", G, N*r);
label("$H$", H, W*r);
label("$J$", J, W*r);
[/asy]
Let $ABC$ be a right triangle. It is known that there are points $D$ on the side $AC$ and $E$ on the side $BC$ such that $AB = AD = BE$ and $BD$ is perpendicular to $DE$. Calculate the ratios $\frac{AB}{BC}$ and $\frac{BC}{CA}$.
Can a regular triangle be placed inside a regular hexagon in such a way that all vertices of the triangle were seen from each vertex of the hexagon? (Point $A$ is seen from $B$, if the segment $AB$ dots not contain internal points of the triangle.)
In the coordinate plane,the graps of functions $y=sin x$ and $y=tan x$ are drawn, along with the coordinate axes. Using compass and ruler, construct a line tangent to the graph of sine at a point above the axis, $Ox$, as well at a point below that axis (the line can also meet the graph at several other points)
Consider the paper triangle whose vertices are $(0,0), (34,0),$ and $(16,24).$ The vertices of its midpoint triangle are the midpoints of its sides. A triangular pyramid is formed by folding the triangle along the sides of its midpoint triangle. What is the volume of this pyramid?
Let $n > 1$ be a given integer. An $n \times n \times n$ cube is composed of $n^3$ unit cubes. Each unit cube is painted with one colour. For each $n \times n \times 1$ box consisting of $n^2$ unit cubes (in any of the three possible orientations), we consider the set of colours present in that box (each colour is listed only once). This way, we get $3n$ sets of colours, split into three groups according to the orientation.
It happens that for every set in any group, the same set appears in both of the other groups. Determine, in terms of $n$, the maximal possible number of colours that are present.
Let $n\ge3$ be an integer. Prove that there is a set of $n$ points in the plane such that the distance between any two points is irrational and each set of three points determines a non-degenerate triangle with rational area.
Turbo the snail sits on a point on a circle with circumference $1$. Given an infinite sequence of positive real numbers $c_1, c_2, c_3, \dots$, Turbo successively crawls distances $c_1, c_2, c_3, \dots$ around the circle, each time choosing to crawl either clockwise or counterclockwise.
Determine the largest constant $C > 0$ with the following property: for every sequence of positive real numbers $c_1, c_2, c_3, \dots$ with $c_i < C$ for all $i$, Turbo can (after studying the sequence) ensure that there is some point on the circle that it will never visit or crawl across.
Triangle $\triangle ABC$ has side lengths $\overline{AB} = 13, \overline{BC} = 14,$ and $\overline{AC} = 15$. Suppose $M$ and $N$ are the midpoints of $\overline{AB}$ and $\overline{AC}$, respectively. Let $P$ be a point on $\overline{MN}$, such that if the circumcircles of triangles $\triangle BMP$ and $\triangle CNP$ intersect at a second point $Q$ distinct from $P$, then $PQ$ is parallel to $AB$. The value of $AP^2$ can be expressed as a common fraction of the form $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.