How many ordered pairs of positive integers $(a, b)$ are there such that a right triangle with legs of length $a, b$ has an area of $p$, where $p$ is a prime number less than $100$? [i]Proposed by Joshua Hsieh[/i]

You are walking along a road of constant width with sidewalks on each side. You can only walk on the sidewalks or cross the road perpendicular to the sidewalk. Coming up on a turn, you realize that you are on the “outside” of the turn; i.e., you are taking the longer way around the turn. The turn is a circular arc. Assuming that your destination is on the same side of the road as you are currently, let $\theta$ be the smallest turn angle, in radians, that would justify crossing the road and then crossing back after the turn to take the shorter total path to your destination. What is $\lfloor 100 \cdot \theta \rfloor$ ?

Fathers childhood lasted for one sixth part of his life, and he married one $8$th after that and he immediately left to army. When one $12$th of his life passed, father returned from the army and $5$ years after he got a son. Son who lived for one half of fathers years, died $4$ years before his father. How many years lived his father, and how many years he had when his son was born?

A cuboctahedron is a solid with 6 square faces and 8 equilateral triangle faces, with each edge adjacent to both a square and a triangle (see picture). Suppose the ratio of the volume of an octahedron to a cuboctahedron with the same side length is $r$. Find $100r^2$. [asy] // dragon96, replacing // [img]http://i.imgur.com/08FbQs.png[/img] size(140); defaultpen(linewidth(.7)); real alpha=10, x=-0.12, y=0.025, r=1/sqrt(3); path hex=rotate(alpha)*polygon(6); pair A = shift(x,y)*(r*dir(330+alpha)), B = shift(x,y)*(r*dir(90+alpha)), C = shift(x,y)*(r*dir(210+alpha)); pair X = (-A.x, -A.y), Y = (-B.x, -B.y), Z = (-C.x, -C.y); int i; pair[] H; for(i=0; i<6; i=i+1) { H[i] = dir(alpha+60*i);} fill(X--Y--Z--cycle, rgb(204,255,255)); fill(H[5]--Y--Z--H[0]--cycle^^H[2]--H[3]--X--cycle, rgb(203,153,255)); fill(H[1]--Z--X--H[2]--cycle^^H[4]--H[5]--Y--cycle, rgb(255,203,153)); fill(H[3]--X--Y--H[4]--cycle^^H[0]--H[1]--Z--cycle, rgb(153,203,255)); draw(hex^^X--Y--Z--cycle); draw(H[1]--B--H[2]^^H[3]--C--H[4]^^H[5]--A--H[0]^^A--B--C--cycle, linewidth(0.6)+linetype("5 5")); draw(H[0]--Z--H[1]^^H[2]--X--H[3]^^H[4]--Y--H[5]);[/asy]

A train passes an observer in $t_1$ sec. At the same speed the train crosses a bridge $\ell$ m long. It takes the train $t_2$ sec to cross the bridge from the moment the locomotive drives onto the bridge until the last car leaves it. Find the length and speed of the train.

If $n\in\mathbb N$ and $a_1,a_2,\ldots,a_n$ are arbitrary numbers in the interval $[0,1]$, find the maximum possible value of the smallest among the numbers $a_1-a_1a_2,a_2-a_2a_3,\ldots,a_n-a_na_1$.

Let $H$ and $O$ be the orthocenter and the circumcenter of triangle $ABC$. The circumcircle of triangle $AOH$ meets the perpendicular bisector of $BC$ at point $A_1 \neq O$. Points $B_1$ and $C_1$ are defined similarly. Prove that lines $AA_1$, $BB_1$ and $CC_1$ concur.

Let $ABC$ be a triangle with incircle $(I)$, tangent to $BC$, $CA$, $AB$ at $D, E, F$ respectively. On the line $DF$, take points $M, P$ such that $CM \parallel AB$, $AP \parallel BC$. On the line $DE$, take points $N$, $Q$ such that $BN \parallel AC$, $AQ \parallel BC$. Denote $X$ as intersection of $PE$, $QF$ and $K$ as the midpoint of $BC$. Prove that if $AX = IK$ then $\angle BAC \le 60^o$.

Suppose that tetrahedron $ABCD$ satisfies $\angle BAC+\angle CAD+\angle DAB = \angle ABC+\angle CBD+\angle DBA = 180^o$. Prove that $CD \ge AB$.

Let $p$ a prime number and $r$ the remainder of the division of $p$ by $210$. It is known that $r$ is a composite number and can be written as the sum of two non-zero perfect squares. Find all primes less than $2018$ that satisfy these conditions.

Let $X_1, X_2, \ldots, X_{100}$ be a sequence of mutually distinct nonempty subsets of a set $S$. Any two sets $X_i$ and $X_{i+1}$ are disjoint and their union is not the whole set $S$, that is, $X_i\cap X_{i+1}=\emptyset$ and $X_i\cup X_{i+1}\neq S$, for all $i\in\{1, \ldots, 99\}$. Find the smallest possible number of elements in $S$.

Find the number of integers $n$ from $1$ to $2020$ inclusive such that there exists a multiple of $n$ that consists of only $5$'s. [i]Proposed by Ephram Chun and Taiki Aiba[/i]

