A ball of mass $M$ and radius $R$ has a moment of inertia of $I=\frac{2}{5}MR^2$. The ball is released from rest and rolls down the ramp with no frictional loss of energy. The ball is projected vertically upward off a ramp as shown in the diagram, reaching a maximum height $y_{max}$ above the point where it leaves the ramp. Determine the maximum height of the projectile $y_{max}$ in terms of $h$. [asy] size(250); import roundedpath; path A=(0,0)--(5,-12)--(20,-12)--(20,-10); draw(roundedpath(A,1),linewidth(1.5)); draw((25,-10)--(12,-10),dashed+linewidth(0.5)); filldraw(circle((1.7,-1),1),lightgray); draw((25,-1)--(-1.5,-1),dashed+linewidth(0.5)); draw((23,-9.5)--(23,-1.5),Arrows(size=5)); label(scale(1.1)*"$h$",(23,-6.5),2*E); [/asy] (A) $h$ (B) $\frac{25}{49}h$ (C) $\frac{2}{5}h$ (D) $\frac{5}{7}h$ (E) $\frac{7}{5}h$

For every positive integer $n$ we define $a_{n}$ as the last digit of the sum $1+2+\cdots+n$. Compute $a_{1}+a_{2}+\cdots+a_{1992}$.

Suppose $p''(x) = 4x^2 + 4x + 2$ where $$p(x) = a_0 + a_1(x - 1) + a_2(x -2)^2 + a_3(x- 3)^4 + a_4(x-4)^4.$$ We have $p'(-3) = -24$ and $p(x)$ has the unique property that the sum of the third powers of the roots of $p(x)$ is equal to the sum of the fourth powers of the roots of $p(x)$ . Find $a_0$.

The $\textbf{symmetric difference}$, $\triangle$, of a pair of sets is the set of elements in exactly one set. For example, \[\{1,2,3\}\triangle\{2,3,4\}=\{1,4\}.\] There are fifteen nonempty subsets of $\{1,2,3,4\}$. Assign each subset to exactly one of the squares in the grid to the right so that the following conditions are satisfied. (i) If $A$ and $B$ are in squares connected by a solid line then $A\triangle B$ has exactly one element. (ii) If $A$ and $B$ are in squares connected by a dashed line then the largest element of $A$ is equal to the largest element of $B$. You do not need to prove that your configuration is the only one possible; you merely need to find a configuration that satisfies the constraints above. (Note: In any other USAMTS problem, you need to provide a full proof. Only in this problem is an answer without justification acceptable.) [asy] size(150); defaultpen(linewidth(0.8)); draw((0,1)--(0,3)--(3,3)^^(2,3)--(2,2)--(3,2)--(3,1)--(1,1)--(1,2)--(0,2)^^(2,1)--(2,0)--(0,0)); draw(origin--(0,1)^^(1,0)--(3,2)^^(1,1)--(0,2)^^(1,2)--(0,3)^^(1,3)--(2,2),linetype("4 4")); real r=1/4; path square=(r,r)--(r,-r)--(-r,-r)--(-r,r)--cycle; int limit; for(int i=0;i<=3;i=i+1) { if (i==0) limit=2; else limit=3; for(int j=0;j<=limit;j=j+1) filldraw(shift(j,i)*square,white); } [/asy]

Each cell of the checkered plane is colored in one of $n^2$ colors so that in any square of $n \times n$ cells all colors occur. It is known that in some line all the colors occur. Prove that there exists a column colored in exactly $n$ colors.

Let $\vartriangle ABC$ be a triangle with circumcenter $O$, orthocenter $H$, and circumcircle $\omega$. $AA'$, $BB'$ and $CC'$ are altitudes of $\vartriangle ABC$ with $A'$ in $BC$, $B'$ in $AC$ and $C'$ in $AB$. $P$ is a point on the segment $AA'$. The perpenicular line to $B'C'$ from $P$ intersects $BC$ at $K$. $AA'$ intersects $\omega$ at $M \ne A$. The lines $MK$ and $AO$ intersect at $Q$. Prove that $\angle CBQ = \angle PBA$.

Let $I$ be the incenter of triangle $ABC$, and $M, N$ be the midpoints of arcs $ABC$ and $BAC$ of its circumcircle. Prove that points $M, I, N$ are collinear if and only if$ AC + BC = 3AB$. (A. Polyansky)

Given a real number $C\leqslant 2$. Prove that for every positive real number $x,y$ with $xy=1$, the following inequality holds: \[ \sqrt{\frac{x^2+y^2}{2}} + \frac{C}{x+y} \geqslant 1 + \frac{C}{2}.\] [i]Proposed by Fajar Yuliawan, Indonesia[/i]

Let $x, y$, and $z$ be positive real numbers, such that $x^2 + y^2 + z^2 = 3$. Prove the inequality \[\frac{x^3}{2 + x} + \frac{y^3}{2 + y} + \frac{z^3}{2 + z} \ge 1.\] When does the equality hold?

