Find all differentiable functions $f:(0,\infty) \to \mathbb{R}$ such that $$f(b)-f(a)=(b-a)f’(\sqrt{ab}) \qquad \text{for all}\qquad a,b>0.$$ [i]Proposed by Orif Ibrogimov, National University of Uzbekistan[/i]

Imagine the unit square in the plane to be a [i]carrom board[/i]. Assume the [i]striker[/i] is just a point, moving with no friction (so it goes forever), and that when it hits an edge, the angle of reflection is equal to the angle of incidence, as in real life. If the striker ever hits a corner it falls into the pocket and disappears. The trajectory of the striker is completely determined by its starting point $(x,y)$ and its initial velocity $\overrightarrow{(p,q)}$. If the striker eventually returns to its initial state (i.e. initial position and initial velocity), we define its [i]bounce number[/i] to be the number of edges it hits before returning to its initial state for the $1^{\text{st}}$ time. For example, the trajectory with initial state $[(.5,.5);\overrightarrow{(1,0)}]$ has bounce number $2$ and it returns to its initial state for the $1^{\text{st}}$ time in $2$ time units. And the trajectory with initial state $[(.25,.75);\overrightarrow{(1,1)}]$ has bounce number $4$. $\textbf{(a)}$ Suppose the striker has initial state $[(.5,.5);\overrightarrow{(p,q)}]$. If $p>q\geqslant 0$ then what is its velocity after it hits an edge for the $1^{\text{st}}$ time ? What if $q>p\geqslant 0$ ? $\textbf{(b)}$ Draw a trajectory with bounce number $5$ or justify why it is impossible. $\textbf{(c)}$ Consider the trajectory with initial state $[(x,y);\overrightarrow{(p,0)}]$ where $p$ is a positive integer. In how much time will the striker $1^{\text{st}}$ return to its initial state ? $\textbf{(d)}$ What is the bounce number for the initial state $[(x,y);\overrightarrow{(p,q)}]$ where $p,q$ are relatively prime positive integers, assuming the striker never hits a corner ?

[u]Discrete Math Round[/u] [b]p1.[/b] A class of six students has to split into two indistinguishable teams of three people. Compute the number of distinct team arrangements that can result. [b]p2.[/b] What is the probability that a randomly chosen factor of $2016$ is a perfect square? [b]p3.[/b] Compute the remainder when $$5\underbrace{666...6666}_{2016 \,\, sixes}5$$ is divided by $17$. [b]p4.[/b] At an M&M factory, two types of M&Ms are produced, red and blue. The M&Ms are transported individually on a conveyor belt. Anna is watching the conveyor belt, and has determined that four out of every five red M&Ms are followed by a blue one, while one out of every six blue M&Ms is followed by a red one. What proportion of the M&Ms are red? [b]p5.[/b] Three cards are chosen from a standard deck of $52$ without replacing them. Given that the ace of spades was chosen, what is the expected number of aces chosen? [b]p6.[/b] Moor decides that he needs a new email address, and forms the address by taking some permutation of the $12$ letters $MMMOOOOOORRR$. How many permutations of the letters will contain $MOOR$ in this exact order at least once? [b]p7.[/b] Suppose that the $8$ corners of a cube can be colored either red, green, or blue. We call a coloring of the cube rotationally symmetric if the cube can be rotated along a single axis parallel to an edge of a cube either $90^o$, $180^o$, or $270^o$, and reach the original coloring. How many rotationally symmetric colorings exist using the $3$ colors? Assume that any colorings which are identical after rotation are equivalent. [b]p8.[/b] Let $x = \frac{1}{9} + \frac{1}{99} + \frac{1}{999} + ...+ \frac{1}{999999999}$ . Compute the number of digits in the first $3000$ decimal places of the base $10$ representation of $x$ which are greater than or equal to $8$. [b]p9.[/b] Two $20$-sided dice are rolled. Their outcomes are independent and take uniformly distributed integer values from $1$ to $20$, inclusive. For each roll, let $x$ be (the sum of the dice) $\times $ (the positive difference of the dice). What is the expected value of $x$? [b]p10.[/b] Compute $$\sum^{1000}_{a=1} \sum^{1000}_{b=1} \sum^{1000}_{c=1} \left\lfloor \frac{1000}{lcm (a, b, c)} \right \rfloor \phi (a) \phi (b) \phi(c)$$ where $\phi (n) = | \{k : 1 \le k \le n, gcd (k, n) = 1\} |$ counts the integers coprime to $n$ that are less than or equal to $n$. [u]Discrete Math Tiebreaker[/u] [b]Tie 1.[/b] A certain elementary school has $48$ students in the third grade that must be organized into three classes of $16$ students each. There are three troublemakers in the grade. If the students are assigned independently and randomly to classes, what is the probability that all three trou blemakers are assigned to the same $16$ student class? [b]Tie 2.[/b] A $4$-digit number $x$ has the property that the expected value of the integer obtained from switching any two digits in $x$ is $4625$. Given that the sum of the digits of $x$ is $20$, compute $x$. [b]Tie 3.[/b] Let $S$ be the set of factors of $10^5$. The number of subsets of $S$ with a least common multiple of $10^5$ can be written as $2^n * m$, where $n$ and $m$ are positive integers and $m$ is not divisible by $2$. Compute $m + n$. PS. You should use hide for answers.

