Let $a_1,a_2,\cdots,a_n$ be a sequence of positive numbers, so that $a_1 + a_2 +\cdots + a_n \leq \frac 12$. Prove that \[(1 + a_1)(1 + a_2) \cdots (1 + a_n) < 2.\] [hide="Remark"]Remark. I think this problem was posted before, but I can't find the link now.[/hide]

Let $a_1, a_2,...,a_{51}$ be non-zero elements of a field of characteristic $p$. We simultaneously replace each element with the sum of the 50 remaining ones. In this way we get a sequence $b_1, ... , b_{51}$. If this new sequence is a permutation of the original one, find all possible values of $p$.

Show that exists a sequence of $ 100$ terms such that: 1)Every term is a perfect square 2) every term is greater than the one before it ( it is strictly increasing) 3)Every two terms of the sequence are relative prime 4) The average between two consecutive terms is also a perfect square Daniel

Let $n$ be a positive integer. Let $x_1$, $x_2$, $\ldots\,$, $x_n$ be a sequence of $n$ real numbers. Say that a sequence $a_1$, $a_2$, $\ldots\,$, $a_n$ is [i]unimodular[/i] if each $a_i$ is $\pm 1$. Prove that \[ \sum a_1 a_2 \ldots a_n (a_1x_1 + a_2x_2 + \cdots + a_nx_n)^n = 2^{n} n!\, x_1 x_2 \ldots x_n , \] where the sum is over all $2^{n}$ unimodular sequences $a_1$, $a_2$, $\ldots\,$, $a_n$.

The numbers $1$ to $12$ are arranged in a sequence. The number of ways this can be done equals $12 \times11 \times 10\times ...\times 1$. We impose the condition that in the sequence there should be exactly one number that is smaller than the number directly preceding it. How many of the $12 \times11 \times 10\times ...\times 1$ sequences satisfy this condition?

Given a non-negative integer \( n \), determine the values of \( c \) for which the sequence of numbers \[ a_n = 4^n c + \frac{4^n - (-1)^n}{5} \] contains at least one perfect square.

Does there exist a sequence $\displaystyle{\left( {{a_n}} \right)}$ of complex numbers such that for every positive integer $\displaystyle{p}$ we have that $\displaystyle{\sum\limits_{n = 1}^{ + \infty } {a_n^p} }$ converges if and only if $\displaystyle{p}$ is not a prime? [i]Proposed by Tomáš Bárta, Charles University, Prague.[/i]

