Let $ a $ be a positive real number. Calculate $ \lim_{n\to\infty} \frac{a^n}{(1+a)(1+a^2)\cdots (1+a^n)} . $

On a party with $99$ guests, hosts Ann and Bob play a game (the hosts are not regarded as guests). There are $99$ chairs arranged in a circle; initially, all guests hang around those chairs. The hosts take turns alternately. By a turn, a host orders any standing guest to sit on an unoccupied chair $c$. If some chair adjacent to $c$ is already occupied, the same host orders one guest on such chair to stand up (if both chairs adjacent to $c$ are occupied, the host chooses exactly one of them). All orders are carried out immediately. Ann makes the first move; her goal is to fulfill, after some move of hers, that at least $k$ chairs are occupied. Determine the largest $k$ for which Ann can reach the goal, regardless of Bob's play.

Triangles $\triangle ABC$ and $\triangle A'B'C'$ lie in the coordinate plane with vertices $A(0,0)$, $B(0,12)$, $C(16,0)$, $A'(24,18)$, $B'(36,18)$, and $C'(24,2)$. A rotation of $m$ degrees clockwise around the point $(x,y)$, where $0<m<180$, will transform $\triangle ABC$ to $\triangle A'B'C'$. Find $m+x+y$.

Find the largest positive integer $n$ such that $n^3 + 4n^2 - 15n - 18$ is the cube of an integer.

In a triangle $ABC$ , we have a point $O$ on $BC$ . Now show that there exists a line $l$ such that $l||AO$ and $l$ divides the triangle $ABC$ into two halves of equal area .

In $\triangle ABC$, point $M$ is the middle point of $AC$. $MD//AB$ and meet the tangent of $A$ to $\odot(ABC)$ at point $D$. Point $E$ is in $AD$ and point $A$ is the middle point of $DE$. $\{P\}=\odot(ABE)\cap AC,\{Q\}=\odot(ADP)\cap DM$. Prove that $\angle QCB=\angle BAC$. [url=https://imgtu.com/i/4pZ7Zj][img]https://z3.ax1x.com/2021/09/12/4pZ7Zj.jpg[/img][/url]

Consider the following expression $$S = \log_2 \left( \sum^{2019}_{k=1}\sum^{2020}_{j=2}\log_{2^{1/k}} (j) \log_{j^2} \left(\sin \frac{\pi k}{2020}\right) \right).$$ Find the smallest integer $n$ which is bigger than $S$ (i.e. find $\lceil S \rceil$).

$k_1, k_2, k_3$ are three circles. $k_2$ and $k_3$ touch externally at $P$, $k_3$ and $k_1$ touch externally at $Q$, and $k_1$ and $k_2$ touch externally at $R$. The line $PQ$ meets $k_1$ again at $S$, the line $PR$ meets $k_1$ again at $T$. The line $RS$ meets $k_2$ again at $U$, and the line $QT$ meets $k_3$ again at $V$. Show that $P, U, V$ are collinear.