Consider a convex polyhedron $P$ with vertices $V_1,\ldots ,V_p$. The distinct vertices $V_i$ and $V_j$ are called [i]neighbours[/i] if they belong to the same face of the polyhedron. To each vertex $V_k$ we assign a number $v_k(0)$, and construct inductively the sequence $v_k(n)\ (n\ge 0)$ as follows: $v_k(n+1)$ is the average of the $v_j(n)$ for all neighbours $V_j$ of $V_k$ . If all numbers $v_k(n)$ are integers, prove that there exists the positive integer $N$ such that all $v_k(n)$ are equal for $n\ge N$ .

Find all triples $(a,b,c)$ of positive integers such that (i) $a \leq b \leq c$; (ii) $\text{gcd}(a,b,c)=1$; and (iii) $a^3+b^3+c^3$ is divisible by each of the numbers $a^2b, b^2c, c^2a$.

The Cincinnati Reals are playing the Houston Alphas in the last game of the Swirled Series. The Alphas are leading by $1$ run in the bottom of the $9\text{th}$ (last) inning, and the Reals are at bat. Each batter has a $\dfrac{1}{3}$ chance of hitting a single and a $\dfrac{2}{3}$ chance of making an out. If the Reals hit $5$ or more singles before they make $3$ outs, they will win. If the Reals hit exactly $4$ singles before they make $3$ outs, they will tie the game and send it into extra innings, and they will have a $\dfrac{3}{5}$ chance of eventually winning the game (since they have the added momentum of coming from behind). If the Reals hit fewer than $4$ singles, they will LOSE! What is the probability that the Alphas hold off the Reals and win, sending the packed Alphadome into a frenzy? Express the answer as a fraction.

A point is picked uniformly at random inside of a square. Four segments are then drawn in connecting the point to each of the vertices of the square, cutting the square into four triangles. What is the probability that at least two of the resulting triangles are obtuse?

Let $MATH$ be a trapezoid with $MA=AT=TH=5$ and $MH=11$. Point $S$ is the orthocenter of $\triangle ATH$. Compute the area of quadrilateral $MASH$.

Assume the $n$ sets $A_1, A_2..., A_n$ are a partition of the set $A=\{1,2,...,29\}$, and the sum of any elements in $A_i$ , $(i=1,2,...,n)$ is not equal to $30$. Find the smallest possible value of $n$.

Let $ABC$ be an acute-angled triangle, and let $D, E$ and $K$ be the midpoints of its sides $AB, AC$ and $BC$ respectively. Let $O$ be the circumcentre of triangle $ABC$, and let $M$ be the foot of the perpendicular from $A$ on the line $BC$. From the midpoint $P$ of $OM$ we draw a line parallel to $AM$, which meets the lines $DE$ and $OA$ at the points $T$ and $Z$ respectively. Prove that: (a) the triangle $DZE$ is isosceles (b) the area of the triangle $DZE$ is given by the formula \[E_{DZE}=\frac{BC\cdot OK}{8}\]

Given is a $K_{2024}$ in which every edge has weight $1$ or $2$. If every cycle has even total weight, find the minimal value of the sum of all weights in the graph.

Let $ABC$ be a triangle with $AB = 16$, $AC = 10$, $BC = 18$. Let $D$ be a point on $AB$ such that $4AD = AB$ and let E be the foot of the angle bisector from $B$ onto $AC$. Let $P$ be the intersection of $CD$ and $BE$. Find the area of the quadrilateral $ADPE$.

