Found problems: 603
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.
A square $ABCD$ is given. Over the side $BC$ draw an equilateral triangle $BCS$ on the outside. The midpoint of the segment $AS$ is $N$ and the midpoint of the side $CD$ is $H$. Prove that $\angle NHC = 60^o$.
.
(Karl Czakler)
Let $ABCD$ be an isosceles trapezoid with $AD=BC$ and $AB<CD.$ Suppose that the distances from $A$ to the lines $BC,CD,$ and $BD$ are $15,18,$ and $10,$ respectively. Let $K$ be the area of $ABCD.$ Find $\sqrt2 \cdot K.$
Let $m$ and $n$ be fixed positive integers. Tsvety and Freyja play a game on an infinite grid of unit square cells. Tsvety has secretly written a real number inside of each cell so that the sum of the numbers within every rectangle of size either $m$ by $n$ or $n$ by $m$ is zero. Freyja wants to learn all of these numbers.
One by one, Freyja asks Tsvety about some cell in the grid, and Tsvety truthfully reveals what number is written in it. Freyja wins if, at any point, Freyja can simultaneously deduce the number written in every cell of the entire infinite grid (If this never occurs, Freyja has lost the game and Tsvety wins).
In terms of $m$ and $n$, find the smallest number of questions that Freyja must ask to win, or show that no finite number of questions suffice.
[i]Nikolai Beluhov[/i]
A cubical cake with edge length $ 2$ inches is iced on the sides and the top. It is cut vertically into three pieces as shown in this top view, where $ M$ is the midpoint of a top edge. The piece whose top is triangle $ B$ contains $ c$ cubic inches of cake and $ s$ square inches of icing. What is $ c\plus{}s$?
[asy]unitsize(1cm);
defaultpen(linewidth(.8pt)+fontsize(8pt));
draw((-1,-1)--(1,-1)--(1,1)--(-1,1)--cycle);
draw((1,1)--(-1,0));
pair P=foot((1,-1),(1,1),(-1,0));
draw((1,-1)--P);
draw(rightanglemark((-1,0),P,(1,-1),4));
label("$M$",(-1,0),W);
label("$C$",(-0.1,-0.3));
label("$A$",(-0.4,0.7));
label("$B$",(0.7,0.4));[/asy]$ \textbf{(A)}\ \frac{24}{5} \qquad
\textbf{(B)}\ \frac{32}{5} \qquad
\textbf{(C)}\ 8\plus{}\sqrt5 \qquad
\textbf{(D)}\ 5\plus{}\frac{16\sqrt5}{5} \qquad
\textbf{(E)}\ 10\plus{}5\sqrt5$
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]
Turbo the snail plays a game on a board with $2024$ rows and $2023$ columns. There are hidden monsters in $2022$ of the cells. Initially, Turbo does not know where any of the monsters are, but he knows that there is exactly one monster in each row except the first row and the last row, and that each column contains at most one monster.
Turbo makes a series of attempts to go from the first row to the last row. On each attempt, he chooses to start on any cell in the first row, then repeatedly moves to an adjacent cell sharing a common side. (He is allowed to return to a previously visited cell.) If he reaches a cell with a monster, his attempt ends and he is transported back to the first row to start a new attempt. The monsters do not move, and Turbo remembers whether or not each cell he has visited contains a monster. If he reaches any cell in the last row, his attempt ends and the game is over.
Determine the minimum value of $n$ for which Turbo has a strategy that guarantees reaching the last row on the $n$-th attempt or earlier, regardless of the locations of the monsters.
[i]Proposed by Cheuk Hei Chu, Hong Kong[/i]
Circles $\omega_{1}$ and $\omega_{2}$ are given. Let $M$ be the midpoint of the segment joining their centers, $X$, $Y$ be arbitrary points on $\omega_{1}$, $\omega_{2}$ respectively such that $MX=MY$. Find the locus of the midpoints of segments $XY$.
Proposed by: L Shatunov
An acute-angled triangle with one side equal to the altitude from the opposite vertex is cut from paper. Construct a point inside this triangle such that the square of the distance from it to one of the vertices equals the sum of the squares of distances to to the remaining two vertices. No instruments are available, it is allowed only to fold the paper and to mark the common points of folding lines.
Proposed by: M.Evdokimov
Let $ABC$ be a triangle with $AB=13$, $BC=14$, and $CA=15$. The incircle of $ABC$ meets $BC$ at $D$. Line $AD$ meets the circle through $B$, $D$, and the reflection of $C$ over $AD$ at a point $P\neq D$. Compute $AP$.
[i]2020 CCA Math Bonanza Tiebreaker Round #4[/i]
Several players try out for the USAMTS basketball team, and they all have integer heights and weights when measured in centimeters and pounds, respectively. In addition, they all weigh less in pounds than they are tall in centimeters. All of the players weigh at least $190$ pounds and are at most $197$ centimeters tall, and there is exactly one player with
every possible height-weight combination.
The USAMTS wants to field a competitive team, so there are some strict requirements.
[list]
[*] If person $P$ is on the team, then anyone who is at least as tall and at most as heavy as $P$ must also be on the team.
[*] If person $P$ is on the team, then no one whose weight is the same as $P$’s height can also be on the team.
[/list]
Assuming the USAMTS team can have any number of members (including zero), how many different basketball teams can be constructed?
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 rectangle $ D$ is partitioned in several ($ \ge2$) rectangles with sides parallel to those of $ D$. Given that any line parallel to one of the sides of $ D$, and having common points with the interior of $ D$, also has common interior points with the interior of at least one rectangle of the partition; prove that there is at least one rectangle of the partition having no common points with $ D$'s boundary.
[i]Author: Kei Irie, Japan[/i]
Line $\ell$ in the coordinate plane has the equation $3x - 5y + 40 = 0$. This line is rotated $45^{\circ}$ counterclockwise about the point $(20, 20)$ to obtain line $k$. What is the $x$-coordinate of the $x$-intercept of line $k?$
$\textbf{(A) } 10 \qquad \textbf{(B) } 15 \qquad \textbf{(C) } 20 \qquad \textbf{(D) } 25 \qquad \textbf{(E) } 30$
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.$
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 $ABCD$ be a cyclic quadrilateral. Let $E$ and $F$ be variable points on the sides $AB$ and $CD$, respectively, such that $AE:EB=CF:FD$. Let $P$ be the point on the segment $EF$ such that $PE:PF=AB:CD$. Prove that the ratio between the areas of triangles $APD$ and $BPC$ does not depend on the choice of $E$ and $F$.
For certain ordered pairs $(a,b)$ of real numbers, the system of equations \begin{eqnarray*} && ax+by =1\\ &&x^2+y^2=50\end{eqnarray*} has at least one solution, and each solution is an ordered pair $(x,y)$ of integers. How many such ordered pairs $(a,b)$ are there?
Consider a $100\times 100$ square unit lattice $\textbf{L}$ (hence $\textbf{L}$ has $10000$ points). Suppose $\mathcal{F}$ is a set of polygons such that all vertices of polygons in $\mathcal{F}$ lie in $\textbf{L}$ and every point in $\textbf{L}$ is the vertex of exactly one polygon in $\mathcal{F}.$ Find the maximum possible sum of the areas of the polygons in $\mathcal{F}.$
[i]Michael Ren and Ankan Bhattacharya, USA[/i]
A moving particle starts at the point $\left(4,4\right)$ and moves until it hits one of the coordinate axes for the first time. When the particle is at the point $\left(a,b\right)$, it moves at random to one of the points $\left(a-1,b\right)$, $\left(a,b-1\right)$, or $\left(a-1,b-1\right)$, each with probability $\tfrac{1}{3}$, independently of its previous moves. The probability that it will hit the coordinate axes at $\left(0,0\right)$ is $\tfrac{m}{3^n}$, where $m$ and $n$ are positive integers, and $m$ is not divisible by $3$. Find $m+n$.
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}$.
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$.
The diagram below shows a $ 4\times4$ rectangular array of points, each of which is $ 1$ unit away from its nearest neighbors.
[asy]unitsize(0.25inch);
defaultpen(linewidth(0.7));
int i, j;
for(i = 0; i < 4; ++i)
for(j = 0; j < 4; ++j)
dot(((real)i, (real)j));[/asy]Define a [i]growing path[/i] to be a sequence of distinct points of the array with the property that the distance between consecutive points of the sequence is strictly increasing. Let $ m$ be the maximum possible number of points in a growing path, and let $ r$ be the number of growing paths consisting of exactly $ m$ points. Find $ mr$.
A cube lies on the plane. After being rolled a few times (over its edges), it is brought back to its initial location with the same face up. Could the top face have been rotated by 90 degrees?
[i](5 points)[/i]
A polygon $\prod$ is given in the $OXY$ plane and its area exceeds $n.$ Prove that there exist $n+1$ points $P_{1}(x_1, y_1), P_{2}(x_2, y_2), \ldots, P_{n+1}(x_{n+1}, y_{n+1})$ in $\prod$ such that $\forall i,j \in \{1, 2, \ldots, n+1\}$, $x_j - x_i$ and $y_j - y_i$ are all integers.