This is an ARML Super Relay! I'm sure you know how this works! You start from #1 and #15 and meet in the middle. We are going to require you to solve all $15$ problems, though -- so for the entire task, submit the sum of all the answers, rather than just the answer to #8. Also, uhh, we can't actually find the slip for #1. Sorry about that. Have fun anyways! Problem 2. Let $T = TNYWR$. Find the number of way to distribute $6$ indistinguishable pieces of candy to $T$ hungry (and distinguishable) schoolchildren, such that each child gets at most one piece of candy. Problem 3. Let $T = TNYWR$. If $d$ is the largest proper divisor of $T$, compute $\frac12 d$. Problem 4. Let $T = TNYWR$ and flip $4$ fair coins. Suppose the probability that at most $T$ heads appear is $\frac mn$, where $m$ and $n$ are coprime positive integers. Compute $m+n$. Problem 5. Let $T = TNYWR$. Compute the last digit of $T^T$ in base $10$. Problem 6. Let $T = TNYWR$ and flip $6$ fair coins. Suppose the probability that at most $T$ heads appear is $\frac mn$, where $m$ and $n$ are coprime positive integers. Compute $m+n$. Problem 7. Let $T = TNYWR$. Compute the smallest prime $p$ for which $n^T \not\equiv n \pmod{p}$ for some integer $n$. Problem 8. Let $M$ and $N$ be the two answers received, with $M \le N$. Compute the number of integer quadruples $(w,x,y,z)$ with $w+x+y+z = M \sqrt{wxyz}$ and $1 \le w,x,y,z \le N$. Problem 9. Let $T = TNYWR$. Compute the smallest integer $n$ with $n \ge 2$ such that $n$ is coprime to $T+1$, and there exists positive integers $a$, $b$, $c$ with $a^2+b^2+c^2 = n(ab+bc+ca)$. Problem 10. Let $T = TNYWR$ and flip $10$ fair coins. Suppose the probability that at most $T$ heads appear is $\frac mn$, where $m$ and $n$ are coprime positive integers. Compute $m+n$. Problem 11. Let $T = TNYWR$. Compute the last digit of $T^T$ in base $10$. Problem 12. Let $T = TNYWR$ and flip $12$ fair coins. Suppose the probability that at most $T$ heads appear is $\frac mn$, where $m$ and $n$ are coprime positive integers. Compute $m+n$. Problem 13. Let $T = TNYWR$. If $d$ is the largest proper divisor of $T$, compute $\frac12 d$. Problem 14. Let $T = TNYWR$. Compute the number of way to distribute $6$ indistinguishable pieces of candy to $T$ hungry (and distinguishable) schoolchildren, such that each child gets at most one piece of candy. Also, we can't find the slip for #15, either. We think the SFBA coaches stole it to prevent us from winning the Super Relay, but that's not going to stop us, is it? We have another #15 slip that produces an equivalent answer. Here you go! Problem 15. Let $A$, $B$, $C$ be the answers to #8, #9, #10. Compute $\gcd(A,C) \cdot B$.

$ n$ sets $ S_1$, $ S_2$ $ \cdots$, $ S_n$ consists of non-negative numbers. $ x_i$ is the sum of all elements of $ S_i$, prove that there is a natural number $ k$, $ 1<k<n$, and: \[ \sum_{i\equal{}1}^n x_i < \frac{1}{k\plus{}1} \left[ k \cdot \frac{n(n\plus{}1)(2n\plus{}1)}{6} \minus{} (k\plus{}1)^2 \cdot \frac{n(n\plus{}1)}{2} \right]\] and there exists subscripts $ i$, $ j$, $ t$, and $ l$ (at least $ 3$ of them are distinct) such that $ x_i \plus{} x_j \equal{} x_t \plus{} x_l$.

Nils has a telephone number with eight different digits. He has made $28$ cards with statements of the type “The digit $a$ occurs earlier than the digit $b$ in my telephone number” – one for each pair of digits appearing in his number. How many cards can Nils show you without revealing his number?

The football tournament, held in one round, involved $16$ teams, each two of which scored a different number of points. ($3$ points were given for a victory, $1$ point for a draw, $0$ points for a defeat.) It turned out that the Chisel team lost to all the teams that ultimately scored fewer points. What is the best result that the Chisel team could achieve (insert location)?

Let the major axis of an ellipse be $AB$, let $O$ be its center, and let $F$ be one of its foci. $P$ is a point on the ellipse, and $CD$ a chord through $O$, such that $CD$ is parallel to the tangent of the ellipse at $P$. $PF$ and $CD$ intersect at $Q$. Compare the lengths of $PQ$ and $OA$.

Let $I$ be the incenter of an acute triangle $ABC$. Assume that $K_1$ is the point such that $AK_1 \perp BC$ and the circle with center $K_1$ of radius $K_1A$ is internally tangent to the incircle of triangle $ABC$ at $A_1$. The points $B_1, C_1$ are defined similarly. a) Prove that $AA_1, BB_1, CC_1$ are concurrent at a point $P$. b) Let $\omega_1,\omega_2,\omega_3$ be the excircles of triangle $ABC$ with respect to $A, B, C$, respectively. The circles $\gamma_1,\gamma_2\gamma_3$ are the reflections of $\omega_1,\omega_2,\omega_3$ with respect to the midpoints of $BC, CA, AB$, respectively. Prove that P is the radical center of $\gamma_1,\gamma_2,\gamma_3$.