Let $S \subset Z^+$ be a set of positive integers with the following property: for any $a, b \in S$, if $a \ne b$ then $a + b$ is a perfect square. Given that $2009 \in S$ and $2087 \in S$, what is the maximum number of elements in $S$?

Let $\omega$ be the circumcircle of triangle $ABC$. Tangent lines to $\omega$ at points $A$ and $C$ intersect at $K$. Line $BK$ intersects $\omega$ for the second time at $M$. On the line $BC$ point $N$ is chosen such that $\angle BAN = 90$. Line $MN$ intersects $\omega$ for the second time at $D$. Prove that $BD=BC$ [i]P. Chernikova[/i]

Let $a,b,c\ge0$. Show that $(a^2+2bc)^{2012}+(b^2+2ca)^{2012}+(c^2+2ab)^{2012}\le (a^2+b^2+c^2)^{2012}+2(ab+bc+ca)^{2012}$. [i]Calvin Deng.[/i]

Point $P$ is taken on the extension of side $AB$ of an equilateral triangle $ABC$ so that $A$ is between $B$ and $P$. Denote by $a$ the side length of triangle $ABC$, by $r_1$ the inradius of triangle $PAC$, and by $r_2$ the exradius of triangle $PBC$ opposite $P$. Find the sum $r_1+r_2$ as a function in $a$.

How many diagonals does $11$-sided convex polygon have?

Let $I\subseteq \mathbb{R}$ be an interval and $f:I\rightarrow\mathbb{R}$ a function such that: \[|f(x)-f(y)|\le |x-y|,\quad\text{for all}\ x,y\in I. \] Show that $f$ is monotonic on $I$ if and only if, for any $x,y\in I$, either $f(x)\le f\left(\frac{x+y}{2}\right)\le f(y)$ or $f(y)\le f\left(\frac{x+y}{2}\right)\le f(x)$.

Positive integers $a,b,c$ satisfy that $a+b=b(a-c)$ and c+1 is a square of a prime. Prove that $a+b$ or $ab$ is a square.

Let $n$ a positive integer. We call a pair $(\pi ,C)$ composed by a permutation $\pi$$:$ {$1,2,...n$}$\rightarrow${$1,2,...,n$} and a binary function $C:$ {$1,2,...,n$}$\rightarrow${$0,1$} "revengeful" if it satisfies the two following conditions: $1)$For every $i$ $\in$ {$1,2,...,n$}, there exist $j$ $\in$ $S_{i}=${$i, \pi(i),\pi(\pi(i)),...$} such that $C(j)=1$. $2)$ If $C(k)=1$, then $k$ is one of the $v_{2}(|S_{k}|)+1$ highest elements of $S_{k}$, where $v_{2}(t)$ is the highest nonnegative integer such that $2^{v_{2}(t)}$ divides $t$, for every positive integer $t$. Let $V$ the number of revengeful pairs and $P$ the number of partitions of $n$ with all parts powers of $2$. Determine $\frac{V}{P}$.

Three members of the Euclid Middle School girls' softball team had the following conversation. Ashley: I just realized that our uniform numbers are all $2$-digit primes. Bethany: And the sum of your two uniform numbers is the date of my birthday earlier this month. Caitlin: That's funny. The sum of your two uniform numbers is the date of my birthday later this month. Ashley: And the sum of you two uniform numbers is today's date. What number does Caitlin wear? $\textbf{(A) }11\qquad\textbf{(B) }13\qquad\textbf{(C) }17\qquad\textbf{(D) }19\qquad \textbf{(E) }23$

There are $12$ monsters in a plane. Each monster is capable of spraying fire in a $30$-degree cone. Prove that monsters can destroy the plane.

Find all $x$ and $y$ which are rational multiples of $\pi$ with $0<x<y<\frac{\pi}{2}$ and $\tan x+\tan y =2$.

$p$ passengers get on a train with $n$ wagons. Find the probability of being at least one passenger at each wagon.

A triangle $OAB$ with $\angle A=90^{\circ}$ lies inside another triangle with vertex $O$. The altitude of $OAB$ from $A$ until it meets the side of angle $O$ at $M$. The distances from $M$ and $B$ to the second side of angle $O$ are $2$ and $1$ respectively. Find the length of $OA$.