Found problems: 85335
Let $m_1,m_2,...,m_{2013} > 1$ be 2013 pairwise relatively prime positive integers and $A_1,A_2,...,A_{2013}$ be 2013 (possibly empty) sets with $A_i\subseteq \{1,2,...,m_i-1\}$ for $i=1,2,...,2013$. Prove that there is a positive integer $N$ such that
\[ N \le \left( 2\left\lvert A_1 \right\rvert + 1 \right)\left( 2\left\lvert A_2 \right\rvert + 1 \right)\cdots\left( 2\left\lvert A_{2013} \right\rvert + 1 \right) \]
and for each $i = 1, 2, ..., 2013$, there does [i]not[/i] exist $a \in A_i$ such that $m_i$ divides $N-a$.
[i]Proposed by Victor Wang[/i]
In a convex quadrilateral. eight segments are drawn, each of them connects a vertex with the midpoint of some opposite side. Seven of these segments have the same length $ a$. Prove that the eight one is also of length $ a$.
Convex quadrilateral $ABCD$ has $\angle ABC = \angle CDA = 90^{\circ}$. Point $H$ is the foot of the perpendicular from $A$ to $BD$. Points $S$ and $T$ lie on sides $AB$ and $AD$, respectively, such that $H$ lies inside triangle $SCT$ and \[
\angle CHS - \angle CSB = 90^{\circ}, \quad \angle THC - \angle DTC = 90^{\circ}. \] Prove that line $BD$ is tangent to the circumcircle of triangle $TSH$.
Call an [i]ordered[/i] triple $(a,b,c)$ [i]$d$-tall[/i] if there exists a triangle with side lengths $a,b,c$ and the height to the side with length $a$ is $d$. Suppose that for some positive integer $k$, there are exactly $210$ $k$-tall ordered triples of positive integers. How many $k$-tall ordered triples $(a,b,c)$ are there such that a triangle $ABC$ with $BC=a,CA=b,AB=c$ satisfies both $\angle{B}<90^\circ$ and $\angle{C}<90^\circ$?
[i]2020 CCA Math Bonanza Team Round #8[/i]
Suppose two convex quadrangles in the plane $P$ and $P'$, share a point $O$ such that, for every line $l$ trough $O$, the segment along which $l$ and $P$ meet is longer then the segment along which $l$ and $P'$ meet. Is it possible that the ratio of the area of $P'$ to the area of $P$ is greater then $1.9$?
Find all positive integers $k$ such that the product of the first $k$ primes increased by $1$ is a power of an integer (with an exponent greater than $1$).
Moor owns $3$ shirts, one each of black, red, and green. Moor also owns $3$ pairs of pants, one each of white, red, and green. Being stylish, he decides to wear an outfit consisting of one shirt and one pair of pants that are different colors. How many combinations of shirts and pants can Moor choose?
In a certain triangle $ABC$, there are points $K$ and $M$ on sides $AB$ and $AC$, respectively, such that if $L$ is the intersection of $MB$ and $KC$, then both $AKLM$ and $KBCM$ are cyclic quadrilaterals with the same size circumcircles. Find the measures of the interior angles of triangle $ABC$.
A $100 \times 100$ table is given. At the beginning, every unit square has number $"0"$ written in them. Two players playing a game and the game stops after $200$ steps (each player plays $100$ steps).
In every step, one can choose a row or a column and add $1$ to the written number in all of it's squares $\pmod 3.$
First player is the winner if more than half of the squares ($5000$ squares) have the number $"1"$ written in them,
Second player is the winner if more than half of the squares ($5000$ squares) have the number $"0"$ written in them. Otherwise, the game is draw.
Assume that both players play at their best. What will be the result of the game ?
[i]Proposed by Mahyar Sefidgaran[/i]
Let $x_0+\sqrt{2003}y_0$ be the minimum positive integer root of Pell function $x^2-2003y^2=1$. Find all the positive integer solutions $(x,y)$ of the equation, such that $x_0$ is divisible by any prime factor of $x$.
In triangle $ABC$, let $\omega$ be the excircle opposite to $A$. Let $D, E$ and $F$ be the points where $\omega$ is tangent to $BC, CA$, and $AB$, respectively. The circle $AEF$ intersects line $BC$ at $P$ and $Q$. Let $M$ be the midpoint of $AD$. Prove that the circle $MPQ$ is tangent to $\omega$.
What is the rightmost nonzero digit of $1000000!$?
White and black checkers are put on the squares of an $n\times n$ chessboard $(n\ge2)$ according to the following rule. Initially, a black checker is put on an arbitrary square. In every consequent step, a white checker is put on a free square, whereby all checkers on the squares neighboring by side are replaced by checkers of the opposite colors. This process is continued until there is a checker on every square. Prove that in the final configuration there is at least one black checker.
Let $ABC$ be a triangle with $\angle A = 90$ and let $D$ be the orthogonal projection of $A$ onto $BC$. The midpoints of $AD$ and $AC$ are called $E$ and $F$, respectively. Let $M$ be the circumcentre of $BEF$. Prove that
$AC$ and $ BM$ are parallel.
Let $A$ be a finite set, and $A_1,A_2,\cdots, A_n$ are subsets of $A$ with the following conditions:
(1) $|A_1|=|A_2|=\cdots=|A_n|=k$, and $k>\frac{|A|}{2}$;
(2) for any $a,b\in A$, there exist $A_r,A_s,A_t\,(1\leq r<s<t\leq n)$ such that
$a,b\in A_r\cap A_s\cap A_t$;
(3) for any integer $i,j\, (1\leq i<j\leq n)$, $|A_i\cap A_j|\leq 3$.
Find all possible value(s) of $n$ when $k$ attains maximum among all possible systems $(A_1,A_2,\cdots, A_n,A)$.
Let $ a,b$ be $ 2$ distinct positive interger number such that $ (a^2\plus{}ab\plus{}b^2)|ab(a\plus{}b)$. Prove that: $ |a\minus{}b|>\sqrt [3] {ab}$.
Let be a number $ a\in \left[ 1,\infty \right) $ and a function $ f\in\mathcal{C}^2(-a,a) . $ Show that the sequence
$$ \left( \sum_{k=1}^n f\left( \frac{k}{n^2} \right) \right)_{n\ge 1} $$
is convergent, and determine its limit.
Let $k>1$ be an integer. The sequence $a_1,a_2, \cdots$ is defined as:
$a_1=1, a_2=k$ and for all $n>1$ we have: $a_{n+1}-(k+1)a_n+a_{n-1}=0$
Find all positive integers $n$ such that $a_n$ is a power of $k$.
[i]Proposed by Amirhossein Pooya[/i]
Two circles $C_1$ and $C_2$ intersect each other at points $A$ and $B$. Their external common tangent (closer to $B$) touches $C_1$ at $P$ and $C_2$ at $Q$. Let $C$ be the reflection of $B$ in line $PQ$. Prove that $\angle CAP=\angle BAQ$.
Consider a function $f: R \to R$ that fulfills the following two properties: $f$ is periodic of period $5$ (that is, for all $x\in R$, $f (x + 5) = f (x)$), and by restricting $f$ to the interval $[-2,3]$, $f$ coincides to $x^2$. Determine the value of $f(2018).$
In $\triangle ABC$, we have three edges with lengths $BC=a, \, CA=b \, AB=c$, and $c<b<a<2c$. $P$ and $Q$ are two points of the edges of $\triangle ABC$, and the straight line $PQ$ divides $\triangle ABC$ into two parts with the same area. Find the minimum value of the length of the line segment $PQ$.
Consider the set of complex numbers $z$ satisfying $|1+z+z^{2}|=4$. The maximum value of the imaginary part of $z$ can be written in the form $\tfrac{\sqrt{m}}{n}$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$?
$\textbf{(A)}~20\qquad\textbf{(B)}~21\qquad\textbf{(C)}~22\qquad\textbf{(D)}~23\qquad\textbf{(E)}~24$
Let $0<\alpha<1$ be a fixed number. On a lake shaped like a convex polygon, at some point there is a duck and at another point a water lily grows. If the duck is at point $X{}$, then in one move it can swim towards one of the vertices $Y$ of the polygon a distance equal to a $\alpha\cdot XY$. Find all $\alpha{}$ for which, regardless of the shape of the lake and the initial positions of the duck and the lily, after a sequence of adequate moves, the distance between the duck and the lily will be at most one meter.
In a triangle $ABC$ with an angle $\angle CAB =30^o$ draw median $CD$. If the formed $\vartriangle ACD$ is isosceles, find tan $\angle DCB$.
The management of a secret society is made up of $4$ people. To admit new partners they use the following criteria:
$\bullet$ Only the $4$ members of the directory vote, being able to do it in $3$ ways: in favor, against or abstaining.
$\bullet$ Each aspiring partner must obtain at least $2$ votes in favor and none against.
At the last management meeting, $8$ requests for admission were examined. Of the total votes cast, there were $23$ votes in favor, $2$ votes against and $7$ abstaining. What is the highest and what is the lowest value that the number of approved admission requests can have on that occasion?