[b]p1.[/b] A dog on a $10$ meter long leash is tied to a $10$ meter long, infinitely thin section of fence. What is the minimum area over which the dog will be able to roam freely on the leash, given that we can fix the position of the leash anywhere on the fence? [b]p2.[/b] Suppose that the equation $$\begin{tabular}{cccccc} &\underline{C} &\underline{H} &\underline{M}& \underline{M}& \underline{C}\\ +& &\underline{H}& \underline{M}& \underline{M} & \underline{T}\\ \hline &\underline{P} &\underline{U} &\underline{M} &\underline{A} &\underline{C}\\ \end{tabular}$$ holds true, where each letter represents a single nonnegative digit, and distinct letters represent different digits (so that $\underline{C}\, \underline{H}\, \underline{ M}\, \underline{ M}\, \underline{ C}$ and $ \underline{P}\, \underline{U}\, \underline{M}\, \underline{A}\, \underline{C}$ are both five digit positive integers, and the number $\underline{H }\, \underline{M}\, \underline{M}\, \underline{T}$ is a four digit positive integer). What is the largest possible value of the five digit positive integer$\underline{C}\, \underline{H}\, \underline{ M}\, \underline{ M}\, \underline{ C}$ ? [b]p3.[/b] Square $ABCD$ has side length $4$, and $E$ is a point on segment $BC$ such that $CE = 1$. Let $C_1$ be the circle tangent to segments $AB$, $BE$, and $EA$, and $C_2$ be the circle tangent to segments $CD$, $DA$, and $AE$. What is the sum of the radii of circles $C_1$ and $C_2$? [b]p4.[/b] A finite set $S$ of points in the plane is called tri-separable if for every subset $A \subseteq S$ of the points in the given set, we can find a triangle $T$ such that (i) every point of $A$ is inside $T$ , and (ii) every point of $S$ that is not in $A$ is outside$ T$ . What is the smallest positive integer $n$ such that no set of $n$ distinct points is tri-separable? [b]p5.[/b] The unit $100$-dimensional hypercube $H$ is the set of points $(x_1, x_2,..., x_{100})$ in $R^{100}$ such that $x_i \in \{0, 1\}$ for $i = 1$, $2$, $...$, $100$. We say that the center of $H$ is the point $$\left( \frac12,\frac12, ..., \frac12 \right)$$ in $R^{100}$, all of whose coordinates are equal to $1/2$. For any point $P \in R^{100}$ and positive real number $r$, the hypersphere centered at $P$ with radius $r$ is defined to be the set of all points in $R^{100}$ that are a distance $r$ away from $P$. Suppose we place hyperspheres of radius $1/2$ at each of the vertices of the $100$-dimensional unit hypercube $H$. What is the smallest real number $R$, such that a hypersphere of radius $R$ placed at the center of $H$ will intersect the hyperspheres at the corners of $H$? [b]p6.[/b] Greg has a $9\times 9$ grid of unit squares. In each square of the grid, he writes down a single nonzero digit. Let $N$ be the number of ways Greg can write down these digits, so that each of the nine nine-digit numbers formed by the rows of the grid (reading the digits in a row left to right) and each of the nine nine-digit numbers formed by the columns (reading the digits in a column top to bottom) are multiples of $3$. What is the number of positive integer divisors of $N$? [b]p7.[/b] Find the largest positive integer $n$ for which there exists positive integers $x$, $y$, and $z$ satisfying $$n \cdot gcd(x, y, z) = gcd(x + 2y, y + 2z, z + 2x).$$ [b]p8.[/b] Suppose $ABCDEFGH$ is a cube of side length $1$, one of whose faces is the unit square $ABCD$. Point $X$ is the center of square $ABCD$, and $P$ and $Q$ are two other points allowed to range on the surface of cube $ABCDEFHG$. Find the largest possible volume of tetrahedron $AXPQ$. [b]p9.[/b] Deep writes down the numbers $1, 2, 3, ... , 8$ on a blackboard. Each minute after writing down the numbers, he uniformly at random picks some number $m$ written on the blackboard, erases that number from the blackboard, and increases the values of all the other numbers on the blackboard by $m$. After seven minutes, Deep is left with only one number on the black board. What is the expected value of the number Deep ends up with after seven minutes? [b]p10.[/b] Find the number of ordered tuples $(x_1, x_2, x_3, x_4, x_5)$ of positive integers such that $x_k \le 6$ for each index $k = 1$, $2$, $... $,$ 5$, and the sum $$x_1 + x_2 +... + x_5$$ is $1$ more than an integer multiple of $7$. [b]p11.[/b] The equation $$\left( x- \sqrt[3]{13}\right)\left( x- \sqrt[3]{53}\right)\left( x- \sqrt[3]{103}\right)=\frac13$$ has three distinct real solutions $r$, $s$, and $t$ for $x$. Calculate the value of $$r^3 + s^3 + t^3.$$ [b]p12.[/b] Suppose $a$, $b$, and $c$ are real numbers such that $$\frac{ac}{a + b}+\frac{ba}{b + c}+\frac{cb}{c + a}= -9$$ and $$\frac{bc}{a + b}+\frac{ca}{b+c}+\frac{ab}{c + a}= 10.$$ Compute the value of $$\frac{b}{a + b}+\frac{c}{b + c}+\frac{a}{c + a}.$$ [b]p13.[/b] The complex numbers $w$ and $z$ satisfy the equations $|w| = 5$, $|z| = 13$, and $$52w - 20z = 3(4 + 7i).$$ Find the value of the product $wz$. [b]p14.[/b] For $i = 1, 2, 3, 4$, we choose a real number $x_i$ uniformly at random from the closed interval $[0, i]$. What is the probability that $x_1 < x_2 < x_3 < x_4$ ? [b]p15.[/b] The terms of the infinite sequence of rational numbers $a_0$, $a_1$, $a_2$, $...$ satisfy the equation $$a_{n+1} + a_{n-2} = a_na_{n-1}$$ for all integers $n\ge 2$. Moreover, the values of the initial terms of the sequence are $a_0 =\frac52$, $a_1 = 2$ and} $a_2 =\frac52.$ Call a nonnegative integer $m$ lucky if when we write $a_m =\frac{p}{q}$ for some relatively prime positive integers $p$ and $q$, the integer $p + q$ is divisible by $13$. What is the $101^{st}$ smallest lucky number? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a finite sequence $ S \equal{} (a_1,a_2,\ldots,a_n)$ of $ n$ real numbers, let $ A(S)$ be the sequence \[ \left(\frac {a_1 \plus{} a_2}2,\frac {a_2 \plus{} a_3}2,\ldots,\frac {a_{n \minus{} 1} \plus{} a_n}2\right) \]of $ n \minus{} 1$ real numbers. Define $ A^1(S) \equal{} A(S)$ and, for each integer $ m$, $ 2\le m\le n \minus{} 1$, define $ A^m(S) \equal{} A(A^{m \minus{} 1}(S)).$ Suppose $ x > 0$, and let $ S \equal{} (1,x,x^2,\ldots,x^{100})$. If $ A^{100}(S) \equal{} (1/2^{50})$, then what is $ x$? $ \textbf{(A) } 1 \minus{} \frac {\sqrt {2}}2\qquad \textbf{(B) } \sqrt {2} \minus{} 1\qquad \textbf{(C) } \frac 12\qquad \textbf{(D) } 2 \minus{} \sqrt {2}\qquad \textbf{(E) } \frac {\sqrt {2}}2$

