For a positive integer $n$, let $R(n)$ be the sum of the remainders when $n$ is divided by $1,2, \cdots , n$. For example, $R(4) = 0 + 0 + 1 + 0 = 1,$ $R(7) = 0 + 1 + 1 + 3 + 2 + 1 + 0 = 8$. Find all positive integers such that $R(n) = n-1$.

Find all the natural numbers that are $300$ times the sum of its digits.

Let $M= \{ 1, 2, \cdots, 19 \}$ and $A = \{ a_{1}, a_{2}, \cdots, a_{k}\}\subseteq M$. Find the least $k$ so that for any $b \in M$, there exist $a_{i}, a_{j}\in A$, satisfying $b=a_{i}$ or $b=a_{i}\pm a_{i}$ ($a_{i}$ and $a_{j}$ do not have to be different) .

Consider an infinite sequence $a_1,a_2,\cdots$ whose terms all belong to $\left\{1,2\right\}$. A positive integer with $n$ digits is said to be [i]good[/i] if its decimal representation has the form $a_ra_{r+1}\cdots a_{r+(n-1)}$, for some positive integer $r$. Suppose that there are at least $2008$ [i]good[/i] numbers with a million digits. Prove that there are at least $2008$ [i]good[/i] numbers with $2007$ digits.

Prair writes the letters $A,B,C,D$, and $E$ such that neither vowel are written first, and they are not adjacent; such that there exists at least one pair of adjacent consonants; and such that exactly five pairs of letters are in alphabetical order. How many possible ways could Prair have ordered the letters?

A circle with center $O$ is drawn in the first quadrant of the 2D Cartesian plane (the quadrant with both positive $x$ and $y$ values) such that it lies tangent to the $x$ and $y$-axes. A line is drawn with slope $m>1$ and passing through the origin; the line intersects the circle at two points $A$ and $B$, with $A$ closer to the origin than $B$. Suppose that $ABO$ is an equilateral triangle. Compute $m$.

To each side of the regular $p$-gon of side length $1$ there is attached a $1 \times k$ rectangle, partitioned into $k$ unit cells, where $k$ and $p$ are given positive integers and p an odd prime. Let $P$ be the resulting nonconvex star-like polygonal figure consisting of $kp + 1$ regions ($kp$ unit cells and the $p$-gon). Each region is to be colored in one of three colors, adjacent regions having different colors. Furthermore, it is required that the colored figure should not have a symmetry axis. In how many ways can this be done?

Let $a, b, c \geq 0$ and satisfy \[ a^2+b^2+c^2 +abc = 4 . \] Show that \[ 0 \le ab + bc + ca - abc \leq 2. \]

In a room, we have 2019 aligned switches, connected to 2019 light bulbs, all initially switched on. Then, 2019 people enter the room one by one, performing the operation: The first, uses all the switches; the second, every second switch; the third, every third switch, and so on. How many lightbulbs remain switched on, after all the people entered ?

Determine whether there exists an infinite sequence of nonzero digits $a_1 , a_2 , a_3 , \cdots $ and a positive integer $N$ such that for every integer $k > N$, the number $\overline{a_k a_{k-1}\cdots a_1 }$ is a perfect square.

The figure below shows $13$ circles of radius $1$ within a larger circle. All the intersections occur at points of tangency. What is the area of the region, shaded in the figure, inside the larger circle but outside all the circles of radius $1 ?$ [asy]unitsize(20);filldraw(circle((0,0),2*sqrt(3)+1),rgb(0.5,0.5,0.5));filldraw(circle((-2,0),1),white);filldraw(circle((0,0),1),white);filldraw(circle((2,0),1),white);filldraw(circle((1,sqrt(3)),1),white);filldraw(circle((3,sqrt(3)),1),white);filldraw(circle((-1,sqrt(3)),1),white);filldraw(circle((-3,sqrt(3)),1),white);filldraw(circle((1,-1*sqrt(3)),1),white);filldraw(circle((3,-1*sqrt(3)),1),white);filldraw(circle((-1,-1*sqrt(3)),1),white);filldraw(circle((-3,-1*sqrt(3)),1),white);filldraw(circle((0,2*sqrt(3)),1),white);filldraw(circle((0,-2*sqrt(3)),1),white);[/asy] $\textbf{(A) } 4 \pi \sqrt{3} \qquad\textbf{(B) } 7 \pi \qquad\textbf{(C) } \pi(3\sqrt{3} +2) \qquad\textbf{(D) } 10 \pi (\sqrt{3} - 1) \qquad\textbf{(E) } \pi(\sqrt{3} + 6)$

