Prove that a tetrahedron with just one edge length greater than $1$ has volume at most $ \frac{1}{8}.$

Let $\triangle ABC$ have $AB=9$ and $AC=10$. A semicircle is inscribed in $\triangle ABC$ with its center on segment $BC$ such that it is tangent $AB$ at point $D$ and $AC$ at point $E$. If $AD=2DB$ and $r$ is the radius of the semicircle, $r^2$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m+n$. [i]Proposed by Andy Xu[/i]

Both roots of the quadratic equation $ x^2 \minus{} 63x \plus{} k \equal{} 0$ are prime numbers. The number of possible values of $ k$ is $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ \textbf{more than four}$

Consider the parametric function $ f_k:\mathbb{R}\longrightarrow\mathbb{R}, f(x)=x+k\lfloor x \rfloor . $ [b]a)[/b] For which integer values of $ k $ the above function is injective? [b]b)[/b] For which integer values of $ k $ the above function is surjective? [b]c)[/b] Given two natural numbers $ n,m, $ create two bijective functions: $$ \phi : f_m (\mathbb{R} )\cap [0,\infty )\longrightarrow f_n(\mathbb{R})\cap [0,\infty ) $$ $$ \psi : \left(\mathbb{R}\setminus f_m (\mathbb{R})\right)\cap [0,\infty )\longrightarrow\left(\mathbb{R}\setminus f_n (\mathbb{R})\right)\cap [0,\infty ) $$ [i]Cristinel Mortici[/i]

A college student drove his compact car $ 120$ miles home for the weekend and averaged $ 30$ miles per gallon. On the return trip the student drove his parents' SUV and averaged only $ 20$ miles per gallon. What was the average gas mileage, in miles per gallon, for the round trip? $ \textbf{(A)}\ 22 \qquad \textbf{(B)}\ 24 \qquad \textbf{(C)}\ 25 \qquad \textbf{(D)}\ 26 \qquad \textbf{(E)}\ 28$

The sum $$\sum_{k=84}^{8000}{k \choose 84}{{8084 - k} \choose 84}$$ can be written as a binomial coefficient $a \choose b$ for integers $a, b$. Find a possible pair $(a, b)$

Seven chips are numbered $1, 2, 3, 4, 5, 6, 7$. Prove that none of the seven-digit numbers formed by these chips is divisible by any other of these seven-digit numbers.

Find all one-to-one mappings $f:\mathbb{N}\to\mathbb{N}$ such that for all positive integers $n$ the following relation holds: \[ f(f(n)) \leq \frac {n+f(n)} 2 . \]

A grasshopper rests on the point $(1,1)$ on the plane. Denote by $O,$ the origin of coordinates. From that point, it jumps to a certain lattice point under the condition that, if it jumps from a point $A$ to $B,$ then the area of $\triangle AOB$ is equal to $\frac 12.$ $(a)$ Find all the positive integral poijnts $(m,n)$ which can be covered by the grasshopper after a finite number of steps, starting from $(1,1).$ $(b)$ If a point $(m,n)$ satisfies the above condition, then show that there exists a certain path for the grasshopper to reach $(m,n)$ from $(1,1)$ such that the number of jumps does not exceed $|m-n|.$