[b]p1.[/b] There exist real numbers $B$, $M$, and $T$ such that $B + M + T = 23$ and $B - M - T = 20$. Compute $M + T$. [b]p2.[/b] Kaity has a rectangular garden that measures $10$ yards by $12$ yards. Austin’s triangular garden has side lengths $6$ yards, $8$ yards, and $10$ yards. Compute the ratio of the area of Kaity’s garden to the area of Austin’s garden. [b]p3.[/b] Nikhil’s mom and brother both have ages under $100$ years that are perfect squares. His mom is $33$ years older than his brother. Compute the sum of their ages. [b]p4.[/b] Madison wants to arrange $3$ identical blue books and $2$ identical pink books on a shelf so that each book is next to at least one book of the other color. In how many ways can Madison arrange the books? [b]p5.[/b] Two friends, Anna and Bruno, are biking together at the same initial speed from school to the mall, which is $6$ miles away. Suddenly, $1$ mile in, Anna realizes that she forgot her calculator at school. If she bikes $4$ miles per hour faster than her initial speed, she could head back to school and still reach the mall at the same time as Bruno, assuming Bruno continues biking towards the mall at their initial speed. In miles per hour, what is Anna and Bruno’s initial speed, before Anna has changed her speed? (Assume that the rate at which Anna and Bruno bike is constant.) [b]p6.[/b] Let a number be “almost-perfect” if the sum of its digits is $28$. Compute the sum of the third smallest and third largest almost-perfect $4$-digit positive integers. [b]p7.[/b] Regular hexagon $ABCDEF$ is contained in rectangle $PQRS$ such that line $\overline{AB}$ lies on line $\overline{PQ}$, point $C$ lies on line $\overline{QR}$, line $\overline{DE}$ lies on line $\overline{RS}$, and point $F$ lies on line $\overline{SP}$. Given that $PQ = 4$, compute the perimeter of $AQCDSF$. [img]https://cdn.artofproblemsolving.com/attachments/6/7/5db3d5806eaefa00d7fc90fb786a41c0466a90.png[/img] [b]p8.[/b] Compute the number of ordered pairs $(m, n)$, where $m$ and $n$ are relatively prime positive integers and $mn = 2520$. (Note that positive integers $x$ and $y$ are relatively prime if they share no common divisors other than $1$. For example, this means that $1$ is relatively prime to every positive integer.) [b]p9.[/b] A geometric sequence with more than two terms has first term $x$, last term $2023$, and common ratio $y$, where $x$ and $y$ are both positive integers greater than $1$. An arithmetic sequence with a finite number of terms has first term $x$ and common difference $y$. Also, of all arithmetic sequences with first term $x$, common difference $y$, and no terms exceeding $2023$, this sequence is the longest. What is the last term of the arithmetic sequence? [b]p10.[/b] Andrew is playing a game where he must choose three slips, uniformly at random and without replacement, from a jar that has nine slips labeled $1$ through $9$. He wins if the sum of the three chosen numbers is divisible by $3$ and one of the numbers is $1$. What is the probability Andrew wins? [b]p11.[/b] Circle $O$ is inscribed in square $ABCD$. Let $E$ be the point where $O$ meets line segment $\overline{AB}$. Line segments $\overline{EC}$ and $\overline{ED}$ intersect $O$ at points $P$ and $Q$, respectively. Compute the ratio of the area of triangle $\vartriangle EPQ$ to the area of triangle $\vartriangle ECD$. [b]p12.[/b] Define a recursive sequence by $a_1 = \frac12$ and $a_2 = 1$, and $$a_n =\frac{1 + a_{n-1}}{a_{n-2}}$$ for n ≥ 3. The product $a_1a_2a_3 ... a_{2023}$ can be expressed in the form $a^b \cdot c^d \cdot e^f$ , where $a$, $b$, $c$, $d$, $e$, and $f$ are positive (not necessarily distinct) integers, and a, c, and e are prime. Compute $a + b + c + d + e + f$. [b]p13.[/b] An increasing sequence of $3$-digit positive integers satisfies the following properties: $\bullet$ Each number is a multiple of $2$, $3$, or $5$. $\bullet$ Adjacent numbers differ by only one digit and are relatively prime. (Note that positive integers x and y are relatively prime if they share no common divisors other than $1$.) What is the maximum possible length of the sequence? [b]p14.[/b] Circles $O_A$ and $O_B$ with centers $A$ and $B$, respectively, have radii $3$ and $8$, respectively, and are internally tangent to each other at point $P$. Point $C$ is on circle $O_A$ such that line $\overline{BC}$ is tangent to circle $OA$. Extend line $\overline{PC}$ to intersect circle $O_B$ at point $D \ne P$. Compute $CD$. [b]p15.[/b] Compute the product of all real solutions $x$ to the equation $x^2 + 20x - 23 = 2 \sqrt{x^2 + 20x + 1}$. [b]p16.[/b] Compute the number of divisors of $729, 000, 000$ that are perfect powers. (A perfect power is an integer that can be written in the form $a^b$, where $a$ and $b$ are positive integers and $b > 1$.) [b]p17.[/b] The arithmetic mean of two positive integers $x$ and $y$, each less than $100$, is $4$ more than their geometric mean. Given $x > y$, compute the sum of all possible values for $x + y$. (Note that the geometric mean of $x$ and $y$ is defined to be $\sqrt{xy}$.) [b]p18.[/b] Ankit and Richard are playing a game. Ankit repeatedly writes the digits $2$, $0$, $2$, $3$, in that order, from left to right on a board until Richard tells him to stop. Richard wins if the resulting number, interpreted as a base-$10$ integer, is divisible by as many positive integers less than or equal to $12$ as possible. For example, if Richard stops Ankit after $7$ digits have been written, the number would be $2023202$, which is divisible by $1$ and $2$. Richard wants to win the game as early as possible. Assuming Ankit must write at least one digit, after how many digits should Richard stop Ankit? [b]p19.[/b] Eight chairs are set around a circular table. Among these chairs, two are red, two are blue, two are green, and two are yellow. Chairs that are the same color are identical. If rotations and reflections of arrangements of chairs are considered distinct, how many arrangements of chairs satisfy the property that each pair of adjacent chairs are different colors? [b]p20.[/b] Four congruent spheres are placed inside a right-circular cone such that they are all tangent to the base and the lateral face of the cone, and each sphere is tangent to exactly two other spheres. If the radius of the cone is $1$ and the height of the cone is $2\sqrt2$, what is the radius of one of the spheres? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given are the sequences \[ (..., a_{-2}, a_{-1}, a_0, a_1, a_2, ...); (..., b_{-2}, b_{-1}, b_0, b_1, b_2, ...); (..., c_{-2}, c_{-1}, c_0, c_1, c_2, ...)\] of positive real numbers. For each integer $n$ the following inequalities hold: \[a_n \geq \frac{1}{2} (b_{n+1} + c_{n-1})\] \[b_n \geq \frac{1}{2} (c_{n+1} + a_{n-1})\] \[c_n \geq \frac{1}{2} (a_{n+1} + b_{n-1})\] Determine $a_{2005}$, $b_{2005}$, $c_{2005}$, if $a_0 = 26, b_0 = 6, c_0 = 2004$.

Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a continuous function with the following property: for all $\alpha \in \mathbb{R}_{>0}$, the sequence $(a_n)_{n \in \mathbb{N}}$ defined as $a_n = f(n\alpha)$ satisfies $\lim_{n \to \infty} a_n = 0$. Is it necessarily true that $\lim_{x \to +\infty} f(x) = 0$?

