Prove that there are no positive integers $n$ and $k\le n$ such that the numbers $$\binom nk,\binom n{k+1},\binom n{k+2},\binom n{k+3}$$in this order form an arithmetic progression.

Let $ ABC$, $ l$ and $ P$ be arbitrary triangle, line and point. $ A',B',C'$ are reflections of $ A,B,C$ in point $ P$. $ A''$ is a point on $ B'C'$ such that $ AA''\parallel l$. $ B'',C''$ are defined similarly. Prove that $ A'',B'',C''$ are collinear.

[u]Round 1[/u] [b]1.1.[/b] There are $99$ dogs sitting in a long line. Starting with the third dog in the line, if every third dog barks three times, and all the other dogs each bark once, how many barks are there in total? [b]1.2.[/b] Indigo notices that when she uses her lucky pencil, her test scores are always $66 \frac23 \%$ higher than when she uses normal pencils. What percent lower is her test score when using a normal pencil than her test score when using her lucky pencil? [b]1.3.[/b] Bill has a farm with deer, sheep, and apple trees. He mostly enjoys looking after his apple trees, but somehow, the deer and sheep always want to eat the trees' leaves, so Bill decides to build a fence around his trees. The $60$ trees are arranged in a $5\times 12$ rectangular array with $5$ feet between each pair of adjacent trees. If the rectangular fence is constructed $6$ feet away from the array of trees, what is the area the fence encompasses in feet squared? (Ignore the width of the trees.) [u]Round 2[/u] [b]2.1.[/b] If $x + 3y = 2$, then what is the value of the expression $9^x * 729^y$? [b]2.2.[/b] Lazy Sheep loves sleeping in, but unfortunately, he has school two days a week. If Lazy Sheep wakes up each day before school's starting time with probability $1/8$ independent of previous days, then the probability that Lazy Sheep wakes up late on at least one school day over a given week is $p/q$ for relatively prime positive integers $p, q$. Find $p + q$. [b]2.3.[/b] An integer $n$ leaves remainder $1$ when divided by $4$. Find the sum of the possible remainders $n$ leaves when divided by $20$. [u]Round 3[/u] [b]3.1. [/b]Jake has a circular knob with three settings that can freely rotate. Each minute, he rotates the knob $120^o$ clockwise or counterclockwise at random. The probability that the knob is back in its original state after $4$ minutes is $p/q$ for relatively prime positive integers $p, q$. Find $p + q$. [b]3.2.[/b] Given that $3$ not necessarily distinct primes $p, q, r$ satisfy $p+6q +2r = 60$, find the sum of all possible values of $p + q + r$. [b]3.3.[/b] Dexter's favorite number is the positive integer $x$, If $15x$ has an even number of proper divisors, what is the smallest possible value of $x$? (Note: A proper divisor of a positive integer is a divisor other than itself.) [u]Round 4[/u] [b]4.1.[/b] Three circles of radius $1$ are each tangent to the other two circles. A fourth circle is externally tangent to all three circles. The radius of the fourth circle can be expressed as $\frac{a\sqrt{b}-\sqrt{c}}{d}$ for positive integers $a, b, c, d$ where $b$ is not divisible by the square of any prime and $a$ and $d$ are relatively prime. Find $a + b + c + d$. [b]4.2. [/b]Evaluate $$\frac{\sqrt{15}}{3} \cdot \frac{\sqrt{35}}{5} \cdot \frac{\sqrt{63}}{7}... \cdot \frac{\sqrt{5475}}{73}$$ [b]4.3.[/b] For any positive integer $n$, let $f(n)$ denote the number of digits in its base $10$ representation, and let $g(n)$ denote the number of digits in its base $4$ representation. For how many $n$ is $g(n)$ an integer multiple of $f(n)$? PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2784571p24468619]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $A$ be an integral domain and $A[X]$ be its associated ring of polynomials. For every integer $n \ge 2$ we define the map $\varphi_n : A[X] \to A[X],$ $\varphi_n(f)=f^n$ and we assume that the set $$M= \Big\{ n \in \mathbb{Z}_{\ge 2} : \varphi_n \mathrm{~is~an~endomorphism~of~the~ring~} A[X] \Big\}$$ is nonempty. Prove that there exists a unique prime number $p$ such that $M=\{p,p^2,p^3, \ldots\}.$

Let $ A,B $ be two points in a plane and let two numbers $ a,b\in (0,1) . $ For each point $ M $ that is not on the line $ AB $ consider $ P $ on the segment $ AM $ and $ N $ on $ BM $ (both excluding the extremities) such that $ BN=b\cdot BM $ and $ AP=a\cdot AM. $ Find the locus of the points $ M $ for which $ AN=BP. $

A student wrote down the following sequence of numbers : the first number is 1, the second number is 2, and after that, each number is obtained by adding together all the previous numbers. Determine the 12th number in the sequence.

A triangle is cut into several (not less than two) triangles. One of them is isosceles (not equilateral), and all others are equilateral. Determine the angles of the original triangle.

Let $A\in M_3(\mathbb Z)$ such that $\det(A)=1$. What is the maximum possible number of entries of $A$ that are even?

Sets $A, B$, and $C$ satisfy $|A| = 92$, $|B| = 35$, $|C| = 63$, $|A\cap B| = 16$, $|A\cap C| = 51$, $|B\cap C| = 19$. Compute the number of possible values of$ |A \cap B \cap C|$.

A number of $n$ lamps ($n\ge 3$) are put at $n$ vertices of a regular $n$-gon. Initially, all the lamps are off. In each step. Lisa will choose three lamps that are located at three vertices of an isosceles triangle and change their states (from off to on and vice versa). Her aim is to turn on all the lamps. At least how many steps are required to do so?