Find all non-zero real numbers $ x, y, z$ which satisfy the system of equations: \[ (x^2 \plus{} xy \plus{} y^2)(y^2 \plus{} yz \plus{} z^2)(z^2 \plus{} zx \plus{} x^2) \equal{} xyz\] \[ (x^4 \plus{} x^2y^2 \plus{} y^4)(y^4 \plus{} y^2z^2 \plus{} z^4)(z^4 \plus{} z^2x^2 \plus{} x^4) \equal{} x^3y^3z^3\]

[b]9.[/b] Let $X_0, X_1, \dots $ be independent, indentically distributed, nondegenerate random variables, and let $0<\alpha <1$ be a real number. Assume that the series $\sum_{k=1}^{\infty} \alpha^{k} X_k$ is convergent with probability one. Prove that the distribution function of the sum is continuous. ([b]P. 23[/b]) [T. F. Móri]

Given a checkered rectangle of size n × m. Is it always possible to mark $3$ or $4$ nodes of a rectangle so that at least one of the marked nodes lay on each straight line containing the side of the rectangle, and the non-self-intersecting polygon with vertices at these nodes has an area equal to $$\dfrac{1}{2}\min \left ( \text{gcd}(n, m), \dfrac{n+m}{\text{gcd}(n, m)} \right)$$?

Inside of a square whose side length is $1$ there are a few circles such that the sum of their circumferences is equal to $10$. Show that there exists a line that meets at least four of these circles.

A flea moves in the positive direction on the real Ox axis, starting from the origin. He can only jump over distances equal with $\sqrt 2$ or $\sqrt{2005}$. Prove that there exists $n_0$ such that the flea can reach any interval $[n,n+1]$ with $n\geq n_0$.

A card deck consists of $1024$ cards. On each card, a set of distinct decimal digits is written in such a way that no two of these sets coincide (thus, one of the cards is empty). Two players alternately take cards from the deck, one card per turn. After the deck is empty, each player checks if he can throw out one of his cards so that each of the ten digits occurs on an even number of his remaining cards. If one player can do this but the other one cannot, the one who can is the winner; otherwise a draw is declared. Determine all possible first moves of the first player after which he has a winning strategy. [i]Proposed by Ilya Bogdanov & Vladimir Bragin, Russia[/i]

Prove that the equation $$\frac x{1+x^2}+\frac y{1+y^2}+\frac z{1+z^2}=\frac1{1996}$$has finitely many solutions in positive integers.

Let $c_1,c_2,\ldots ,c_n,b_1,b_2,\ldots ,b_n$ $(n\geq 2)$ be positive real numbers. Prove that the equation \[ \sum_{i=1}^nc_i\sqrt{x_i-b_i}=\frac{1}{2}\sum_{i=1}^nx_i\] has a unique solution $(x_1,\ldots ,x_n)$ if and only if $\sum_{i=1}^nc_i^2=\sum_{i=1}^nb_i$.

Prove that the product of $8$ consecutive natural numbers can never be a fourth power of natural number.

$A, B$ are points on circle $O$ satisfying $\angle AOB < 120^{\circ} $. $C$ is a point on the tangent line of $O$ passing through $A$ satisfying $AB=AC$ and $\angle BAC < 90^{\circ} $. $D$ is the intersection of $O$ and $BC$ not $B$, and $I$ is the incenter of $ABD$. Prove that $AE=AC$ where $E$ is the intersection of $CI$ and $AD$.

Find the maximum number of $3 \times 5\times 7$ boxes that can be placed inside a $11\times 35\times 39$ box. For the number found, indicate how you would place that number of boxes inside the box.

Usain is walking for exercise by zigzagging across a $100$-meter by $30$-meter rectangular field, beginning at point $A$ and ending on the segment $\overline{BC}$. He wants to increase the distance walked by zigzagging as shown in the figure below $(APQRS)$. What angle $\theta=\angle PAB=\angle QPC=\angle RQB=\cdots$ will produce in a length that is $120$ meters? (Do not assume the zigzag path has exactly four segments as shown; there could be more or fewer.) [asy] import olympiad; draw((-50,15)--(50,15)); draw((50,15)--(50,-15)); draw((50,-15)--(-50,-15)); draw((-50,-15)--(-50,15)); draw((-50,-15)--(-22.5,15)); draw((-22.5,15)--(5,-15)); draw((5,-15)--(32.5,15)); draw((32.5,15)--(50,-4.090909090909)); label("$\theta$", (-41.5,-10.5)); label("$\theta$", (-13,10.5)); label("$\theta$", (15.5,-10.5)); label("$\theta$", (43,10.5)); dot((-50,15)); dot((-50,-15)); dot((50,15)); dot((50,-15)); dot((50,-4.09090909090909)); label("$D$",(-58,15)); label("$A$",(-58,-15)); label("$C$",(58,15)); label("$B$",(58,-15)); label("$S$",(58,-4.0909090909)); dot((-22.5,15)); dot((5,-15)); dot((32.5,15)); label("$P$",(-22.5,23)); label("$Q$",(5,-23)); label("$R$",(32.5,23)); [/asy] $\textbf{(A)}~\arccos\frac{5}{6}\qquad\textbf{(B)}~\arccos\frac{4}{5}\qquad\textbf{(C)}~\arccos\frac{3}{10}\qquad\textbf{(D)}~\arcsin\frac{4}{5}\qquad\textbf{(E)}~\arcsin\frac{5}{6}$

Let $m$ and $n$ be positive integers where $m$ has $d$ digits in base ten and $d\leq n$. Find the sum of all the digits (in base ten) of the product $(10^n-1)m$.