Found problems: 85335
In a certain country there are $2023$ islands and $2022$ bridges, such that every bridge connects two different islands and any two islands have at most one bridge in common, and from any island, using bridges one can get to any other island. If in any three islands there is an island with bridges connected to each of the other two islands, call these three islands an "island group". We know that any two "island group"s have at least $1$ common island. What is the minimum number of islands with only $1$ bridge connected to it?
Applied to a bill for $\$10,000$ the difference between a discount of $40\%$ and two successive discounts of $36\%$ and $4\%$, expressed in dollars, is:
$ \textbf{(A) }0\qquad\textbf{(B) }144\qquad\textbf{(C) }256\qquad\textbf{(D) }400\qquad\textbf{(E) }416 $
An acute triangle $ABC$ ($AB\ne AC$) is inscribed in the circle $\omega$ with center at $O$. The point $M$ is the midpoint of the side $BC$. The tangent line to $\omega$ at point $A$ intersects the line $BC$ at point $D$. A circle with center at point $M$ with radius $MA$ intersects the extensions of sides $AB$ and $AC$ at points $K$ and $L$, respectively. Let $X$ be such a point that $BX\parallel KM$ and $CX\parallel LM$. Prove that the points $X$, $D$, $O$ are collinear.
Let $n\ge 1$ be a positive integer. A square of side length $n$ is divided by lines parallel to each side into $n^2$ squares of side length $1$. Find the number of parallelograms which have vertices among the vertices of the $n^2$ squares of side length $1$, with both sides smaller or equal to $2$, and which have tha area equal to $2$.
(Greece)
There are given 2050 points in a unit cube. Show that there are 5 points lying in an (open) ball with the radius 1/9.
Given triangle $ABC$. Let $P$, $Q$, $R$, be the tangency points of inscribed circle of $\triangle ABC$ on sides $AB$, $BC$, $AC$ respectively. We take the reflection of these points with respect to midpoints of the sides they lie on, and denote them as $P',Q'$ and $R'$. Prove that $AP'$, $BQ'$, and $CR'$ are concurrent.
In a family there are four children of different ages, each age being a positive integer not less than $2$ and not greater than $16$. A year ago the square of the age of the eldest child was equal to the sum of the squares of the ages of the remaining children. One year from now the sum of the squares of the youngest and the oldest will be equal to the sum of the squares of the other two. How old is each child?
Circle $S$ with center $O$ and circle $S'$ intersect at points $A$ and $B$. Point $C$ is taken on the arc of a circle $S$ lying inside $S'$. Denote the intersection points of $AC$ and $BC$ with $S'$, other than $A$ and $B$, as $E$ and $D$, respectively. Prove that lines $DE$ and $OC$ are perpendicular.
Given points $A$, $B$, $C$, and $D$ on circle $\omega$ such that lines $AB$ and $CD$ intersect on point $T$ where $A$ is between $B$ and $T$, moreover $D$ is between $C$ and $T$. It is known that the line passing through $D$ which is parallel to $AB$ intersects $\omega$ again on point $E$ and line $ET$ intersects $\omega$ again on point $F$. Let $CF$ and $AB$ intersect on point $G$, $X$ be the midpoint of segment $AB$, and $Y$ be the reflection of point $T$ to $G$.
Prove that $X$, $Y$, $C$, and $D$ are concyclic.
Let $a,b,c$ be real numbers, $z_{1},z_{2},z_{3}$ be complex numbers such that
$\begin{cases}
\displaystyle|z_1|=|z_2|=|z_3|=1\\
\displaystyle\frac{z_{1}}{z_{2}}+\frac{z_{2}}{z_{3}}+\frac{z_{3}}{z_{1}}=1\\
\end{cases}$
Find $|az_{1}+bz_{2}+cz_{3}|$.
What is the greatest integer less than or equal to $$\frac{3^{100}+2^{100}}{3^{96}+2^{96}}?$$
$
\textbf{(A) }80\qquad
\textbf{(B) }81 \qquad
\textbf{(C) }96 \qquad
\textbf{(D) }97 \qquad
\textbf{(E) }625\qquad
$
Let $ABC$ be an acute-angled and non-isosceles triangle with orthocenter $H$. Let $O$ be the center of the circumscribed circle of triangle $ABC$ and let $K$ be center of the circumscribed circle of triangle $AHO$. Prove that the reflection of $K$ wrt $OH$ lies on $BC$.
Given $n>3$ points in the plane such that no three of the points are collinear. Does there exist a circle passing through (at least) $3$ of the given points and not containing any other of the $n$ points in its interior ?
Submit a positive integer less than or equal to $15$. Your goal is to submit a number that is close to the number of teams submitting it. If you submit $N$ and the total number of teams at the competition (including your own team) who submit $N$ is $T$, your score will be $\frac{2}{0.5|N-T|+1}$.
[i]2020 CCA Math Bonanza Lightning Round #5.4[/i]
Determine the polynomials P of two variables so that:
[b]a.)[/b] for any real numbers $t,x,y$ we have $P(tx,ty) = t^n P(x,y)$ where $n$ is a positive integer, the same for all $t,x,y;$
[b]b.)[/b] for any real numbers $a,b,c$ we have $P(a + b,c) + P(b + c,a) + P(c + a,b) = 0;$
[b]c.)[/b] $P(1,0) =1.$
In a country there are $n$ major cities, $n \ge 4$, connected by railroads, such that each city is directly connected to each other city. Each railroad company in that country has but only one train, which connects a series of cities, at least two, such that the train doesn’t pass through the same city twice in one shift. The companies divided the market such that any two cities are directly$^1$ connected only by one company. Prove that among any $n+1$ companies, there are two which have no common train station or there are two cities that are connected by two trains belonging to two of these $n+1$ companies.
$^1$ directly connected means that they are connected by a railroad, without no other station between them
What is the biggest shadow that a cube of side length $1$ can have, with the sun at its peak?
Note: "The biggest shadow of a figure with the sun at its peak" is understood to be the biggest possible area of the orthogonal projection of the figure on a plane.
Let $ABC$ be a triangle with circumcircle $\Omega$, circumcenter $O$ and orthocenter $H$. Let $S$ lie on $\Omega$ and $P$ lie on $BC$ such that $\angle ASP=90^\circ$, line $SH$ intersects the circumcircle of $\triangle APS$ at $X\neq S$. Suppose $OP$ intersects $CA,AB$ at $Q,R$, respectively, $QY,RZ$ are the altitude of $\triangle AQR$. Prove that $X,Y,Z$ are collinear.
[i]Proposed by Shuang-Yen Lee[/i]
Find the largest integer $N \in \{1, 2, \ldots , 2019 \}$ such that there exists a polynomial $P(x)$ with integer coefficients satisfying the following property: for each positive integer $k$, $P^k(0)$ is divisible by $2020$ if and only if $k$ is divisible by $N$. Here $P^k$ means $P$ applied $k$ times, so $P^1(0)=P(0), P^2(0)=P(P(0)),$ etc.
Mykhailo drew a triangular grid with side \( n \) for \( n \geq 2 \). It is formed from an equilateral triangle \( T \) with side length \( n \), by dividing each side into \( n \) equal parts. Then lines are drawn parallel to the sides of triangle \( T \), dividing it into \( n^2 \) equilateral triangles with side length \( 1 \), which we will call \textbf{cells}.
Next, Oleksii writes some positive integer into each cell. Mykhailo receives 1 candy for each cell, where the number written is equal to the sum of all the numbers in the adjacent cells. Oleksii wants to arrange the numbers in such a way that Mykhailo receives the maximum number of candies. How many candies can Mykhailo receive under such conditions?
In the figure below, an example is shown for \( n = 4 \) with 16 cells and numbers written inside them. For the numbers arranged as in the figure, Mykhailo receives 5 candies for the numbers \( 2 \) (the topmost cell), \( 8 \), \( 13 \), \( 12 \), and \( 11 \).
[img]https://i.ibb.co/LrLks9q/Kyiv-MO-2025-R2-7-1.png[/img]
[i]Proposed by Mykhailo Shtandenko[/i]
A rectangularly paper is divided in polygons areas in the following way: at every step one of the existing surfaces is cut by a straight line, obtaining two new areas. Which is the minimum number of cuts needed such that between the obtained polygons there exists $251$ polygons with $11$ sides?
Find all positive integers $a, b, c$ such that $a < b$, $a < 4c$, and $b c^3 \le a c^3 + b$.
Frodo composes a number triangle of zeroes and ones in such a way: he fills the topmost row with any $n$ digits, and in other rows he always writes $0$ under consecutive equal digits and writes $1$ under consecutive distinct digits. (An example of a triangle for $n=5$ is shown below.) In how many ways can Frodo fill the topmost row for $n=100$ so that each of $n$ rows of the triangle contains odd number of ones?\[\begin{smallmatrix}1\,0\,1\,1\,0\\1\,1\,0\,1\\0\,1\,1\\1\,0\\1\end{smallmatrix}\] (O. Rudenko and V. Brayman)
Prove that $x^3+y^3+z^3+t^3=1999$ has infinitely many soln. over $\mathbb{Z}$.
Let \[ E_n=(a_1-a_2)(a_1-a_3)\ldots(a_1-a_n)+(a_2-a_1)(a_2-a_3)\ldots(a_2-a_n)+\ldots+(a_n-a_1)(a_n-a_2)\ldots(a_n-a_{n-1}). \] Let $S_n$ be the proposition that $E_n\ge0$ for all real $a_i$. Prove that $S_n$ is true for $n=3$ and $5$, but for no other $n>2$.