Found problems: 85335
A convex hexagon $ABCDEF$ is given such that $AB||DE$, $BC||EF$, $CD||FA$. The point $M, N, K$ are common points of the lines $BD$ and $AE$, $AC$ and $DF$, $CE$ and $BF$ respectively. Prove that perpendiculars drawn from $M, N, K$ to lines $AB, CD, EF$ respectively concurrent.
A sequence of $X$s and $O$s is given, such that no three consecutive characters in the sequence are all the same, and let $N$ be the number of characters in this sequence. Maia may swap two consecutive characters in the sequence. After each swap, any consecutive block of three or more of the same character will be erased (if there are multiple consecutive blocks of three or more characters after a swap, then they will be erased at the same time), until there are no more consecutive blocks of three or more of the same character. For example, if the original sequence were $XXOOXOXO$ and Maia swaps the fifth and sixth character, the end result will be $$XXOOOXXO \to XXXXO \to O.$$ Find the maximum value $N$ for which Maia can’t necessarily erase all the characters after a series of swaps. Partial credit will be awarded for correct proofs of lower and upper bounds on $N$.
Alison is eating $2401$ grains of rice for lunch. She eats the rice in a very peculiar manner: every step, if she has only one grain of rice remaining, she eats it. Otherwise, she nds the smallest positive integer $d > 1$ for which she can group the rice into equal groups of size $d$ with none left over. She then groups the rice into groups of size $d$, eats one grain from each group, and puts the rice back into a single pile. How many steps does it take her to finish all her rice?
Integers $a,b,c$ are such that the values of the trinomials $bx^2+cx+a$ and $cx^2+ax+b$ at $x=1234$ coincide. Can the first trinomial at $x = 1$ take the value $2009$?
Let $A$ and $B$ be two spheres of different radii, both inscribed in a cone $K$. There are $m$ other, congruent spheres arranged in a ring such that each of them touches $A, B, K$ and two of the other spheres. Prove that this is possible for at most three values of $m.$
Let $n$ be an even positive integer. We consider rectangles with integer side lengths $k$ and $k +1$, where $k$ is greater than $\frac{n}{2}$ and at most equal to $n$. Show that for all even positive integers $ n$ the sum of the areas of these rectangles equals $$\frac{n(n + 2)(7n + 4)}{24}.$$
Let $\omega$ be the circumcircle of a triangle $ABC$. Denote by $M$ and $N$ the midpoints of the sides $AB$ and $AC$, respectively, and denote by $T$ the midpoint of the arc $BC$ of $\omega$ not containing $A$. The circumcircles of the triangles $AMT$ and $ANT$ intersect the perpendicular bisectors of $AC$ and $AB$ at points $X$ and $Y$, respectively; assume that $X$ and $Y$ lie inside the triangle $ABC$. The lines $MN$ and $XY$ intersect at $K$. Prove that $KA=KT$.
(a) What is the maximum area of a triangle with vertices in a given square (or on its boundary)?
(b) What is the maximum volume of a tetrahedron with vertices in a given cube (or on its boundary)?
Suppose we choose two numbers $x,y\in[0,1]$ uniformly at random. If the probability that the circle with center $(x,y)$ and radius $|x-y|$ lies entirely within the unit square $[0,1]\times [0,1]$ is written as $\tfrac{p}{q}$ with $p$ and $q$ relatively prime nonnegative integers, then what is $p^2+q^2$?
During a school year $44$ competitions were held. Exactly $7$ students won in each of the competitions. For any two competitions, there exists exactly $1$ student who won in both competitions. Is it true that there exists a student who won all of the competitions?
Ken has a six sided die. He rolls the die, and if the result is not even, he rolls the die one more time. Find the probability that he ends up with an even number.
[i]Proposed by Gabriel Wu[/i]
What is the maximal number of vertices of a convex polyhedron whose each face is either a regular triangle or a square?
Let $a, b$ and $c$ be real numbers such that $0 < a, b, c < 1$. Prove that:
$$\min \ \ \{ab(1 -c)^2, bc(1 - a)^2, ca(1 - b)^2 \} \le \frac{1}{16}.$$
Let $ a$ be a positive real number, in Euclidean space, consider the two disks:
$ D_1\equal{}\{(x,\ y,\ z)| x^2\plus{}y^2\leq 1,\ z\equal{}a\}$,
$ D_2\equal{}\{(x,\ y,\ z)| x^2\plus{}y^2\leq 1,\ z\equal{}\minus{}a\}$.
Let $ D_1$ overlap to $ D_2$ by rotating $ D_1$ about the $ y$ axis by $ 180^\circ$. Note that the rotational direction is supposed to be the direction such that we would lean the postive part of the $ z$ axis to into the direction of the postive part of $ x$ axis. Let denote $ E$ the part in which $ D_1$ passes while the rotation, let denote $ V(a)$ the volume of $ E$ and let $ W(a)$ be the volume of common part of $ E$ and $ \{(x,\ y,\ z)|x\geq 0\}$.
(1) Find $ W(a)$.
(2) Find $ \lim_{a\rightarrow \infty} V(a)$.
Convex quadrilateral $ABCD$ is described on a circle $\omega$, and is not a trapezius inscribed in a circle. Let the tangency points of $\omega$ and $AB, BC, CD, DA$ be $K, L, M, N$ respectively. A circle with a center $I_K$, different from $\omega$ is tangent to the segement $AB$ and lines $AD, BC$. A circle with center $I_L$, different from $\omega$ is tangent to segment $BC$ and lines $AB, CD$. A circle with center $I_M$, different from $\omega$ is tangent to segment $CD$ and lines $AD, BC$. A circle with center $I_N$, different from $\omega$ is tangent to segment $AD$ and lines $AB, CD$. Prove that the lines $I_KK, I_LL, I_MM, I_NN$ are concurrent.
A convex $ABCDE$ is inscribed in a unit circle, $AE$ being its diameter. If $AB = a$, $BC = b$, $CD = c$, $DE = d$ and $ab = cd =\frac{1}{4}$, compute $AC + CE$ in terms of $a, b, c, d.$
Last year Mr. John Q. Public received an inheritance. He paid $20\%$ in federal taxes on the inheritance, and paid $10\%$ of what he has left in state taxes. He paid a total of $ \$10,500$ for both taxes. How many dollars was the inheritance?
$ \textbf{(A)}\ 30,000 \qquad \textbf{(B)}\ 32,500 \qquad \textbf{(C)}\ 35,000 \qquad \textbf{(D)}\ 37,500 \qquad \textbf{(E)}\ 40,000$
Let $ABCD$ be a cyclic quadrilateral inscribed in circle $\omega$. Let $F_A, F_B, F_C$ and $F_D$ be the midpoints of arcs $AB, BC, CD$ and $DA$ of $\omega$. Let $I_A, I_B, I_C$ and $I_D$ be the incenters of triangles $DAB, ABC, BCD$ and $CDA$, respectively.
Let $\omega_A$ denote the circle that is tangent to $\omega$ at $F_A$ and also tangent to line segment $CD$. Similarly, let $\omega_C$ denote the circle that is tangent to $\omega$ at $F_C$ and tangent to line segment $AB$.
Finally, let $T_B$ denote the second intersection of $\omega$ and circle $F_BI_BI_C$ different from $F_B$, and let $T_D$ denote the second intersection of $\omega$ and circle $F_DI_DI_A$.
Prove that the radical axis of circles $\omega_A$ and $\omega_C$ passes through points $T_B$ and $T_D$.
Find all positive integers $x$ and $y$ such that $${x \choose y} = 1432$$
Emperor Zorg wishes to found a colony on a new planet. Each of the $n$ cities that he will establish there will have to speak exactly one of the Empire's $2020$ official languages. Some towns in the colony will be connected by a direct air link, each link can be taken in both directions. The emperor fixed the cost of the ticket for each connection to $1$ galactic credit. He wishes that, given any two cities speaking the same language, it is always possible to travel from one to the other via these air links, and that the cheapest trip between these two cities costs exactly $2020$ galactic credits. For what values of $n$ can Emperor Zorg fulfill his dream?
The point $P_1, P_2,\cdots ,P_{2018} $ is placed inside or on the boundary of a given regular pentagon. Find all placement methods are made so that $$S=\sum_{1\leq i<j\leq 2018}|P_iP_j| ^2$$takes the maximum value.
Let $\phi(n)$ be the number of positive integers $k<n$ which are relatively prime to $n$. For how many distinct values of $n$ is $\phi(n)$ equal to $12$?
$\textbf{(A) }0\hspace{14em}\textbf{(B) }1\hspace{14em}\textbf{(C) }2$
$\textbf{(D) }3\hspace{14em}\textbf{(E) }4\hspace{14em}\textbf{(F) }5$
$\textbf{(G) }6\hspace{14em}\textbf{(H) }7\hspace{14em}\textbf{(I) }8$
$\textbf{(J) }9\hspace{14.2em}\textbf{(K) }10\hspace{13.5em}\textbf{(L) }11$
$\textbf{(M) }12\hspace{13.3em}\textbf{(N) }13$
Let $k$,$n$ be positive integers, $k,n>1$, $k<n$ and a $n \times n$ grid of unit squares is
given. Ana and Maya take turns in coloring the grid in the following way: in each turn, a unit square is colored black in such a way that no two black cells have a common side or vertex. Find the smallest positive integer $n$ , such that they can obtain a configuration in which each row and column contains exactly $k$ black cells. Draw one example.
If $15$ and $9$ are lengths of two medians of a triangle, what is the maximum possible area of the triangle to the nearest integer ?
Find the minimum value of $$K(x,y)=16\frac{x^3}{y}+\frac{y^3}{x}-\sqrt{xy}$$
where $x,y$ are the real allowed values