Find the smallest number among the following numbers: $ \textbf{(A) }\sqrt{55}-\sqrt{52}\qquad\textbf{(B) }\sqrt{56}-\sqrt{53}\qquad\textbf{(C) }\sqrt{77}-\sqrt{74}\qquad\textbf{(D) }\sqrt{88}-\sqrt{85}\qquad\textbf{(E) }\sqrt{70}-\sqrt{67} $

Let $ABCD$ be a cyclic quadrilateral with circumcenter $O$. Rays $\displaystyle \overrightarrow{OB}$ and $\displaystyle \overrightarrow{DC}$ intersect at $E$, and rays $\displaystyle \overrightarrow{OC}$ and $\displaystyle \overrightarrow{AB}$ intersect at $F$. Suppose that $AE = EC = CF = 4$, and the circumcircle of $ODE$ bisects $\overline{BF}$. Find the area of triangle $ADF$. [i]Proposed by Howard Halim[/i]

Let $A_{1}A_{2}\ldots A_{9}$ be a regular $9-$gon. Let $\{A_{1},A_{2},\ldots,A_{9}\}=S_{1}\cup S_{2}\cup S_{3}$ such that $|S_{1}|=|S_{2}|=|S_{3}|=3$. Prove that there exists $A,B\in S_{1}$, $C,D\in S_{2}$, $E,F\in S_{3}$ such that $AB=CD=EF$ and $A \neq B$, $C\neq D$, $E\neq F$.

Prove that in every convex quadrilateral of area $1$, the sum of the lengths of the sides and diagonals is not smaller than $2(2+\sqrt2)$.

Let $n$ be a positive integer such that there exists a positive integer that is less than $\sqrt{n}$ and does not divide $n$. Let $(a_1, . . . , a_n)$ be an arbitrary permutation of $1, . . . , n$. Let $a_{i1} < . . . < a_{ik}$ be its maximal increasing subsequence and let $a_{j1} > . . . > a_{jl}$ be its maximal decreasing subsequence. Prove that tuples $(a_{i1}, . . . , a_{ik})$ and $(a_{j1}, . . . , a_{jl} )$ altogether contain at least one number that does not divide $n$.

Determine the values that \(n\) can take so that the equation in \( x \) $$ x^4-(3n+2)x^2+n^2=0$$ has four different real roots \( x_1\), \(x_2\), \(x_3\) and \(x_4\) in arithmetic progression. That is, they satisfy that $$x_4-x_3=x_3-x_2=x_2-x_1$$

Let $S$ be the domain in the coordinate plane determined by two inequalities: \[y\geq \frac 12x^2,\ \ \frac{x^2}{4}+4y^2\leq \frac 18.\] Denote by $V_1$ the volume of the solid by a rotation of $S$ about the $x$-axis and by $V_2$, by a rotation of $S$ about the $y$-axis. (1) Find the values of $V_1,\ V_2$. (2) Compare the size of the value of $\frac{V_2}{V_1}$ and 1.

Given a set $S=\{1,2,3,\ldots,3n\},(n\in N^*)$, let $T$ be a subset of $S$, such that for any $x, y, z\in T$ (not necessarily distinct) we have $x+y+z\not \in T$. Find the maximum number of elements $T$ can have.

Given an integer $n$ greater than $1$, suppose $x_1,x_2,\ldots,x_n$ are integers such that none of them is divisible by $n$, and neither their sum. Prove that there exists atleast $n-1$ non-empty subsets $\mathcal I\subseteq \{1,\ldots, n\}$ such that $\sum_{i\in\mathcal I}x_i$ is divisible by $n$

It is given a right-angled triangle $ABC$ and its circumcircle $k$. (a) prove that the radii of the circle $k_1$ tangent to the cathets of the triangle and to the circle $k$ is equal to the diameter of the incircle of the triangle ABC. (b) on the circle $k$ there may be found a point $M$ for which the sum $MA+MB+MC$ is as large as possible.

Let $h_a,h_b,h_c$ be the altitudes, and let $m_a,m_b,m_c$ be the medians of the acute triangle drawn to the sides $a, b, c$ respectively. Let $r$ and $R$ be the radii of the inscribed and circumscribed circles. Prove that $$\frac{m_a}{h_a}+\frac{m_b}{h_b}+\frac{m_c}{h_c} <1+\frac{R}{r}.$$

A bird starts with 300 ml of blood at 100 degrees in its body, 50 ml of blood at 0 degrees in its feet. Every minute, 50 ml of blood flows from the body to the feet, and 50 ml of blood at 40% of the body temperature flows from the feet to the body. The bird feels cold once its internal body temperature (not including the feet) falls below 60 degrees. Compute how many minutes it takes for the bird to feel cold. [i]2022 CCA Math Bonanza Team Round #6[/i]

In how many distinct ways can the letters of $\text{STANTON}$ be arranged?

If a $5 \times n$ rectangle can be tiled using $n$ pieces like those shown in the diagram, prove that $n$ is even. Show that there are more than $2 \cdot 3^{k-1}$ ways to file a fixed $5 \times 2k$ rectangle $(k \geq 3)$ with $2k$ pieces. (symmetric constructions are supposed to be different.)

How many ways are there to express 1000000 as a product of exactly three integers greater than 1? (For the purpose of this problem, $abc$ is not considered different from $bac$, etc.)

For any positive integer $n>1$, let $p(n)$ be the greatest prime factor of $n$. Find all the triplets of distinct positive integers $(x,y,z)$ which satisfy the following properties: $x,y$ and $z$ form an arithmetic progression, and $p(xyz)\leq 3.$