We are given $64$ cubes, each with five white faces and one black face. One cube is placed on each square of a chessboard, with its edges parallel to the sides of the board. We are allowed to rotate a complete row of cubes about the axis of symmetry running through the cubes or to rotate a complete column of cubes about the axis of symmetry running through the cubes. Show that by a sequence of such rotations we can always arrange that each cube has its black face uppermost

A sequence of positive integers is defined by $a_0=1$ and $a_{n+1}=a_n^2+1$ for each $n\ge0$. Find $\text{gcd}(a_{999},a_{2004})$.

Define the sequence $\{a_n\}_{n=1}^\infty$ as \[ a_1 = a_2 = 1,\quad a_{n+2} = 14a_{n+1} - a_n \; (n \geq 1) \] Prove that if $p$ is prime and there exists a positive integer $n$ such that $\frac{a_n}p$ is an integer, then $\frac{p-1}{12}$ is also an integer.

In a certain language there are $n$ letters. A sequence of letters is a word, if there are no two equal letters between two other equal letters. Find the number of words of the maximum length.

Suppose that every positve integer has been given one of the colors red, blue,arbitrarily. Prove that there exists an infinite sequence of positive integers $ a_{1} < a_{2} < a_{3} < \cdots < a_{n} < \cdots,$ such that inifinite sequence of positive integers $ a_{1},\frac {a_{1} \plus{} a_{2}}{2},a_{2},\frac {a_{2} \plus{} a_{3}}{2},a_{3},\frac {a_{3} \plus{} a_{4}}{2},\cdots$ has the same color.

