$2000$ consecutive integers (not necessarily positive) are written on the board. A student takes several turns. On each turn, he partitions the $2000$ integers into $1000$ pairs, and substitutes each pair by the difference arid the sum of that pair (note that the difference does not need to be positive as the student may choose to subtract the greater number from the smaller one; in addition, all the operations are carried simultaneously). Prove that the student will never again write $2000$ consecutive integers on the board.

Suppose that $ ABCD$ is a convex quadrilateral. Let $ F \equal{} AB\cap CD$, $ E \equal{} AD\cap BC$ and $ T \equal{} AC\cap BD$. Suppose that $ A,B,T,E$ lie on a circle which intersects with $ EF$ at $ P$. Prove that if $ M$ is midpoint of $ AB$, then $ \angle APM \equal{} \angle BPT$.

Find all natural numbers $n$ for which there exists set $S$ consisting of $n$ points in the plane, satisfying the condition: For each point $A \in S$ there exist at least three points say $X, Y, Z$ from $S$ such that the segments $AX, AY$ and$ AZ$ have length $1$ (it means that $AX = AY = AZ = 1$).

If the (convex) area bounded by the x-axis and the lines $y=mx+4$, $x=1$, and $x=4$ is $7$, then $m$ equals: $\textbf{(A)}\ -\frac{1}{2}\qquad \textbf{(B)}\ -\frac{2}{3}\qquad \textbf{(C)}\ -\frac{3}{2} \qquad \textbf{(D)}\ -2 \qquad \textbf{(E)}\ \text{none of these}$

A ball is placed on a plane and a point on the ball is marked. Our goal is to roll the ball on a polygon in the plane in a way that it comes back to where it started and the marked point comes to the top of it. Note that We are not allowed to rotate without moving, but only rolling. Prove that it is possible. Time allowed for this problem was 90 minutes.

Let $n$ be a positive integer. Suppose that the diophantine equation \[z^n = 8 x^{2009} + 23 y^{2009} \] uniquely has an integer solution $(x,y,z)=(0,0,0)$. Find the possible minimum value of $n$.

Someone draws at least three lines on paper. Each cuts the other lines two by two. No three lines pass through one point. He chooses a line and counts the intersection points on either side of the line. The numbers of intersections turn out to be the same. He chooses another line. Now the intersections number on one side appears to be six times as large as that on the other side. What is the minimum number of lines where this is possible? [hide=original wording of second sentence]De lijnen snijden elkaar twee aan twee.[/hide]

Let $ABCD$ be a square pyramid of height $\frac{1}{2}$ with square base $ABCD$ of side length $AB=12$ (so $E$ is the vertex of the pyramid, and the foot of the altitude from $E$ to $ABCD$ is the center of square $ABCD$). The faces $ADE$ and $CDE$ meet at an acute angle of measure $\alpha$ (so that $0^{\circ}<\alpha<90^{\circ}$). Find $\tan \alpha$.

Is it possible to choose five different positive integers so that the sum of any three of them is a prime number?

The equation $ x^{n+1} +x=0 $ admits $ 0 $ and $ 1 $ as its unique solutions in a ring of order $ n\ge 2. $ Prove that this ring is a skew field.

Prove that $ \prod_{i\equal{}1}^{n}(1\plus{}x_{1}\plus{}x_{2}\plus{}...\plus{}x_{i})\geq\sqrt{(n\plus{}1)^{n\plus{}1}x_{1}x_{2}...x_{n}}\forall x_{1},...,x_{n}> 0$.

Let $S = \{ a_0, a_1, a_2, a_3, \dots \}$ be a set of positive integers with $1 = a_0 < a_1 < a_2 < a_3 < \dots$. For a subset $T$ of $S$, let $\sigma(T)$ be the sum of the elements of $T$. For instance, $\sigma(\{1, 2, 3\}) = 6$. By convention, $\sigma(\emptyset) = 0$, where $\emptyset$ denotes an empty set. Call a number $n$ representable if there exists a subset $T$ of $S$ such that $\sigma(T) = n$. We aim to prove for any set $S$ satisfying $a_{k+1} \le 2a_k$ for every $k \ge 0$, that all non-negative integers are representable. (a) Prove there is a unique value of $a_1$, and find this value. Use this to determine, with proof, all possible sets $\{a_0, a_1, a_2, a_3 \}$. (Hint: there are 7 possible sets.) [Not for credit] I recommend that you show that for all 7 sets in part (a), every integer between $0$ and $a_3 - 1$ is representable. (Note that this does not depend on the values of $a_4, a_5, a_6, \dots$.) (b) Show that if $a_k \le n \le a_{k+1} - 1$, then $0 \le n - a_k \le a_k - 1$. (c) Prove that any non-negative integer is representable.

Define the numbers $a_0, a_1, \ldots, a_n$ in the following way: \[ a_0 = \frac{1}{2}, \quad a_{k+1} = a_k + \frac{a^2_k}{n} \quad (n > 1, k = 0,1, \ldots, n-1). \] Prove that \[ 1 - \frac{1}{n} < a_n < 1.\]

