Found problems: 85335
A circle $C_0$ is inscribed in an equilateral triangle $XYZ$ of side length 112. Then, for each positive integer $n$, circle $C_n$ is inscribed in the region bounded by $XY$, $XZ$, and an arc of circle $C_{n-1}$, forming an infinite sequence of circles tangent to sides $XY$ and $XZ$ and approaching vertex $X$. If these circles collectively have area $m\pi$, find $m$.
[i]Proposed by Michael Tang[/i]
Find the largest integer $n$ for which there exist $n$ different integers such that none of them are divisible by either of $7,11$ or $13$, but the sum of any two of them is divisible by at least one of $7,11$ and $13$.
Let $f(u)$ be a continuous function and, for any real number $u$, let $[u]$ denote the greatest integer less than or equal to $u$. Show that for any $x>1$,
\[\int_{1}^{x} [u]([u]+1)f(u)du = 2\sum_{i=1}^{[x]} i \int_{i}^{x} f(u)du\]
The diagram below shows a shaded region bounded by two concentric circles where the outer circle has twice the radius of the inner circle. The total boundary of the shaded region has length $36\pi$. Find $n$ such that the area of the shaded region is $n\pi$.
[img]https://cdn.artofproblemsolving.com/attachments/4/5/c9ffdc41c633cc61127ef585a45ee5e6c0f88d.png[/img]
Let $ABC$ be a triangle. The points $K, L,$ and $M$ lie on the segments $BC, CA,$ and $AB,$ respectively, such that the lines $AK, BL,$ and $CM$ intersect in a common point. Prove that it is possible to choose two of the triangles $ALM, BMK,$ and $CKL$ whose inradii sum up to at least the inradius of the triangle $ABC$.
[i]Proposed by Estonia[/i]
We have a deck of $n$ playing cards, some of which are turned up and some are turned down. In each step we are allowed to take a set of several cards from the top, turn the set and place it back on the top of the deck. What is the smallest number of steps necessary to make all cards in the deck turned down, independent of the initial configuration?
Determine all natural numbers n for which the number $A = n^4 + 4n^3 +5n^2 + 6n$ is a perfect square of a natural number.
A positive integer is called [i]sabroso [/i]if when it is added to the number obtained when its digits are interchanged from one side of its written form to the other, the result is a perfect square. For example, $143$ is sabroso, since $143 + 341 =484 = 22^2$. Find all two-digit sabroso numbers.
Let $ABCDEF$ be a convex hexagon, $P, Q, R$ be the intersection points of $AB$ and $EF$, $EF$ and $CD$, $CD$ and $AB$. $S, T,UV$ are the intersection points of $BC$ and $DE$, $DE$ and $FA$, $FA$ and $BC$, respectively. Prove that if $$\frac{AB}{PR}=\frac{CD}{RQ}=\frac{EF}{QP},$$ then $$\frac{BC}{US}=\frac{DE}{ST}=\frac{FA}{TU}.$$
\[\int_0^1 \frac{\log(x)}{\sqrt x}\mathrm dx\]
[i]Proposed by Robert Trosten[/i]
Determine all polynomials $P(x)$ with real coefficients such that
$P(x)^2 + P\left(\frac{1}{x}\right)^2= P(x^2)P\left(\frac{1}{x^2}\right)$ for all $x$.
Given a positive integer $n$.
(a) If $P$ is a polynomial of degree $n$ where $P(x) \in \mathbb{Z}$ for every $x \in \mathbb{Z}$, prove that for every $a,b \in \mathbb{Z}$ where $P(a) \neq P(b)$,
\[\text{lcm}(1, 2, \ldots, n) \ge \left| \dfrac{a-b}{P(a) - P(b)} \right|\]
(b) Find one $P$ (for each $n$) such that the equality case above is achieved for some $a,b \in \mathbb{Z}$.
Alice picks a number uniformly at random from the first $5$ even positive integers, and Palice picks a number uniformly at random from the first $5$ odd positive integers. If Alice picks a larger number than Palice with probability $\frac{m}{n}$ for relatively prime positive integers $m,n$, compute $m+n$.
[i]2020 CCA Math Bonanza Lightning Round #4.1[/i]
Quadrilateral $ABCD$ is inscribed in a circle such that the midpoints of its sides also lie on a (different) circle. Let $M$ and $N$ be the midpoints of $\overline{AB}$ and $\overline{CD}$ respectively, and let $P$ be the foot of the perpendicular from the intersection of $\overline{AC}$ and $\overline{BD}$ onto $\overline{BC}$. If the side lengths of $ABCD$ are $1$, $3$, $\sqrt 2$, and $2\sqrt 2$ in some order, compute the greatest possible area of the circumcircle of triangle $MNP$.
[i]Proposed by Connor Gordon[/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]
The driver starts driving every morning at the same time from office to the house of his boss, picks up the boss and then drives back to the office. He always drives with the same speed on the same road. Because the time of arrival of the car to the boss's house is predetermined, the boss always leaves the house on time, and thus the driver does not spend any time waiting for his boss. Once the driver started driving from the office $42$ minutes later, than usual. The boss saw that the car didn't come and started walking in the direction of office. When he met the car on the road, the driver picked him up and started driving back to the office. The speed of the boss is 20 times lower than the speed of the car, and the time usually spent on the route from office to the house is at least an hour.
Determine did the car come earlier or later to the office and by how many minutes.
$(GBR 3)$ A smooth solid consists of a right circular cylinder of height $h$ and base-radius $r$, surmounted by a hemisphere of radius $r$ and center $O.$ The solid stands on a horizontal table. One end of a string is attached to a point on the base. The string is stretched (initially being kept in the vertical plane) over the highest point of the solid and held down at the point $P$ on the hemisphere such that $OP$ makes an angle $\alpha$ with the horizontal. Show that if $\alpha$ is small enough, the string will slacken if slightly displaced and no longer remain in a vertical plane. If then pulled tight through $P$, show that it will cross the common circular section of the hemisphere and cylinder at a point $Q$ such that $\angle SOQ = \phi$, $S$ being where it initially crossed this section, and $\sin \phi = \frac{r \tan \alpha}{h}$.
As a gift, Dilhan was given the number $n=1^1\cdot2^2\cdots2021^{2021}$, and each day, he has been dividing $n$ by $2021!$ exactly once. One day, when he did this, he discovered that, for the first time, $n$ was no longer an integer, but instead a reduced fraction of the form $\frac{a}b$. What is the sum of all distinct prime factors of $b$?
[i]Proposed by Adam Bertelli[/i]
In the trapezium $ABCD$ ($AD // BC$), the point $M$ lies on the side of $CD$, with $CM:MD=2:3$, $AB=AD$, $BC:AD=1:3$. Prove that $BD \perp AM$.
We are given $\Delta ABC$, for which the excircle to side $BC$ is tangent to the continuations of $AB$ and $AC$ in points $E$ and $F$ respectively. Let $D$ be the reflection of $A$ in line $EF$. If it is known that $\angle BAC=2\angle BDC$, then determine $\angle BAC$.
Lucky starts doodling on a $5\times 5$ Bingo board. He puts his pencil at the center of the upper-left square (marked by ‘·’) and draws a continuous doodle ending on the Free Space, never going off the board or through a corner of a square. (See Figure 1.)
(a) Is it possible for Lucky’s doodle to visit all squares exactly once? (The starting and ending squares are considered visited.)
(b) Is it possible for Lucky’s doodle to visit all squares exactly twice?
Let $ABCD$ be a cyclic quadrilateral, with circumcircle $\omega$ and circumcenter $O$. Let $AB$ intersect $CD$ at $E$, $AD$ intersect $BC$ at $F$, and $AC$ intersect $BD$ at $G$.
The points $A_1, B_1, C_1, D_1$ are chosen on rays $GA$, $GB$, $GC$, $GD$ such that:
$\bullet$ $\displaystyle \frac{GA_1}{GA} = \frac{GB_1}{GB} = \frac{GC_1}{GC} = \frac{GD_1}{GD}$
$\bullet$ The points $A_1, B_1, C_1, D_1, O$ lie on a circle.
Let $A_1B_1$ intersect $C_1D_1$ at $K$, and $A_1D_1$ intersect $B_1C_1$ at $L$. Prove that the image of the circle $(A_1B_1C_1D_1)$ under inversion about $\omega$ is a line passing through the midpoints of $KE$ and $LF$.
[i]Proposed by Anzo Teh Zhao Yang & Ivan Chan Kai Chin[/i]
Point $P$ lies inside triangle $ABC$. Let the projections of $P$ onto sides $BC$,$CA$,$AB$ be $D$, $E$, $F$ respectively. Let the projections from $A$ to the lines $BP$ and $CP$ be $M$ and $N$ respectively. Prove that $ME$, $NF$ and $BC$ are concurrent.
The measure of the angles of a triangle are in arithmetic progression and the lengths of its altitudes are as well. Show that such a triangle is equilateral.
A list of $11$ positive integers has a mean of $10$, a median of $9$, and a unique mode of $8$. What is the largest possible value of an integer in the list?
${ \textbf{(A)}\ 24\qquad\textbf{(B)}\ 30\qquad\textbf{(C)}\ 31\qquad\textbf{(D)}}\ 33\qquad\textbf{(E)}\ 35 $