An object is released from rest and falls a distance $h$ during the first second of time. How far will it fall during the next second of time? $ \textbf{(A)}\ h\qquad\textbf{(B)}\ 2h \qquad\textbf{(C)}\ 3h \qquad\textbf{(D)}\ 4h\qquad\textbf{(E)}\ h^2 $

Find the number of ways that a positive integer $n$ can be represented as a sum of one or more consecutive positive integers.

Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.

Given the following six statements: $\text{(1) All women are good drivers}$ $\text{(2) Some women are good drivers}$ $\text{(3) No men are good drivers}$ $\text{(4) All men are bad drivers}$ $\text{(5) At least one man is a bad driver}$ $\text{(6) All men are good drivers.}$ The statement that negates statement $\text{(6)}$ is: $ \textbf{(A) }(1)\qquad\textbf{(B) }(2)\qquad\textbf{(C) }(3)\qquad\textbf{(D) }(4)\qquad\textbf{(E) }(5) $

A square grid on the Euclidean plane consists of all points $(m,n)$, where $m$ and $n$ are integers. Is it possible to cover all grid points by an infinite family of discs with non-overlapping interiors if each disc in the family has radius at least $5$?

Let $f: \mathbb Z^+ \to \mathbb Z$ be a function such that [b]a)[/b] $f(p)=1$ for every prime $p$. [b]b)[/b] $f(xy)=xf(y)+yf(x)$ for every pair of positive integers $x,y$ Find the least number $n \ge 2021$ such that $f(n)=n$

In triangle $ABC,$ $\sin \angle A=\frac{4}{5}$ and $\angle A<90^\circ$ Let $D$ be a point outside triangle $ABC$ such that $\angle BAD=\angle DAC$ and $\angle BDC = 90^{\circ}.$ Suppose that $AD=1$ and that $\frac{BD} {CD} = \frac{3}{2}.$ If $AB+AC$ can be expressed in the form $\frac{a\sqrt{b}}{c}$ where $a,b,c$ are pairwise relatively prime integers, find $a+b+c$. [i]Author: Ray Li[/i]

[asy] import olympiad; import cse5; size(5cm); pointpen = black; pair A = Drawing((10,17.32)); pair B = Drawing((0,0)); pair C = Drawing((20,0)); draw(A--B--C--cycle); pair X = 0.85*A + 0.15*B; pair Y = 0.82*A + 0.18*C; pair W = (-11,0) + X; pair Z = (19, 9); draw(W--X, EndArrow); draw(X--Y, EndArrow); draw(Y--Z, EndArrow); anglepen=black; anglefontpen=black; MarkAngle("\theta", C,Y,Z, 3); [/asy] The cross-section of a prism with index of refraction $1.5$ is an equilateral triangle, as shown above. A ray of light comes in horizontally from air into the prism, and has the opportunity to leave the prism, at an angle $\theta$ with respect to the surface of the triangle. Find $\theta$ in degrees and round to the nearest whole number. [i](Ahaan Rungta, 5 points)[/i]

Point $X$ is taken inside a regular $n$-gon of side length $a$. Let $h_1,h_2,...,h_n$ be the distances from $X$ to the lines defined by the sides of the $n$-gon. Prove that $\frac{1}{h_1}+\frac{1}{h_2}+...+\frac{1}{h_n}>\frac{2\pi}{a}$

Determine all functions $f:\mathbb{R}\to\mathbb{R}$, where $\mathbb{R}$ is the set of all real numbers, satisfying the following two conditions: 1) There exists a real number $M$ such that for every real number $x,f(x)<M$ is satisfied. 2) For every pair of real numbers $x$ and $y$, \[ f(xf(y))+yf(x)=xf(y)+f(xy)\] is satisfied.

A group of $n$ people play a board game with the following rules: 1) In each round of the game exactly $3$ people play 2) The game ends after exactly $n$ rounds 3) Every pair of players has played together at least at one round Find the largest possible value of $n$

Let there be $2004$ be bicolor tiles, white on one side and black on the other, placed in a circle. A move consists of choosing a black piece and turning over three pieces: the chosen one, the one on its left and the one on its right. If at the beginning there is only one black piece, will it be possible, repeating the movement described, to make all the pieces have the white face up?

Find the minimum of the expression $\frac{a + b + c}{2} -\frac{[a, b] + [b, c] + [c, a]}{a + b + c}$ where the variables $a, b, c$ are any integers greater than $1$ and $[x, y]$ denotes the least common multiple of numbers $x, y$.

Circles $\omega_1$ and $\omega_2$ intersect at points $A$ and $B$. Segment $PQ$ is tangent to $\omega_1$ at $P$ and to $\omega_2$ at $Q$, and $A$ is closer to $PQ$ than $B$. Point $X$ is on $\omega_1$ such that $PX\parallel QB$, and point $Y$ is on $\omega_2$ such that $QY\parallel PB$. Given that $\angle APQ=30^\circ$ and $\angle PQA=15^\circ$, find the ratio $AX/AY$.

The princess wishes to have a bracelet with $r$ rubies and $s$ emeralds arranged in such order that there exist two jewels on the bracelet such that starting with these and enumerating the jewels in the same direction she would obtain identical sequences of jewels. Prove that it is possible to fulfill the princess’s wish if and only if $r$ and $s$ have a common divisor.