Let $a_1, a_2, a_3, ...$ be a sequence of positive real numbers. Prove that for any positive integer $n$ the inequality holds $\sum_{i=1}^n b_i^2 \le 4 \sum_{i=1}^n a_i^2$ where $b_i$ is the arithmetic mean of the numbers $a_1, a_2, ..., a_n$

Is it possible to partition the set of positive integer numbers into two classes, none of which contains an infinite arithmetic sequence (with a positive ratio)? What is we impose the extra condition that in each class $\mathcal{C}$ of the partition, the set of difference \begin{align*} \left\{ \min \{ n \in \mathcal{C} \mid n >m \} -m \mid m \in \mathcal{C} \right \} \end{align*} be bounded?

Let $p$ be a prime number greater than 5. Let $f(p)$ denote the number of infinite sequences $a_1, a_2, a_3,\ldots$ such that $a_n \in \{1, 2,\ldots, p-1\}$ and $a_na_{n+2}\equiv1+a_{n+1}$ (mod $p$) for all $n\geq 1.$ Prove that $f(p)$ is congruent to 0 or 2 (mod 5).

Let $m \geq 2$ be a fixed positive integer, and $(a_n)_{n\geq 1}$ be a sequence of nonnegative real numbers such that, for all $n\geq 1$, we have that $a_{n+1} \leq a_n - a_{mn}$. a) Prove that the sequence $b_n = \sum_{k=1}^{n} a_k$ is bounded above. b) Prove that the sequence $c_n = \sum_{k=1}^{n} k^2 a_k$ is bounded above.

Let the sequence $\{a_n\}$ satisfy $a_{n+1}=a_n^3+103,n=1,2,...$. Prove that at most one integer $n$ such that $a_n$ is a perfect square.