Let $ABCD$ be an isosceles trapezoid with $\overline{BC}\parallel \overline{AD}$ and $AB=CD$. Points $X$ and $Y$ lie on diagonal $\overline{AC}$ with $X$ between $A$ and $Y$, as shown in the figure. Suppose $\angle AXD = \angle BYC = 90^\circ$, $AX = 3$, $XY = 1$, and $YC = 2$. What is the area of $ABCD?$ [asy] size(6cm); usepackage("mathptmx"); import geometry; void perp(picture pic=currentpicture, pair O, pair M, pair B, real size=5, pen p=currentpen, filltype filltype = NoFill){ perpendicularmark(pic, M,unit(unit(O-M)+unit(B-M)),size,p,filltype); } pen p=black+linewidth(1),q=black+linewidth(5); pair C=(0,0),Y=(2,0),X=(3,0),A=(6,0),B=(2,sqrt(5.6)),D=(3,-sqrt(12.6)); draw(A--B--C--D--cycle,p); draw(A--C,p); draw(B--Y,p); draw(D--X,p); dot(A,q); dot(B,q); dot(C,q); dot(D,q); dot(X,q); dot(Y,q); label("2",C--Y,S); label("1",Y--X,S); label("3",X--A,S); label("$A$",A,E); label("$B$",B,N); label("$C$",C,W); label("$D$",D,S); label("$Y$",Y,sqrt(2)*NE); label("$X$",X,N); perp(B,Y,C,8,p); perp(A,X,D,8,p); [/asy] $\textbf{(A)}\: 15\qquad\textbf{(B)} \: 5\sqrt{11}\qquad\textbf{(C)} \: 3\sqrt{35}\qquad\textbf{(D)} \: 18\qquad\textbf{(E)} \: 7\sqrt{7}$

Let be a natural number $ n\ge 2, $ a real number $ \lambda , $ and let be the set $$ H_{\lambda }=\left\{ \left( h_k^l \right)_{1\le k\le n}^{1\le l\le n}\in\mathcal{M}_n\left(\mathbb{R}\right) \bigg| \lambda =\sum_{k,l=1}^n h_k^l \right\} . $$ Prove the following statements. [b]a)[/b] The sets of symmetric and antisymmetric matrices from $ \mathcal{M}_n\left(\mathbb{R}\right) $ are subgroups of the additive subgroup $ \mathcal{M}_n\left(\mathbb{R}\right) , $ and any matrix from $ \mathcal{M}_n\left(\mathbb{R}\right) $ is a sum of a symmetric and antisymmetric matrix from $ \mathcal{M}_n\left(\mathbb{R}\right) . $ [b]b)[/b] $ \left( H_{\lambda },+\right)\le\left( \mathcal{M}_n\left(\mathbb{R}\right) ,+ \right)\iff \lambda =0 $ [b]c)[/b] There is a commutative group formed with the elements of $ H_{\lambda } $ if $ \lambda\neq 0. $ [i]Dan Negulescu[/i]

Let $P(x)$ be a polynomial with the coefficients being $0$ or $1$ and degree $2023$. If $P(0)=1$, then prove that every real root of this polynomial is less than $\frac{1-\sqrt{5}}{2}$.

Three fair six-sided dice are rolled. What is the probability that the values shown on two of the dice sum to the value shown on the remaining die? $ \textbf{(A)}\ \dfrac16\qquad\textbf{(B)}\ \dfrac{13}{72}\qquad\textbf{(C)}\ \dfrac7{36}\qquad\textbf{(D)}\ \dfrac5{24}\qquad\textbf{(E)}\ \dfrac29 $

Given $\triangle ABC$, let $I,O,\Gamma$ denote its incenter, circumcenter and circumcircle respecitvely. Let $AI$ intersect $\Gamma$ at $M(\neq A)$. Circle $\omega$ is tangent to $AB$, $AC$ and $\Gamma$ internally at $T$ (i.e. the mixtilinear incircle opposite $A$). Let the tangents at $A$ and $T$ to $\Gamma$ meet at $P$, and let $PI$ and $TM$ intersect at $Q$. Prove that $QA$ and $MO$ intersect at a point on $\Gamma$.

In a summer camp there are $n$ girls $D_1,D_2, ... ,D_n$ and $2n-1$ boys $C_1,C_2, ...,C_{2n-1}$. The girl $D_i, i = 1,2,... ,n,$ knows only the boys $C_1,C_2, ... ,C_{2i-1}$. Let $A(n, r)$ be the number of different ways in which $r$ girls can dance with $r$ boys forming $r$ pairs, each girl with a boy she knows. Prove that $A(n, r) = \binom{n}{r} \frac{r!}{(n-r)!}.$

