Found problems: 106
2019 CMIMC, 4
Define a search algorithm called $\texttt{powSearch}$. Throughout, assume $A$ is a 1-indexed sorted array of distinct integers. To search for an integer $b$ in this array, we search the indices $2^0,2^1,\ldots$ until we either reach the end of the array or $A[2^k] > b$. If at any point we get $A[2^k] = b$ we stop and return $2^k$. Once we have $A[2^k] > b > A[2^{k-1}]$, we throw away the first $2^{k-1}$ elements of $A$, and recursively search in the same fashion. For example, for an integer which is at position $3$ we will search the locations $1, 2, 4, 3$.
Define $g(x)$ to be a function which returns how many (not necessarily distinct) indices we look at when calling $\texttt{powSearch}$ with an integer $b$ at position $x$ in $A$. For example, $g(3) = 4$. If $A$ has length $64$, find
\[g(1) + g(2) + \ldots + g(64).\]
2019 Benelux, 1
[list=a]
[*]Let $a,b,c,d$ be real numbers with $0\leqslant a,b,c,d\leqslant 1$. Prove that
$$ab(a-b)+bc(b-c)+cd(c-d)+da(d-a)\leqslant \frac{8}{27}.$$[/*]
[*]Find all quadruples $(a,b,c,d)$ of real numbers with $0\leqslant a,b,c,d\leqslant 1$ for which equality holds in the above inequality.
[/list]
2019 Macedonia Junior BMO TST, 5
Let $p_{1}$, $p_{2}$, ..., $p_{k}$ be different prime numbers. Determine the number of positive integers of the form $p_{1}^{\alpha_{1}}p_{2}^{\alpha_{2}}...p_{k}^{\alpha_{k}}$, $\alpha_{i}$ $\in$ $\mathbb{N}$ for which $\alpha_{1} \alpha_{2}...\alpha_{k}=p_{1}p_{2}...p_{k}$.
2019 MOAA, 9
Jonathan finds all ordered triples $(a, b, c)$ of positive integers such that $abc = 720$. For each ordered triple, he writes their sum $a + b + c$ on the board. (Numbers may appear more than once.) What is the sum of all the numbers written on the board?
2019 CMIMC, 8
It is given that the roots of the polynomial $P(z) = z^{2019} - 1$ can be written in the form $z_k = x_k + iy_k$ for $1\leq k\leq 2019$. Let $Q$ denote the monic polynomial with roots equal to $2x_k + iy_k$ for $1\leq k\leq 2019$. Compute $Q(-2)$.
2019 CMIMC, 5
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$.
2019 CMIMC, 9
There are 15 cities, and there is a train line between each pair operated by either the Carnegie Rail Corporation or the Mellon Transportation Company. A tourist wants to visit exactly three cities by travelling in a loop, all by travelling on one line. What is the minimum number of such 3-city loops?
2019 CMIMC, 12
Call a convex quadrilateral [i]angle-Pythagorean[/i] if the degree measures of its angles are integers $w\leq x \leq y \leq z$ satisfying $$w^2+x^2+y^2=z^2.$$ Determine the maximum possible value of $x+y$ for an angle-Pythagorean quadrilateral.
2019 Macedonia National Olympiad, 4
Determine all functions $f: \mathbb {N} \to \mathbb {N}$ such that
$n!\hspace{1mm} +\hspace{1mm} f(m)!\hspace{1mm} |\hspace{1mm} f(n)!\hspace{1mm} +\hspace{1mm} f(m!)$,
for all $m$, $n$ $\in$ $\mathbb{N}$.
2019 Purple Comet Problems, 15
Let $a, b, c$, and $d$ be prime numbers with $a \le b \le c \le d > 0$.
Suppose $a^2 + 2b^2 + c^2 + 2d^2 = 2(ab + bc - cd + da)$. Find $4a + 3b + 2c + d$.
2019 CMIMC, 3
Let $ABC$ be an equilateral triangle with side length $2$, and let $M$ be the midpoint of $\overline{BC}$. Points $X$ and $Y$ are placed on $AB$ and $AC$ respectively such that $\triangle XMY$ is an isosceles right triangle with a right angle at $M$. What is the length of $\overline{XY}$?
2019 ASDAN Math Tournament, 3
Consider an equilateral triangle $\vartriangle ABC$ with side length $1$. Let $D$ and $E$ lie on segments $AB$ and $AC$ respectively such that $\angle ADE = 30^o$ and $DE$ is tangent to the incircle of $\vartriangle ABC$. Compute the perimeter of $\vartriangle ADE$.
2019 CMIMC, 10
Define a [i]rooted tree[/i] to be a tree $T$ with a singular node designated as the [i]root[/i] of $T$. (Note that every node in the tree can have an arbitrary number of children.) Each vertex adjacent to the root node of $T$ is itself the root of some tree called a [i]maximal subtree[/i] of $T$.
Say two rooted trees $T_1$ and $T_2$ are [i]similar[/i] if there exists some way to cycle the maximal subtrees of $T_1$ to get $T_2$. For example, the first pair of trees below are similar but the second pair are not. How many rooted trees with $2019$ nodes are there up to similarity?
[center]
[img=500x100]https://i.imgur.com/8axcDvz.png[/img]
[/center]
2019 JBMO Shortlist, N1
Find all prime numbers $p$ for which there exist positive integers $x$, $y$, and $z$ such that the number
$x^p + y^p + z^p - x - y - z$
is a product of exactly three distinct prime numbers.
2019 Thailand Mathematical Olympiad, 5
Let $a,b,c$ be positive reals such that $abc=1$. Prove the inequality
$$\frac{4a-1}{(2b+1)^2} + \frac{4b-1}{(2c+1)^2} + \frac{4c-1}{(2a+1)^2}\geqslant 1.$$
2019 MOAA, 3
For how many ordered pairs of positive integers $(a, b)$ such that $a \le 50$ is it true that $x^2 - ax + b$ has integer roots?
2019 ISI Entrance Examination, 8
Consider the following subsets of the plane:$$C_1=\Big\{(x,y)~:~x>0~,~y=\frac1x\Big\} $$ and $$C_2=\Big\{(x,y)~:~x<0~,~y=-1+\frac1x\Big\}$$ Given any two points $P=(x,y)$ and $Q=(u,v)$ of the plane, their distance $d(P,Q)$ is defined by $$d(P,Q)=\sqrt{(x-u)^2+(y-v)^2}$$ Show that there exists a unique choice of points $P_0\in C_1$ and $Q_0\in C_2$ such that $$d(P_0,Q_0)\leqslant d(P,Q)\quad\forall ~P\in C_1~\text{and}~Q\in C_2.$$
2019 MOAA, 1
Jeffrey stands on a straight horizontal bridge that measures $20000$ meters across. He wishes to place a pole vertically at the center of the bridge so that the sum of the distances from the top of the pole to the two ends of the bridge is $20001$ meters. To the nearest meter, how long of a pole does Jeffrey need?
2019 ASDAN Math Tournament, 1
A square $ABCD$ and point $E$ are drawn in a plane such that lengths $DE < BE$ and $\vartriangle ACE$ is equilateral. Compute $\angle BAE$.
2019 CMIMC, 9
Let $a_0=29$, $b_0=1$ and $$a_{n+1} = a_n+a_{n-1}\cdot b_n^{2019}, \qquad b_{n+1}=b_nb_{n-1}$$ for $n\geq 1$. Determine the smallest positive integer $k$ for which $29$ divides $\gcd(a_k, b_k-1)$ whenever $a_1,b_1$ are positive integers and $29$ does not divide $b_1$.
2019 CMIMC, 2
For all positive integers $n$, let $f(n)$ return the smallest positive integer $k$ for which $\tfrac{n}{k}$ is not an integer. For example, $f(6) = 4$ because $1$, $2$, and $3$ all divide $6$ but $4$ does not. Determine the largest possible value of $f(n)$ as $n$ ranges over the set $\{1,2,\ldots, 3000\}$.
2019 India IMO Training Camp, P1
Let $a_1,a_2,\ldots, a_m$ be a set of $m$ distinct positive even numbers and $b_1,b_2,\ldots,b_n$ be a set of $n$ distinct positive odd numbers such that
\[a_1+a_2+\cdots+a_m+b_1+b_2+\cdots+b_n=2019\]
Prove that
\[5m+12n\le 581.\]
2019 ASDAN Math Tournament, 8
Let triangle $\vartriangle AEF$ be inscribed in a square $ABCD$ such that $E$ lies on $BC$ and $F$ lies on $CD$. If $\angle EAF = 45^o$ and $\angle BEA = 70^o$, compute $\angle CF E$.
2019 CMIMC, 8
A positive integer $n$ is [i]brgorable[/i] if it is possible to arrange the numbers $1, 1, 2, 2, ..., n, n$ such that between any two $k$'s there are exactly $k$ numbers (for example, $n=2$ is not brgorable, but $n = 3$ is as demonstrated by $3, 1, 2, 1, 3, 2$). How many brgorable numbers are less than 2019?
2019 China Team Selection Test, 1
$AB$ and $AC$ are tangents to a circle $\omega$ with center $O$ at $B,C$ respectively. Point $P$ is a variable point on minor arc $BC$. The tangent at $P$ to $\omega$ meets $AB,AC$ at $D,E$ respectively. $AO$ meets $BP,CP$ at $U,V$ respectively. The line through $P$ perpendicular to $AB$ intersects $DV$ at $M$, and the line through $P$ perpendicular to $AC$ intersects $EU$ at $N$. Prove that as $P$ varies, $MN$ passes through a fixed point.