suppose that $A$ is the set of all Closed intervals $[a,b] \subset \mathbb{R}$. Find all functions $f:\mathbb{R} \rightarrow A$ such that $\bullet$ $x \in f(y) \Leftrightarrow y \in f(x)$ $\bullet$ $|x-y|>2 \Leftrightarrow f(x) \cap f(y)=\varnothing$ $\bullet$ For all real numbers $0\leq r\leq 1$, $f(r)=[r^2-1,r^2+1]$ Proposed by Matin Yousefi

Let the bisector of the angle at $C$ of triangle $ABC$ intersect side $AB$ in point $D$. Show that the segment $CD$ is shorter than the geometric mean of the sides $CA$ and $CB$. (The geometric mean of two positive numbers is the square root of their product; the geometric mean of $n$ numbers is the $n$-th root of their product.

Find all positive primes of the form $4x^4 + 1$, for $x$ an integer.

Minimal distance of a finite set of different points in space is length of the shortest segment, whose both ends belong to this set and segment has length greater than $0$. a) Prove there exist set of $8$ points on sphere with radius $R$, whose minimal distance is greater than $1,15R$. b) Does there exist set of $8$ points on sphere with radius $R$, whose minimal distance is greater than $1,2R$?

We say that a set $S$ of positive integers is special when there exists a function $f : \mathbb{N}\to \mathbb{N}$ satisfying that: $\bullet$ $f(k)\in S, \forall k\in\mathbb{N}$ $\bullet$ No integer $k$ with $2\le k \le 2021$ can be written as $\frac{af(a)}{bf(b)}$ with $a,b\in \mathbb{N}$ Find the smallest positive integer $n$ such that the set $S = \{ 1, 2021, 2021^2, \ldots , 2021^n \}$ is special or prove that no such integer exists. Note: $\mathbb{N}$ represents the set $\{ 1, 2, 3, \ldots \}$

Given a square $ABCD,$ with $AB=1$ mark the midpoints $M$ and $N$ of $AB$ and $BC,$ respectively. A lasar beam shot from $M$ to $N,$ and the beam reflects of $BC,CD,DA,$ and comes back to $M.$ This path encloses a smaller area inside square $ABCD.$ Find this area.

For covering the floor of a rectangular room rectangular tiles of sizes $2 \times 2$ and $4 \times 1$ were used. Show that it's not possible to cover the floor if there is one plate less of one type and one more of the other type.

How many three-digit numbers are perfect squares?

In Durer’s duck school, there are six rows of doors, as seen on the diagram; both rows are made up of three doors. Dodo duck wishes to enter the school from the street in a way that she uses all six doors exactly once. (On her path, she may go to the street again, or leave the school, so long as she finishes her path in the school.) How many ways can she perform this? [i]Two paths are considered different if Dodo takes the doors in a different order.[/i] [img]https://cdn.artofproblemsolving.com/attachments/5/1/8b722eb2c642e8275928753921fdfbd7495df9.png[/img]

Find all real values of x, y, and z such that $$x - \sqrt{yz} = 42$$ $$y - \sqrt{xz}=6$$ $$z-\sqrt{xy}=30$$

In the Cartesian plane, each point with integer coordinates is colored either red, green, or blue. It is possible to form right isosceles triangles ($45^\circ - 90^\circ - 45^\circ$) using colored points as vertices. Prove that regardless of how the coloring is done, there always exists a right isosceles triangle such that all its vertices are either the same color or all different colors.

Nine distinct digits appear in the decimal expansion of $2^{29}$. Which digit is missing?

It is known that for every integer $n > 1$ there is a prime number among the numbers $n+1,n+2,...,2n-1.$ Determine all positive integers $n$ with the following property: Every integer $m > 1$ less than $n$ and coprime to $n$ is prime.

Prove that there exists a positive real number $C$ with the following property: for any integer $n\ge 2$ and any subset $X$ of the set $\{1,2,\ldots,n\}$ such that $|X|\ge 2$, there exist $x,y,z,w \in X$(not necessarily distinct) such that \[0<|xy-zw|<C\alpha ^{-4}\] where $\alpha =\frac{|X|}{n}$.

A lumberjack is building a non-degenerate triangle out of logs. Two sides of the triangle have lengths $\log 101$ and $\log 2018$. The last side of his triangle has side length $\log n$, where $n$ is an integer. How many possible values are there for $n$? [i]2018 CCA Math Bonanza Individual Round #6[/i]

Marjorie is the drum major of the world's largest marching band, with more than one million members. She would like the band members to stand in a square formation. To this end, she determines the smallest integer $n$ such that the band would fit in an $n \times n$ square, and lets the members form rows of $n$ people. However, she is dissatisfied with the result, since some empty positions remain. Therefore, she tells the entire first row of $n$ members to go home and repeats the process with the remaining members. Her aim is to continue it until the band forms a perfect square, but as it happens, she does not succeed until the last members are sent home. Determine the smallest possible number of members in this marching band.