Found problems: 5923
Let $a_1$, $a_2$, $\ldots$, $a_n$ be a geometric progression with $a_1 = \sqrt{2}$ and $a_2 = \sqrt[3]{3}$. What is \[\displaystyle{\frac{a_1+a_{2013}}{a_7+a_{2019}}}?\]
Let $\{a_n\}$ be a sequence of integers satisfying $(n-1)a_{n+1}=(n+1)a_n-2(n-1) \forall n\ge 1$. If $2000|a_{1999}$, find the smallest $n\ge 2$ such that $2000|a_n$.
Let $A$ and $B$ be positive integers. Define the arithmetic sequence $a_0, a_1, a_2, ...$ by $a_n = A_n + B$. Suppose that there exists an $n\ge 0$ such that $a_n$ is a square. Let $M$ be a positive integer such that $M^2$ is the smallest square in the sequence. Prove that $M < A +\sqrt{B}$.
A sequence $a_0,a_1,a_2,\cdots$ satisfies the conditions $a_0 = 0$ , $a_{n-1}^2 - a_{n-1} = a_n^2 + a_n$
1) determine the two possible values of $a_1$ . then determine all possible values of $a_2$ .
2)for each $n$, prove that $a_{n+1}=a_n+1$ or $a_{n+1} = -a_n$
3)Describe the possible values of $a_{1435}$
4)Prove that the values that you got in (3) are correct
The sequence $a_0,a_1,a_2,\dots$ is recursively defined by \[ a_0 = 1 \quad \text{and} \quad a_n = a_{n-1} \cdot \left(4-\frac{2}{n} \right) \quad \text{for } n \geq 1. \] Prove for each integer $n \geq 1$:
(a) The number $a_n$ is a positive integer.
(b) Each prime $p$ with $n < p \leq 2n$ is a divisor of $a_n$.
(c) If $n$ is a prime, then $a_n-2$ is divisible by $n$.
Let ${ a\uparrow\uparrow b = {{{{{a^{a}}^a}^{\dots}}}^{a}}^{a}} $, where there are $ b $ a's in total. That is $ a\uparrow\uparrow b $ is given by the recurrence \[ a\uparrow\uparrow b = \begin{cases} a & b=1\\ a^{a\uparrow\uparrow (b-1)} & b\ge2\end{cases} \] What is the remainder of $ 3\uparrow\uparrow( 3\uparrow\uparrow ( 3\uparrow\uparrow 3)) $ when divided by $ 60 $?
[b]p1.[/b] If $x^2 = 7$, what is $x^4 + x^2 + 1$?
[b]p2.[/b] Richard and Alex are competing in a $150$-meter race. If Richard runs at a constant speed of $5$ meters per second and Alex runs at a constant speed of $3$ meters per second, how many more seconds does it take for Alex to finish the race?
[b]p3.[/b] David and Emma are playing a game with a chest of $100$ gold coins. They alternate turns, taking one gold coin if the chest has an odd number of gold coins or taking exactly half of the gold coins if the chest has an even number of gold coins. The game ends when there are no more gold coins in the chest. If Emma goes first, how many gold coins does Emma have at the end?
[b]p4.[/b] What is the only $3$-digit perfect square whose digits are all different and whose units digit is $5$?
[b]p5.[/b] In regular pentagon $ABCDE$, let $F$ be the midpoint of $\overline{AB}$, $G$ be the midpoint of $\overline{CD}$, and $H$ be the midpoint of $\overline{AE}$. What is the measure of $\angle FGH$ in degrees?
[b]p6.[/b] Water enters at the left end of a pipe at a rate of $1$ liter per $35$ seconds. Some of the water exits the pipe through a leak in the middle. The rest of the water exits from the right end of the pipe at a rate of $1$ liter per $36$ seconds. How many minutes does it take for the pipe to leak a liter of water?
[b]p7.[/b] Carson wants to create a wire frame model of a right rectangular prism with a volume of $2022$ cubic centimeters, where strands of wire form the edges of the prism. He wants to use as much wire as possible. If Carson also wants the length, width, and height in centimeters to be distinct whole numbers, how many centimeters of wire does he need to create the prism?
[b]p8.[/b] How many ways are there to fill the unit squares of a $3 \times 5$ grid with the digits $1$, $2$, and $3$ such that every pair of squares that share a side differ by exactly $1$?
[b]p9.[/b] In pentagon ABCDE, $AB = 54$, $AE = 45$, $DE = 18$, $\angle A = \angle C = \angle E$, $D$ is on line segment $\overline{BE}$, and line $BD$ bisects angle $\angle ABC$, as shown in the diagram below. What is the perimeter of pentagon $ABCDE$?
[img]https://cdn.artofproblemsolving.com/attachments/2/0/7c25837bb10b128a1c7a292f6ce8ce3e64b292.png[/img]
[b]p10.[/b] If $x$ and $y$ are nonzero real numbers such that $\frac{7}{x} + \frac{8}{y} = 91$ and $\frac{6}{x} + \frac{10}{y} = 89$, what is the value of $x + y$?
[b]p11.[/b] Hilda and Marianne play a game with a shued deck of $10$ cards, numbered from $1$ to $10$. Hilda draws five cards, and Marianne picks up the five remaining cards. Hilda observes that she does not have any pair of consecutive cards - that is, no two cards have numbers that differ by exactly $1$. Additionally, the sum of the numbers on Hilda's cards is $1$ less than the sum of the numbers on Marianne's cards. Marianne has exactly one pair of consecutive cards - what is the sum of this pair?
[b]p12.[/b] Regular hexagon $AUSTIN$ has side length $2$. Let $M$ be the midpoint of line segment $\overline{ST}$. What is the area of pentagon $MINUS$?
[b]p13.[/b] At a collector's store, plushes are either small or large and cost a positive integer number of dollars. All small plushes cost the same price, and all large plushes cost the same price. Two small plushes cost exactly one dollar less than a large plush. During a shopping trip, Isaac buys some plushes from the store for 59 dollars. What is the smallest number of dollars that the small plush could not possibly cost?
[b]p14.[/b] Four fair six-sided dice are rolled. What is the probability that the median of the four outcomes is $5$?
[b]p15.[/b] Suppose $x_1, x_2,..., x_{2022}$ is a sequence of real numbers such that:
$x_1 + x_2 = 1$
$x_2 + x_3 = 2$
$...$
$x_{2021} + x_{2022} = 2021$
If $x_1 + x_{499} + x_{999} + x_{1501} = 222$, then what is the value of $x_{2022}$?
[b]p16.[/b] A cone has radius $3$ and height $4$. An infinite number of spheres are placed in the cone in the following way: sphere $C_0$ is placed inside the cone such that it is tangent to the base of the cone and to the curved surface of the cone at more than one point, and for $i \ge 1$, sphere $C_i$ is placed such that it is externally tangent to sphere $C_{i-1}$ and internally tangent to more than one point of the curved surface of the cone. If $V_i$ is the volume of sphere $C_i$, compute $V_0 + V_1 + V_2 + ... $ .
[img]https://cdn.artofproblemsolving.com/attachments/b/4/b43e40bb0a5974dd9d656691c14b4ae268b5b5.png[/img]
[b]p17.[/b] Call an ordered pair, $(x, y)$, relatable if $x$ and $y$ are positive integers where $y$ divides $3600$, $x$ divides $y$ and $\frac{y}{x}$ is a prime number. For every relatable ordered pair, Leanne wrote down the positive difference of the two terms of the pair. What is the sum of the numbers she wrote down?
[b]p18.[/b] Let $r, s$, and $t$ be the three roots of $P(x) = x^3 - 9x - 9$. Compute the value of $(r^3 + r^2 - 10r - 8)(s^3 + s^2 - 10s - 8)(t^3 + t^2 - 10t - 8)$.
[b]p19.[/b] Compute the number of ways to color the digits $0, 1, 2, 3, 4, 5, 6, 7, 8$ and $9$ red, blue, or green such that:
(a) every prime integer has at least one digit that is not blue, and
(b) every composite integer has at least one digit that is not green.
Note that $0$ is not composite. For example, since $12$ is composite, either the digit $1$, the digit $2$, or both must be not green.
[b]p20.[/b] Pentagon $ABCDE$ has $AB = DE = 4$ and $BC = CD = 9$ with $\angle ABC = \angle CDE = 90^o$, and there exists a circle tangent to all five sides of the pentagon. What is the length of segment $\overline{AE}$?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $ \left(a_{n}\right)$ be the sequence of reals defined by $ a_{1}=\frac{1}{4}$ and the recurrence $ a_{n}= \frac{1}{4}(1+a_{n-1})^{2}, n\geq 2$. Find the minimum real $ \lambda$ such that for any non-negative reals $ x_{1},x_{2},\dots,x_{2002}$, it holds
\[ \sum_{k=1}^{2002}A_{k}\leq \lambda a_{2002}, \]
where $ A_{k}= \frac{x_{k}-k}{(x_{k}+\cdots+x_{2002}+\frac{k(k-1)}{2}+1)^{2}}, k\geq 1$.
A natural number is called a [i]prime power[/i] if that number can be expressed as $p^n$ for some prime $p$ and natural number $n$.
Determine the largest possible $n$ such that there exists a sequence of prime powers $a_1, a_2, \dots, a_n$ such that $a_i = a_{i - 1} + a_{i - 2}$ for all $3 \le i \le n$.
Let $p$ and $q$ be different primes, and $\alpha\in (0, 3)$ a real number. Prove that in sequence
$$\left[ \alpha \right] , \left[ 2\alpha \right] , \left[ 3\alpha \right] \dots$$
exists number less than $2pq$, divisible by $p$ or $q$.
A sequence $a_n$ is defined by
$$a_0=0,\qquad a_1=3;$$$$a_n=8a_{n-1}+9a_{n-2}+16\text{ for }n\ge2.$$Find the least positive integer $h$ such that $a_{n+h}-a_n$ is divisible by $1999$ for all $n\ge0$.
Let \(n\) be a non-negative integer and define \(a_n = 2^n - n\). Determine all non-negative integers \(m\) such that \(s_m = a_0 + a_1 + \dots + a_m\) is a power of 2.
Consider the sequence $p_{1},p_{2},...$ of primes such that for each $i\geq2$, either $p_{i}=2p_{i-1}-1$ or $p_{i}=2p_{i-1}+1$. Show that any such sequence has a finite number of terms.
Define a sequence $\{a_n\}$ by\[a_0=\frac{1}{2},\ a_{n+1}=a_{n}+\frac{a_{n}^2}{2012}, (n=0,\ 1,\ 2,\ \cdots),\] find integer $k$ such that $a_{k}<1<a_{k+1}.$
(September 29, 2012, Hohhot)
A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula
\[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0;
\]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large.
[i]Proposed by Harmel Nestra, Estionia[/i]
The positive sequence $\{a_n\}$ satisfies:$a_1=1$ and $$a_n=2+\sqrt{a_{n-1}}-2 \sqrt{1+\sqrt{a_{n-1}}}(n\geq 2)$$
Let $S_n=\sum\limits_{k=1}^{n}{2^ka_k}$. Find the value of $S_{2023}$.
Determine the number of ways to partition the $n^2$ squares of an $n\times n$ grid into $n$ connected pieces of sizes $1$, $3$, $5$, $\dots$, $2n-1$ so that each piece is symmetric across the diagonal connecting the bottom right to the top left corner of the grid.
A connected piece is a set of squares that any two of them are connected by a sequence of adjacent squares in the set. Two squares are adjacent if and only if they share an edge.
Consider the set of all strictly decreasing sequences of $n$ natural numbers having the property that in each sequence no term divides any other term of the sequence. Let $A = (a_j)$ and $B = (b_j)$ be any two such sequences. We say that $A$ precedes $B$ if for some $k$, $a_k < b_k$ and $a_i = b_i$ for $i < k$. Find the terms of the first sequence of the set under this ordering.
Consider the sequence of six real numbers 60, 10, 100, 150, 30, and $x$. The average (arithmetic mean) of this sequence is equal to the median of the sequence. What is the sum of all the possible values of $x$? (The median of a sequence of six real numbers is the average of the two middle numbers after all the numbers have been arranged in increasing order.)
The sequence $(z_n)$ of complex numbers satisfies the following properties:
[list]
[*]$z_1$ and $z_2$ are not real.
[*]$z_{n+2}=z_{n+1}^2z_n$ for all integers $n\geq 1$.
[*]$\dfrac{z_{n+3}}{z_n^2}$ is real for all integers $n\geq 1$.
[*]$\left|\dfrac{z_3}{z_4}\right|=\left|\dfrac{z_4}{z_5}\right|=2$. [/list]
Find the product of all possible values of $z_1$.
[b]p1.[/b] Ana, Bob, Cho, Dan, and Eve want to use a microwave. In order to be fair, they choose a random order to heat their food in (all orders have equal probability). Ana's food needs $5$ minutes to cook, Bob's food needs $7$ minutes, Cho's needs $1$ minute, Dan's needs $12$ minutes, and Eve's needs $5$ minutes. What is the expected number of minutes Bob has to wait for his food to be done?
[b]p2.[/b] $ABC$ is an equilateral triangle. $H$ lies in the interior of $ABC$, and points $X$, $Y$, $Z$ lie on sides $AB, BC, CA$, respectively, such that $HX\perp AB$, $HY \perp BC$, $HZ\perp CA$. Furthermore, $HX =2$, $HY = 3$, $HZ = 4$. Find the area of triangle $ABC$.
[b]p3.[/b] Amy, Ben, and Chime play a dice game. They each take turns rolling a die such that the $first$ person to roll one of his favorite numbers wins. Amy's favorite number is $1$, Ben's favorite numbers are $2$ and $3$, and Chime's are $4$, $5$, and $6$. Amy rolls first, Ben rolls second, and Chime rolls third. If no one has won after Chime's turn, they repeat the sequence until someone has won. What's the probability that Chime wins the game?
[b]p4.[/b] A point $P$ is chosen randomly in the interior of a square $ABCD$. What is the probability that the angle $\angle APB$ is obtuse?
[b]p5.[/b] Let $ABCD$ be the quadrilateral with vertices $A = (3, 9)$, $B = (1, 1)$, $C = (5, 3)$, and $D = (a, b)$, all of which lie in the first quadrant. Let $M$ be the midpoint of $AB$, $N$ the midpoint of $BC$, $O$ the midpoint of $CD$, and $P$ the midpoint of $AD$. If $MNOP$ is a square, find $(a, b)$.
[b]p6.[/b] Let $M$ be the number of positive perfect cubes that divide $60^{60}$. What is the prime factorization of $M$?
[b]p7.[/b] Given that $x$, $y$, and $z$ are complex numbers with $|x|=|y| =|z|= 1$, $x + y + z = 1$ and $xyz = 1$, find $|(x + 2)(y + 2)(z + 2)|$.
[b]p8.[/b] If $f(x)$ is a polynomial of degree $2008$ such that $f(m) = \frac{1}{m}$ for $m = 1, 2, ..., 2009$, find $f(2010)$.
[b]p9.[/b] A drunkard is randomly walking through a city when he stumbles upon a $2 \times 2$ sliding tile puzzle. The puzzle consists of a $2 \times 2$ grid filled with a blank square, as well as $3$ square tiles, labeled $1$, $2$, and $3$. During each turn you may fill the empty square by sliding one of the adjacent tiles into it. The following image shows the puzzle's correct state, as well as two possible moves you can make:
[img]https://cdn.artofproblemsolving.com/attachments/c/6/7ddd9305885523deeee2a530dc90505875d1cc.png[/img]
Assuming that the puzzle is initially in an incorrect (but solvable) state, and that the drunkard will make completely random moves to try and solve it, how many moves is he expected to make before he restores the puzzle to its correct state?
[b]p10.[/b] How many polynomials $p(x)$ exist such that the coeffients of $p(x)$ are a rearrangement of $\{0, 1, 2, .., deg \, p(x)\}$ and all of the roots of $p(x)$ are rational? (Note that the leading coefficient of $p(x)$ must be nonzero.)
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $m$ be an integer where $|m|\ge 2$. Let $a_1,a_2,\cdots$ be a sequence of integers such that $a_1,a_2$ are not both zero, and for any positive integer $n$, $a_{n+2}=a_{n+1}-ma_n$.
Prove that if positive integers $r>s\ge 2$ satisfy $a_r=a_s=a_1$, then $r-s\ge |m|$.
Do there exist a positive integer $k$ and a non-constant sequence $a_1, a_2, a_3, ...$ of positive integers such that $a_n = gcd(a_{n+k}, a_{n+k+1})$ for all positive integers $n$?
For some positive integer \( n \), Katya wrote the numbers from \( 1 \) to \( 2^n \) in a row in increasing order. Oleksii rearranged Katya's numbers and wrote the new sequence directly below the first row. Then, they calculated the sum of the two numbers in each column.
Katya calculated \( N \), the number of powers of two among the results, while Oleksii calculated \( K \), the number of distinct powers of two among the results. What is the maximum possible value of \( N + K \)?
[i]Proposed by Oleksii Masalitin[/i]
Determine whether or not there exists a sequence of integers $a_1,a_2,\dots, a_{19}, a_{20}$ such that, the sum of all the terms is negative, and the sum of any three consecutive terms is positive.