If $X_i$ is the answer to problem $i$ for $1 \le i \le 12$, find the minimum possible value of $\sum_{n=1}^{12} (-1)^n X_n$. [i]Proposed by Evan Chen, Lewis Chen[/i]

Given a real number $\alpha$ satisfying $\alpha^3 = \alpha + 1$. Determine all $4$-tuples of rational numbers $(a, b, c, d)$ satisfying: $a\alpha^2 + b\alpha+ c = \sqrt{d}.$

A bag contains plastic cubes of the same size, whose faces have been painted in colors: white, red, yellow, green, blue and violet (without repeating a color on two faces of the same cube). How many of these cubes can there be distinguishable to each other?

We are given $n$ coins of different weights and $n$ balances, $n>2$. On each turn one can choose one balance, put one coin on the right pan and one on the left pan, and then delete these coins out of the balance. It's known that one balance is wrong (but it's not known ehich exactly), and it shows an arbitrary result on every turn. What is the smallest number of turns required to find the heaviest coin? [hide=Thanks]Thanks to the user Vlados021 for translating the problem.[/hide]

[b]Q4.[/b] A man travels from town $A$ to town $E$ through $B,C$ and $D$ with uniform speeds 3km/h, 2km/h, 6km/h and 3km/h on the horizontal, up slope, down slope and horizontal road, respectively. If the road between town $A$ and town $E$ can be classified as horizontal, up slope, down slope and horizontal and total length of each typr of road is the same, what is the average speed of his journey? \[(A) \; 2 \text{km/h} \qquad (B) \; 2,5 \text{km/h} ; \qquad (C ) \; 3 \text{km/h} ; \qquad (D) \; 3,5 \text{km/h} ; \qquad (E) \; 4 \text{km/h}.\]

A polynomial $P(x)$ with real coefficients and degree $2021$ is given. For any real $a$ polynomial $x^{2022}+aP(x)$ has at least one real root. Find all possible values of $P(0)$

Suppose that $a$ cows give $b$ gallons of milk in $c$ days. At this rate, how many gallons of milk will $d$ cows give in $e$ days? ${ \textbf{(A)}\ \frac{bde}{ac}\qquad\textbf{(B)}\ \frac{ac}{bde}\qquad\textbf{(C)}\ \frac{abde}{c}\qquad\textbf{(D)}}\ \frac{bcde}{a}\qquad\textbf{(E)}\ \frac{abc}{de}$

Let $A_1$, $A_2$, $\cdots$, $A_m$ be $m$ subsets of a set of size $n$. Prove that $$ \sum_{i=1}^{m} \sum_{j=1}^{m}|A_i|\cdot |A_i \cap A_j|\geq \frac{1}{mn}\left(\sum_{i=1}^{m}|A_i|\right)^3.$$

Let $A_1A_2A_3\cdots A_{10}$ be a regular decagon and $A=A_1A_4\cap A_2A_5, B=A_1A_6\cap A_2A_7, C=A_1A_9\cap A_2A_{10}.$ Find the angles of the triangle $ABC$.

Given a set of $1997$ numbers such that if each number in the set, replace with the sum of the rest, you get the same set. Prove that the product of numbers in the set is equal to $0$.

What is the maximum number of bishops that can be placed on an $ 8 \times 8 $ chessboard such that at most three bishops lie on any diagonal?

Let $A_1A_2\ldots A_6$ be a regular hexagon with side length $11\sqrt{3},$ and let $B_1B_2\ldots B_6$ be another regular hexagon completely inside $A_1A_2\ldots A_6$ such that for all $i \in \{1, 2, \ldots, 5\}$ $A_iA_{i+1}$ is parallel to $B_iB_{i+1}.$ Suppose that the distance between lines $A_1A_2$ and $B_1B_2$ is $7,$ the distance between lines $A_2A_3$ and $B_2B_3$ is $3,$ and the distance between lines $A_3A_4$ and $B_3B_4$ is $8.$ Compute the side length of $B_1B_2\ldots B_6.$

Suppose there are 8 white balls and 2 red balls in a packet. Each time one ball is drawn and replaced by a white one. Find the probability that the last red ball is drawn in the fourth draw.

If you multiply the number of faces that a pyramid has with the number of edges of the pyramid, you get $5.100$. Determine the number of faces of the pyramid.