Nine points, no three of which lie on the same straight line, are located inside an equilateral triangle of side $4$. Prove that some three of these points are vertices of a triangle whose area is not greater than $\sqrt3$.

$ABCD$ is a circumscribed and inscribed quadrilateral. $O$ is the circumcenter of the quadrilateral. $E,F$ and $S$ are the intersections of $AB,CD$ , $AD,BC$ and $AC,BD$ respectively. $E'$ and $F'$ are points on $AD$ and $AB$ such that $A\hat{E}E'=E'\hat{E}D$ and $A\hat{F}F'=F'\hat{F}B$. $X$ and $Y$ are points on $OE'$ and $OF'$ such that $\frac{XA}{XD}=\frac{EA}{ED}$ and $\frac{YA}{YB}=\frac{FA}{FB}$. $M$ is the midpoint of arc $BD$ of $(O)$ which contains $A$. Prove that the circumcircles of triangles $OXY$ and $OAM$ are coaxal with the circle with diameter $OS$.

Find the largest integer $k$ ($k \ge 2$), for which there exists an integer $n$ ($n \ge k$) such that from any collection of $n$ consecutive positive integers one can always choose $k$ numbers, which verify the following conditions: 1. each chosen number is not divisible by $6$, by $7$, nor by $8$; 2. the positive difference of any two distinct chosen numbers is not divisible by at least one of the numbers $6$, $7$, and $8$.

Determine the maximum possible value of \[\frac{\left(x^2+5x+12\right)\left(x^2+5x-12\right)\left(x^2-5x+12\right)\left(-x^2+5x+12\right)}{x^4}\] over all non-zero real numbers $x$. [i]2019 CCA Math Bonanza Lightning Round #3.4[/i]

Let $n \ge 3$ be a positive integer. Determine, in terms of $n$, how many triples of sets $(A,B,C)$ satisfy the conditions: $\bullet$ $A, B$ and $C$ are pairwise disjoint , that is, $A \cap B = A \cap C= B \cap C= \emptyset$. $\bullet$ $A \cup B \cup C= \{ 1 , 2 , ... , n \}$. $\bullet$ The sum of the elements of $A$, the sum of the elements of $B$ and the sum of the elements of $C$ leave the same remainder when divided by $3$. Note: One or more of the sets may be empty.

Is it possible to inscribe an $N$-gon in a circle so that all the lengths of its sides are different and all its angles (in degrees) are integer, where a) $N = 19$, b) $N = 20$ ? Mikhail Malkin

A train from stop $A$ to stop $B$ is traveled in $X$ minutes ($0 <X <60$). It is known that when starting from $A$, as well as when arriving at $B$, the angle formed by the hour and the minute had measure equal to $X$ degrees. Find $X $.

Tommy takes a 25-question true-false test. He answers each question correctly with independent probability $\frac{1}{2}$. Tommy earns bonus points for correct streaks: the first question in a streak is worth 1 point, the second question is worth 2 points, and so on. For instance, the sequence TFFTTTFT is worth 1 + 1 + 2 + 3 + 1 = 8 points. Compute the expected value of Tommy’s score.

There are $m$ identical two-pan weighting scales. One of them is broken and it shows any outcome, at random. The other scales always show the correct outcome. Moreover, the weight of the broken scale differs from those of the other scales, which are all equal. At a move, we may choose a scale and place some of the other scales on its pans. Determine the greatest value of $m$ for which we may find the broken scale with no more than three moves. [i]Proposed by A. Gribalko and O. Manzhina[/i]

Let $ P_1$ be a regular $ r$-gon and $ P_2$ be a regular $ s$-gon $ (r\geq s\geq 3)$ such that each interior angle of $ P_1$ is $ \frac {59}{58}$ as large as each interior angle of $ P_2$. What's the largest possible value of $ s$?