Let $n$ be a positive integer. Consider the sum $x_1y_1 + x_2y_2 +\cdots + x_ny_n$, where that values of the variables $x_1, x_2,\ldots, x_n, y_1, y_2,\ldots, y_n$ are either 0 or 1. Let $I(n)$ be the number of 2$n$-tuples $(x_1, x_2,\ldots, x_n, y_1, y_2,\ldots, y_n)$ such that the sum of the number is odd, and let $P(n)$ be the number of 2$n$-tuples $(x_1, x_2,\ldots, x_n, y_1, y_2,\ldots, y_n)$ such that the sum is an even number. Show that: \[ \frac{P(n)}{I(n)}=\frac{2^n+1}{2^n-1} \]

Let $ABC$ be a triangle and let $P$ be an interior point of $ABC$. We assume that a line $l$, which passes through $P$, but not through $A$, intersects $AB$ and $AC$ (or their extensions over $B$ or $C$) at $Q$ and $R$, respectively. Find $l$ such that the perimeter of the triangle $AQR$ is as small as possible.

The numbers $1,2,\dots,9$ are randomly placed into the $9$ squares of a $3 \times 3$ grid. Each square gets one number, and each of the numbers is used once. What is the probability that the sum of the numbers in each row and each column is odd? $\textbf{(A) }1/21\qquad\textbf{(B) }1/14\qquad\textbf{(C) }5/63\qquad\textbf{(D) }2/21\qquad\textbf{(E) } 1/7$

Find all real values of the real parameter $a$ such that the equation \[ 2x^{2}-6ax+4a^{2}-2a-2+\log_{2}(2x^{2}+2x-6ax+4a^{2})= \] \[ =\log_{2}(x^{2}+2x-3ax+2a^{2}+a+1). \] has a unique solution.

Consider those functions $ f: \mathbb{N} \mapsto \mathbb{N}$ which satisfy the condition \[ f(m \plus{} n) \geq f(m) \plus{} f(f(n)) \minus{} 1 \] for all $ m,n \in \mathbb{N}.$ Find all possible values of $ f(2007).$ [i]Author: Nikolai Nikolov, Bulgaria[/i]

The sum of all numbers of the form $ 2k \plus{} 1$, where $ k$ takes on integral values from $ 1$ to $ n$ is: $ \textbf{(A)}\ n^2 \qquad\textbf{(B)}\ n(n \plus{} 1) \qquad\textbf{(C)}\ n(n \plus{} 2) \qquad\textbf{(D)}\ (n \plus{} 1)^2 \qquad\textbf{(E)}\ (n \plus{} 1)(n \plus{} 2)$

Determine value of real parameter $\lambda$ such that equation $$\frac{1}{\sin{x}} + \frac{1}{\cos{x}} = \lambda $$ has root in interval $\left(0,\frac{\pi}{2}\right)$

Given is a triangle $ABC$ and the points $M, P$ lie on the segments $AB, BC$, respectively, such that $AM=BC$ and $CP=BM$. If $AP$ and $CM$ meet at $O$ and $2\angle AOM=\angle ABC$, find the measure of $\angle ABC$.

Let $$A = \{2, 4, \ldots, 1000\},$$ $$B = \{3, 6, \ldots, 999\},$$ $$C = \{5, 10, \ldots, 1000\},$$ $$D = \{7, 14, \ldots, 994\},$$ $$E = \{11, 22, \ldots, 990\},$$ $$\textrm{and } F = \{13, 26, \ldots, 988\}.$$ Find the number of elements in the set $(((((A\cup B)\cap C)\cup D)\cap E)\cup F)$. [i]2022 CCA Math Bonanza Individual Round #7[/i]

(a) Does there exist an infinite sequence of real numbers such that the sum of every ten successive numbers is positive, while for every $n$ the sum of the first $10n + 1$ successive numbers is negative? (b) Does there exist an infinite sequence of integers with the same properties? (AK Tolpygo)

There are $100$ people standing in a line from left to right. Half of them are randomly chosen to face right (with all ${100 \choose 50}$ possible choices being equally likely), and the others face left. Then, while there is a pair of people who are facing each other and have no one between them, the leftmost such pair leaves the line. Compute the expected number of people remaining once this process terminates.