i) Prove that for every sequence $(a_{n})_{n\in \mathbb{N}}$, such that $a_{n}>0$ for all $n \in \mathbb{N}$ and $\sum_{n=1}^{\infty}a_{n}<\infty$, we have $$\sum_{n=1}^{\infty}(a_{1}a_{2} \cdots a_{n})^{\frac{1}{n}}< e\sum_{n=1}^{\infty}a_{n}.$$ ii) Prove that for every $\epsilon>0$ there exists a sequence $(b_{n})_{n\in \mathbb{N}}$ such that $b_{n}>0$ for all $n \in \mathbb{N}$ and $\sum_{n=1}^{\infty}b_{n}<\infty$ and $$\sum_{n=1}^{\infty}(b_{1}b_{2} \cdots b_{n})^{\frac{1}{n}}> (e-\epsilon)\sum_{n=1}^{\infty}b_{n}.$$

Let $(a_n)_{n\geq 1}$ be a sequence of positive real numbers with the property that $$(a_{n+1})^2 + a_na_{n+2} \leq a_n + a_{n+2}$$ for all positive integers $n$. Show that $a_{2022}\leq 1$.

Let $(F_{n})_{n\geq1}$ the Fibonacci sequence. Find all $n \in \mathbb{N}$ such that for every $k=0,1,...,F_{n}$ \[ {F_{n}\choose k} \equiv (-1)^{k} \ (mod \ F_{n}+1) \]

Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.

Given a natural number $n\ge 3$, determine all strictly increasing sequences $a_1<a_2<\cdots<a_n$ such that $\text{gcd}(a_1,a_2)=1$ and for any pair of natural numbers $(k,m)$ satisfy $n\ge m\ge 3$, $m\ge k$, $$\frac{a_1+a_2+\cdots +a_m}{a_k}$$ is a positive integer.

For a sequence $x_1,x_2,\ldots,x_n$ of real numbers, we define its $\textit{price}$ as \[\max_{1\le i\le n}|x_1+\cdots +x_i|.\] Given $n$ real numbers, Dave and George want to arrange them into a sequence with a low price. Diligent Dave checks all possible ways and finds the minimum possible price $D$. Greedy George, on the other hand, chooses $x_1$ such that $|x_1 |$ is as small as possible; among the remaining numbers, he chooses $x_2$ such that $|x_1 + x_2 |$ is as small as possible, and so on. Thus, in the $i$-th step he chooses $x_i$ among the remaining numbers so as to minimise the value of $|x_1 + x_2 + \cdots x_i |$. In each step, if several numbers provide the same value, George chooses one at random. Finally he gets a sequence with price $G$. Find the least possible constant $c$ such that for every positive integer $n$, for every collection of $n$ real numbers, and for every possible sequence that George might obtain, the resulting values satisfy the inequality $G\le cD$. [i]Proposed by Georgia[/i]

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.$

A sequence $a_1, a_2,\dots, a_n$ of positive integers is [i]alagoana[/i], if for every $n$ positive integer, one have these two conditions I- $a_{n!} = a_1\cdot a_2\cdot a_3\cdots a_n$ II- The number $a_n$ is the $n$-power of a positive integer. Find all the sequence(s) [i]alagoana[/i].