How many positive factors does $23,232$ have? $\textbf{(A) }9\qquad\textbf{(B) }12\qquad\textbf{(C) }28\qquad\textbf{(D) }36\qquad\textbf{(E) }42$

Consider the areas of the four triangles obtained by drawing the diagonals $AC$ and $BD$ of a trapezium $ABCD$. The product of these areas, taken two at time, are computed. If among the six products so obtained, two products are 1296 and 576, determine the square root of the maximum possible area of the trapezium to the nearest integer.

Denote by $\lambda (H)$ the Lebesgue outer measure of $H\subseteq \left[ 0,1\right]$. The horizontal and vertical sections of the set $A\subseteq [0, 1]\times [ 0, 1]$ are denoted by $A^y$ and $A_x$ respectively; that is, $A^y=\{ x\in [ 0, 1] \colon (x, y) \in A\}$ and $A_x=\{ y\in [ 0, 1]\colon (x,y)\in A\}$ for all $x,y\in [0,1]$. (a) Is there a decomposition $A\cup B$ of the unit square $[0,1]\times [0,1]$ such that $A^y$ is the union of finitely many segments of total length less than $\frac12$ and $\lambda (B_x)\le \frac12$ for all $x, y\in [0,1]$? (b) Is there a decomposition $A\cup B$ of the unit square $[0,1] \times [0,1]$ such that $A^y$ is the union of finitely many segments of total length not greater than $\frac12$ and $\lambda (B_x)<\frac12$ for all $x,y\in [0,1]$?

Positive real numbers $x$ and $y$ satisfy $y^3 = x^2$ and $(y-x)^2 = 4y^2$. What is $x+y$? $\textbf{(A)}\ 12 \qquad \textbf{(B)}\ 18 \qquad \textbf{(C)}\ 24 \qquad \textbf{(D)}\ 36 \qquad \textbf{(E)}\ 42$

Solve the equation $a^3+b^3+c^3=2001$ in positive integers. [i]Mircea Becheanu, Romania[/i]

Given triangle $\triangle ABC$ and let $D,E,F$ be the foot of angle bisectors of $A,B,C$ ,respectively. $M,N$ lie on $EF$ such that $AM=AN$. Let $H$ be the foot of $A$-altitude on $BC$. Points $K,L$ lie on $EF$ such that triangles $\triangle AKL, \triangle HMN$ are correspondingly similiar (with the given order of vertices) such that $AK \not\parallel HM$ and $AK \not\parallel HN$. Show that: $DK=DL$

In triangle $ABC$, $\measuredangle C=\theta$ and $\measuredangle B=2\theta$, where $0^{\circ} <\theta < 60^{\circ}$. The circle with center $A$ and radius $AB$ intersects $AC$ at $D$ and intersects $BC$, extended if necessary, at $B$ and at $E$ ($E$ may coincide with $B$). Then $EC=AD$ $ \textbf{(A)}\ \text{for no values of}\ \theta \qquad\textbf{(B)}\ \text{only if}\ \theta=45^{\circ} \qquad\textbf{(C)}\ \text{only if}\ 0^{\circ} < \theta \le 45^{\circ} \\ \qquad\textbf{(D)}\ \text{only if}\ 45^{\circ} \le \theta < 60^{\circ} \qquad\textbf{(E)}\ \text{for all}\ \theta \ \text{such that}\ 0^{\circ} <\theta < 60^{\circ} $

Let \[F=\log\dfrac{1+x}{1-x}.\] Find a new function $G$ by replacing each $x$ in $F$ by \[\dfrac{3x+x^3}{1+3x^2},\] and simplify. The simplified expression $G$ is equal to: $\textbf{(A)}\ -F \qquad \textbf{(B)}\ F\qquad \textbf{(C)}\ 3F \qquad \textbf{(D)}\ F^3 \qquad \textbf{(E)}\ F^3-F$

A postman wants to divide $n$ packages with weights $1, 2, 3, 4, n$ into three groups of exactly the same weight. Can he do this if (a) $n = 2011$ ? (b) $n = 2012$ ?

Let $AX,BY,CZ$ be three cevians concurrent at an interior point $D$ of a triangle $ABC$. Prove that if two of the quadrangles $DY AZ,DZBX,DXCY$ are circumscribable, so is the third.

Determine all positive integers $n$ less than $2024$ such that for all positive integers $x$, the greatest common divisor of $9x + 1$ and $nx+1$ is $1$.

$\arcsin(\sin 2000^{\circ})=$________.

Determine all positive integers $n{}$ for which there exist pairwise distinct integers $a_1,\ldots,a_n{}$ and $b_1,\ldots, b_n$ such that \[\prod_{i=1}^n(a_k^2+a_ia_k+b_i)=\prod_{i=1}^n(b_k^2+a_ib_k+b_i)=0, \quad \forall k=1,\ldots,n.\]

Let $(G,\cdot)$ be a group and let $F$ be the set of elements in the group $G$ of finite order. Prove that if $F$ is finite, then there exists a positive integer $n$ such that for all $x\in G$ and for all $y\in F$, we have \[ x^n y = yx^n. \]

Keith has $10$ coins labeled $1$ through $10$, where the $i$th coin has weight $2^i$. The coins are all fair, so the probability of flipping heads on any of the coins is $\tfrac{1}{2}$. After flipping all of the coins, Keith takes all of the coins which land heads and measures their total weight, $W$. If the probability that $137\le W\le 1061$ is $\tfrac{m}{n}$ for coprime positive integers $m,n$, determine $m+n$.