As shown in the following figure, there is a line segment consisting of five line segments $AB, BC, CD, DE, and EA$ and $10$ intersection points of these five line segments. Find the number of ways to write $1$ or $2$ at each of the $10$ vertices so that the following conditions are satisfied. $\bigstar$ The sum of the four numbers written on each line segment $AB, BC, CD, DE, and EA$ is the same.

Prove the inequality $$\sum _{k = 1} ^n (x_k - x_{k-1})^2 \geq 4 \sin ^2 \frac{\pi}{2n} \cdot \sum ^n _{k = 0} x_k ^2$$ for any sequence of real numbers $x_0, x_1, ..., x_n$ for which $x_0 = x_n = 0.$

Find all triples of primes $(p, q, r)$ such that $p^q=2021+r^3$.

A rectangular piece of of paper measures 4 units by 5 units. Several lines are drawn parallel to the edges of the paper. A rectangle determined by the intersections of some of these lines is called [i]basic [/i]if (i) all four sides of the rectangle are segments of drawn line segments, and (ii) no segments of drawn lines lie inside the rectangle. Given that the total length of all lines drawn is exactly 2007 units, let $N$ be the maximum possible number of basic rectangles determined. Find the remainder when $N$ is divided by 1000.

A square and a rectangle of the same perimeter have a common corner. Prove that the intersection point of the diagonals of the rectangle lies on the diagonal of the square. (Yu. Blinkov)

Points $P$, $Q$, and $M$ lie on a circle $\omega$ such that $M$ is the midpoint of minor arc $PQ$ and $MP=MQ=3$. Point $X$ varies on major arc $PQ$, $MX$ meets segment $PQ$ at $R$, the line through $R$ perpendicular to $MX$ meets minor arc $PQ$ at $S$, $MS$ meets line $PQ$ at $T$. If $TX=5$ when $MS$ is minimized, what is the minimum value of $MS$? [i]2019 CCA Math Bonanza Team Round #9[/i]

Let $ Y_n$ be a binomial random variable with parameters $ n$ and $ p$. Assume that a certain set $ H$ of positive integers has a density and that this density is equal to $ d$. Prove the following statements: (a) $ \lim _{n \rightarrow \infty}P(Y_n\in H)\equal{}d$ if $ H$ is an arithmetic progression. (b) The previous limit relation is not valid for arbitrary $ H$. (c) If $ H$ is such that $ P(Y_n \in H)$ is convergent, then the limit must be equal to $ d$. [i]L. Posa[/i]

The number halfway between $\dfrac{1}{6}$ and $\dfrac{1}{4}$ is $\text{(A)}\ \dfrac{1}{10} \qquad \text{(B)}\ \dfrac{1}{5} \qquad \text{(C)}\ \dfrac{5}{24} \qquad \text{(D)}\ \dfrac{7}{24} \qquad \text{(E)}\ \dfrac{5}{12}$

Let $ k$ and $ s$ be positive integers. For sets of real numbers $ \{\alpha_1, \alpha_2, \ldots , \alpha_s\}$ and $ \{\beta_1, \beta_2, \ldots, \beta_s\}$ that satisfy \[ \sum^s_{i\equal{}1} \alpha^j_i \equal{} \sum^s_{i\equal{}1} \beta^j_i \quad \forall j \equal{} \{1,2 \ldots, k\}\] we write \[ \{\alpha_1, \alpha_2, \ldots , \alpha_s\} \overset{k}{\equal{}} \{\beta_1, \beta_2, \ldots , \beta_s\}.\] Prove that if \[ \{\alpha_1, \alpha_2, \ldots , \alpha_s\} \overset{k}{\equal{}} \{\beta_1, \beta_2, \ldots , \beta_s\}\] and $ s \leq k,$ then there exists a permutation $ \pi$ of $ \{1, 2, \ldots , s\}$ such that \[ \beta_i \equal{} \alpha_{\pi(i)} \quad \forall i \equal{} 1,2, \ldots, s.\]

The ratio of the areas of two concentric circles is $ 1: 3$. If the radius of the smaller is $ r$, then the difference between the radii is best approximated by: $ \textbf{(A)}\ 0.41r \qquad \textbf{(B)}\ 0.73 \qquad \textbf{(C)}\ 0.75 \qquad \textbf{(D)}\ 0.73r \qquad \textbf{(E)}\ 0.75r$

Show that if real numbers $x<1<y$ satisfy the inequality $$2\log x+\log(1-x)\ge3\log y+\log(y-1),$$then $x^3+y^3<2$.

Let $ f(t)$ be a continuous function on the interval $ 0 \leq t \leq 1$, and define the two sets of points \[ A_t\equal{}\{(t,0): t\in[0,1]\} , B_t\equal{}\{(f(t),1): t\in [0,1]\}.\] Show that the union of all segments $ \overline{A_tB_t}$ is Lebesgue-measurable, and find the minimum of its measure with respect to all functions $ f$. [A. Csaszar]