Let $P$ be a point outside the circle $C$. Find two points $Q$ and $R$ on the circle, such that $P,Q$ and $R$ are collinear and $Q$ is the midpopint of the segmenet $PR$. (Discuss the number of solutions).

Let $ P_1,P_2,P_3,P_4$ be points on the unit sphere. Prove that $ \sum_{i\neq j}\frac1{|P_i\minus{}P_j|}$ takes its minimum value if and only if these four points are vertices of a regular pyramid.

Let $\mathbb R_{>0}$ be the set of positive real numbers. Determine all functions $f \colon \mathbb R_{>0} \to \mathbb R_{>0}$ such that \[x \big(f(x) + f(y)\big) \geqslant \big(f(f(x)) + y\big) f(y)\] for every $x, y \in \mathbb R_{>0}$.

The expression $ 21x^2 \plus{} ax \plus{} 21$ is to be factored into two linear prime binomial factors with integer coefficients. This can be one if $ a$ is: $ \textbf{(A)}\ \text{any odd number} \qquad\textbf{(B)}\ \text{some odd number} \qquad\textbf{(C)}\ \text{any even number}$ $ \textbf{(D)}\ \text{some even number} \qquad\textbf{(E)}\ \text{zero}$

We say that a $2023$-tuple of nonnegative integers $(a_1,\hdots,a_{2023})$ is [i]sweet[/i] if the following conditions hold: [list] [*] $a_1+\hdots+a_{2023}=2023$ [*] $\frac{a_1}{2}+\frac{a_2}{2^2}+\hdots+\frac{a_{2023}}{2^{2023}}\le 1$ [/list] Determine the greatest positive integer $L$ so that \[a_1+2a_2+\hdots+2023a_{2023}\ge L\] holds for every sweet $2023$-tuple $(a_1,\hdots,a_{2023})$ [i]Ivan Novak[/i]

At a chess tournament, every pair of contestants played each other at most once. If any two con- testants, $A$ and $B$, failed to play each other, then exactly two other contestants, $C$ and $D$, played against both $A$ and $B$ during the tournament. Moreover, no $4$ contestants played exactly $5$ games between them. Prove that every contestant played the same number of games. [i]Authored by Mirko Petrushevski[/i]

A jar contains one quarter red jelly beans and three quarters blue jelly beans. If Chris removes three quarters of the red jelly beans and one quarter of the blue jelly beans, what percent of the jelly beans remaining in the jar will be red?

Let $ n$ be a positive integer such that $ \tfrac{1}{2}\plus{}\tfrac{1}{3}\plus{}\tfrac{1}{7}\plus{}\tfrac{1}{n}$ is an integer. Which of the following statements is [b]not[/b] true? $ \textbf{(A)}\ 2\text{ divides }n \qquad \textbf{(B)}\ 3\text{ divides }n \qquad \textbf{(C)}\ 6\text{ divides }n \qquad \textbf{(D)}\ 7\text{ divides }n \\ \textbf{(E)}\ n>84$

A collection of circles in the upper half-plane, all tangent to the $x$-axis, is constructed in layers as follows. Layer $L_0$ consists of two circles of radii $70^2$ and $73^2$ that are externally tangent. For $k\geq 1$, the circles in $\textstyle\bigcup_{j=0}^{k-1} L_j$ are ordered according to their points of tangency with the $x$-axis. For every pair of consecutive circles in this order, a new circle is constructed externally tangent to each of the two circles in the pair. Layer $L_k$ consists of the $2^{k-1}$ circles constructed in this way. Let $S=\textstyle\bigcup_{j=0}^6 L_j$, and for every circle $C$ denote by $r(C)$ its radius. What is \[\sum_{C\in S}\dfrac1{\sqrt{r(C)}}?\] [asy] import olympiad; size(350); defaultpen(linewidth(0.7)); // define a bunch of arrays and starting points pair[] coord = new pair[65]; int[] trav = {32,16,8,4,2,1}; coord[0] = (0,73^2); coord[64] = (2*73*70,70^2); // draw the big circles and the bottom line path arc1 = arc(coord[0],coord[0].y,260,360); path arc2 = arc(coord[64],coord[64].y,175,280); fill((coord[0].x-910,coord[0].y)--arc1--cycle,gray(0.78)); fill((coord[64].x+870,coord[64].y+425)--arc2--cycle,gray(0.78)); draw(arc1^^arc2); draw((-930,0)--(70^2+73^2+850,0)); // We now apply the findCenter function 63 times to get // the location of the centers of all 63 constructed circles. // The complicated array setup ensures that all the circles // will be taken in the right order for(int i = 0;i<=5;i=i+1) { int skip = trav[i]; for(int k=skip;k<=64 - skip; k = k + 2*skip) { pair cent1 = coord[k-skip], cent2 = coord[k+skip]; real r1 = cent1.y, r2 = cent2.y, rn=r1*r2/((sqrt(r1)+sqrt(r2))^2); real shiftx = cent1.x + sqrt(4*r1*rn); coord[k] = (shiftx,rn); } // Draw the remaining 63 circles } for(int i=1;i<=63;i=i+1) { filldraw(circle(coord[i],coord[i].y),gray(0.78)); }[/asy] $\textbf{(A) }\dfrac{286}{35}\qquad\textbf{(B) }\dfrac{583}{70}\qquad\textbf{(C) }\dfrac{715}{73}\qquad\textbf{(D) }\dfrac{143}{14}\qquad\textbf{(E) }\dfrac{1573}{146}$