Found problems: 5923
A sequence of numbers starts with $ 1$, $ 2$, and $ 3$. The fourth number of the sequence is the sum of the previous three numbers in the sequence: $ 1\plus{}2\plus{}3\equal{}6$. In the same way, every number after the fourth is the sum of the previous three numbers. What is the eighth number in the sequence?
$ \textbf{(A)}\ 11 \qquad
\textbf{(B)}\ 20 \qquad
\textbf{(C)}\ 37 \qquad
\textbf{(D)}\ 68 \qquad
\textbf{(E)}\ 99$
let $(a_{n})$ be an arbitrary sequence of positive numbers. Show that
$$\limsup_{n\to \infty} \left(\frac{a_1 +a_{n+1}}{a_{n}}\right)^{n} \geq e.$$
A sequence $(a_n)_{-\infty}^{-\infty}$ of zeros and ones is given. It is known that $a_n = 0$ if and only if $a_{n-6} + a_{n-5} +...+ a_{n-1}$ is a multiple of $3$, and not all terms of the sequence are zero. Determine the maximum possible number of zeros among $a_0,a_1,...,a_{97}$.
A word of length $n$ that consists only of the digits $0$ and $1$, is called a bit-string of length $n$. (For example, $000$ and $01101$ are bit-strings of length 3 and 5.) Consider the sequence $s(1), s(2), ...$ of bit-strings of length $n > 1$ which is obtained as follows :
(1) $s(1)$ is the bit-string $00...01$, consisting of $n - 1$ zeros and a $1$ ;
(2) $s(k+1)$ is obtained as follows :
(a) Remove the digit on the left of $s(k)$. This gives a bit-string $t$ of length $n - 1$.
(b) Examine whether the bit-string $t1$ (length $n$, adding a $1$ after $t$) is already in $\{s(1), s(2), ..., s(k)\}$. If this is the not case, then $s(k+1) = t1$. If this is the case then $s(k+1) = t0$.
For example, if $n = 3$ we get :
$s(1) = 001 \rightarrow s(2) = 011 \rightarrow s(3) = 111 \rightarrow s(4) = 110 \rightarrow s(5) = 101$
$\rightarrow s(6) = 010 \rightarrow s(7) = 100 \rightarrow s(8) = 000 \rightarrow s(9) = 001 \rightarrow ...$
Suppose $N = 2^n$.
Prove that the bit-strings $s(1), s(2), ..., s(N)$ of length $n$ are all different.
A number of robots are placed on the squares of a finite, rectangular grid of squares. A square can hold any number of robots. Every edge of each square of the grid is classified as either passable or impassable. All edges on the boundary of the grid are impassable. You can give any of the commands up, down, left, or right.
All of the robots then simultaneously try to move in the specified direction. If the edge adjacent to a robot in that direction is passable, the robot moves across the edge and into the next square. Otherwise, the robot remains on its current square. You can then give another command of up, down, left, or right, then another, for as long as you want. Suppose that for any individual robot, and any square on the grid, there is a finite sequence of commands that will move that robot to that square. Prove that you can also give a finite sequence of commands such that all of the robots end up on the same square at the same time.
Let $(a_i)_{i\in \mathbb N}$ be a strictly increasing sequence of positive real numbers such that $\lim_{i \to \infty} a_i = +\infty$ and $a_{i+1}/a_i \leq 10$ for each $i$. Prove that for every positive integer $k$ there are infinitely many pairs $(i, j)$ with $10^k \leq a_i/a_j \leq 10^{k+1}.$
For each integer sequence $a_1, a_2, a_3, \dots, a_n$, a [i]single parity swapping[/i] is to choose $2$ terms in this sequence, say $a_i$ and $a_j$, such that $a_i + a_j$ is odd, then switch their placement, while the other terms stay in place. This creates a new sequence.
Find the minimal number of single parity swapping to transform the sequence $1,2,3, \dots, 2025$ to $2025, \dots, 3, 2, 1$, using only single parity swapping.
Given three letters $X, Y, Z$, we can construct letter sequences arbitrarily, such as $XZ, ZZYXYY, XXYZX$, etc. For any given sequence, we can perform following operations:
$T_1$: If the right-most letter is $Y$, then we can add $YZ$ after it, for example, $T_1(XYZXXY) =
(XYZXXYYZ).$
$T_2$: If The sequence contains $YYY$, we can replace them by $Z$, for example, $T_2(XXYYZYYYX) =
(XXYYZZX).$
$T_3$: We can replace $Xp$ ($p$ is any sub-sequence) by $XpX$, for example, $T_3(XXYZ) = (XXYZX).$
$T_4$: In a sequence containing one or more $Z$, we can replace the first $Z$ by $XY$, for example,
$T_4(XXYYZZX) = (XXYYXYZX).$
$T_5$: We can replace any of $XX, YY, ZZ$ by $X$, for example, $T_5(ZZYXYY) = (XYXX)$ or $(XYXYY)$ or $(ZZYXX).$
Using above operations, can we get $XYZZ$ from $XYZ \ ?$
[u]Round 9[/u]
[b]p25.[/b] What is the largest integer that cannot be expressed as the sum of nonnegative multiples of $7$, $11$, and $13$?
[b]p26.[/b] Evaluate $12{3 \choose3}+ 11{4\choose 3}+ 10{5\choose 3}+ ...+ 2{13\choose 3}+{14 \choose 3}$.
[b]p27.[/b] Worker Bob drives to work at $30$ mph half the time and $60$ mph half the time. He returns home along the same route at $30$ mph half the distance and $60$ mph half the distance. What is his average speed along the entire trip, in mph?
[u]Round 10[/u]
[b]p28.[/b] In quadrilateral $ABCD$, diagonals $\overline{AC}$ and $\overline{BD}$ intersect at $P$ with $BP = 4$, $P D = 6$, $AP = 8$, $P C = 3$, and $AB = 6$. What is the length of $AD$?
[b]p29.[/b] Find all positive integers $x$ such that$ x^2 + 17x + 17$ is a square number.
[b]p30.[/b] Zach has ten weighted coins that turn up heads with probabilities $\frac{2}{11^2}$ ,$\frac{2}{10^2}$ ,$\frac{2}{9^2}$ $, . . $.,$\frac{2}{2^2}$ . If he flips all ten coins simultaneously, then what is the probability that he will get an even number of heads?
[u]Round 11[/u]
[b]p31.[/b] Given a sequence $a_1, a_2, . . .$ such that $a_1 = 3$ and $a_{n+1} = a^2_n - 2a_n + 2$ for $n \ge 1$, find the remainder when the product a1a2 · · · a2012 is divided by 100.
[b]p32.[/b] Let $ABC$ be an equilateral triangle and let $O$ be its circumcircle. Let $D$ be a point on $\overline{BC}$, and extend $\overline{AD}$ to intersect $O$ at $P$. If $BP = 5$ and $CP = 4$, then what is the value of $DP$?
[b]p33.[/b] Surya and Hao take turns playing a game on a calendar. They start with the date January $1$ and they can either increase the month to a later month or increase the day to a later day in that month but not both. The first person to adjust the date to December $31$ is the winner. If Hao goes first, then what is the first date that he must choose to ensure that he does not lose?
[u]Round 12[/u]
[b]p34.[/b] On May $5$, $1868$, exactly $144$ years before today, Memorial Day in the United States was officially proclaimed. The first Memorial Day took place that year on May $30$ at Waterloo, New York. On May $5$, $2012$, at $12:00$ PM, how many results did the search “memorial day” on Google return? The search phrase is in quotes, so Google will only return sites that have the words memorial and day next to each other in that order. Let $N = max-\{0, \rfloor 15.5 \times \frac{ Your\,\,\, Answer}{Actual \,\,\,Answer} \rfloor \}$. You will earn the number of points equal to $min\{N, max\{0, 30 - N\}\}$.
[b]p35.[/b] Estimate the side length of a regular pentagon whose area is $2012$. You will earn the number of points equal to $max\{0, 15 - \lfloor 5 \times |Your \,\,\,Answer - Actual \,\,\,Answer| \rfloor \}$.
[b]p36.[/b] Write down one integer between $1$ and $15$, inclusive. (If you do not, then you will receive $0$ points.) Let the number that you submit be $x$. Let $\overline{x}$ be the arithmetic mean of all of the valid numbers submitted by all of the teams. If $x > \overline{x}$, then you will receive $0$ points; otherwise, you will receive $x$ points.
PS. You should use hide for answers.Rounds 1-4 are [url=https://artofproblemsolving.com/community/c3h3134177p28401527]here [/url] and 6-8 [url=https://artofproblemsolving.com/community/c3h3134466p28406321]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Find all infinite sequences of real numbers $ \left( a_n \right)_{n\ge 1} $ that verify, for any natural number $ n, $ the inequalities
$$ \frac{1}{2\sqrt{a_{n+1}}} <\sqrt{n+1} -\sqrt{n} <\frac{1}{ 2\sqrt{a_n}} . $$
Let the sequence $a_1,a_2,\ldots,a_n,\ldots$ is defined by the conditions: $a_1=2$ and $a_{n+1}=a_n^2-a_n+1$ $(n=1,2,\ldots)$. Prove that:
(a) $a_m$ and $a_n$ are relatively prime numbers when $m\ne n$.
(b) $\lim_{n\to\infty}\sum_{k=1}^n\frac1{a_k}=1$
[i]I. Tonov[/i]
The sequence $f_0, f_1, \dots$ of polynomials in $\mathbb{F}_{11}[x]$ is defined by $f_0(x) = x$ and $f_{n+1}(x) = f_n(x)^{11} - f_n(x)$ for all $n \ge 0$. Compute the remainder when the number of nonconstant monic irreducible divisors of $f_{1000}(x)$ is divided by $1000$.
[i]Proposed by Ankan Bhattacharya[/i]
Let $(a_{n})_{n\geq 1}$ and $(b_{n})_{n\geq 1}$ be the sequence of positive integers defined by $a_{n+1}=na_{n}+1$ and $b_{n+1}=nb_{n}-1$ for $n\geq 1$. Show that the two sequence cannot have infinitely many common terms.
[i]Laurentiu Panaitopol[/i]
Let $ a_0$, $ a_1$, $ a_2$, $ \ldots$ be a sequence of positive integers such that the greatest common divisor of any two consecutive terms is greater than the preceding term; in symbols, $ \gcd (a_i, a_{i \plus{} 1}) > a_{i \minus{} 1}$. Prove that $ a_n\ge 2^n$ for all $ n\ge 0$.
[i]Proposed by Morteza Saghafian, Iran[/i]
Let $c>1$ be a real constant. For the sequence $a_1,a_2,...$ we have: $a_1=1$, $a_2=2$,
$a_{mn}=a_m a_n$, and $a_{m+n}\leq c(a_m+a_n)$. Prove that $a_n=n$.
A sequence of integers $1 = x_1 < x_2 < x_3 <...$ satisfies $x_{n+1} \le 2n$ for all $n$. Show that every positive integer $k$ can be written as $x_j -x_i$ for some $i, j$.
Suppose $a_1, a_2, \ldots$ is a sequence of integers, and $d$ is some integer. For all natural numbers $n$,
\begin{align*}\text{(i)} |a_n| \text{ is prime;} && \text{(ii)} a_{n+2} = a_{n+1} + a_n + d. \end{align*}
Show that the sequence is constant.
An $n$-sum of type $1$ is a finite sequence of positive integers $a_1,a_2,\ldots,a_r$, such that:
$(1)$ $a_1+a_2+\ldots+a_r=n$;
$(2)$ $a_1>a_2+a_3,a_2>a_3+a_4,\ldots, a_{r-2}>a_{r-1}+a_r$, and $a_{r-1}>a_r$. For example, there are five $7$-sums of type $1$, namely: $7$; $6,1$; $5,2$; $4,3$; $4,2,1$. An $n$-sum of type $2$ is a finite sequence of positive integers $b_1,b_2,\ldots,b_s$ such that:
$(1)$ $b_1+b_2+\ldots+b_s=n$;
$(2)$ $b_1\ge b_2\ge\ldots\ge b_s$;
$(3)$ each $b_i$ is in the sequence $1,2,4,\ldots,g_j,\ldots$ defined by $g_1=1$, $g_2=2$, $g_j=g_{j-1}+g_{j-2}+1$; and
$(4)$ if $b_1=g_k$, then $1,2,4,\ldots,g_k$ is a subsequence. For example, there are five $7$-sums of type $2$, namely: $4,2,1$; $2,2,2,1$; $2,2,1,1,1$; $2,1,1,1,1,1$; $1,1,1,1,1,1,1$. Prove that for $n\ge1$ the number of type $1$ and type $2$ $n$-sums is the same.
Determine which integers $n > 1$ have the property that there exists an infinite sequence $a_1, a_2, a_3, \ldots$ of nonzero integers such that the equality \[a_k+2a_{2k}+\ldots+na_{nk}=0\]holds for every positive integer $k$.
Let $T_k = k - 1$ for $k = 1, 2, 3,4$ and
\[T_{2k-1} = T_{2k-2} + 2^{k-2}, T_{2k} = T_{2k-5} + 2^k \qquad (k \geq 3).\]
Show that for all $k$,
\[1 + T_{2n-1} = \left[ \frac{12}{7}2^{n-1} \right] \quad \text{and} \quad 1 + T_{2n} = \left[ \frac{17}{7}2^{n-1} \right],\]
where $[x]$ denotes the greatest integer not exceeding $x.$
[b]p1.[/b] What is $2 \cdot 24 + 20 \cdot 24 + 202 \cdot 4 + 2024$?
[b]p2.[/b] Jerry has $300$ legos. Tie can either make cars, which require $17$ legos, or bikes, which require $13$ legos. Assuming he uses all of his legos, how many ordered pairs $(a, b)$ are there such that he makes $a$ cars and $b$ bikes?
[b]p3.[/b] Patrick has $7$ unique textbooks: $2$ Geometry books, $3$ Precalculus books and $2$ Algebra II books. How many ways can he arrange his books on a bookshelf such that all the books of the same subjects are adjacent to each other?
[b]p4.[/b] After a hurricane, a $32$ meter tall flagpole at the Act on-Boxborough Regional High School snapped and fell over. Given that the snapped part remains in contact with the original pole, and the top of the polo falls $24$ meters away from the bottom of the pole, at which height did the polo snap? (Assume the flagpole is perpendicular to the ground.)
[b]p5.[/b] Jimmy is selling lemonade. Iio has $200$ cups of lemonade, and he will sell them all by the end of the day. Being the ethically dubious individual he is, Jimmy intends to dilute a few of the cups of lemonade with water to conserve resources. Jimmy sells each cup for $\$4$. It costs him $\$ 1$ to make a diluted cup of lemonade, and it costs him $\$2.75$ to make a cup of normal lemonade. What is the minimum number of diluted cups Jimmy must sell to make a profit of over $\$400$?
[b]p6.[/b] Jeffrey has a bag filled with five fair dice: one with $4$ sides, one with $6$ sides, one with $8$ sides, one with $12$ sides, and one with $20$ sides. The dice are numbered from $1$ to the number of sides on the die. Now, Marco will randomly pick a die from .Jeffrey's bag and roll it. The probability that Marco rolls a $7$ can be expressed as $\frac{a}{b}$ where $a$ and $b$ are relatively prime positive integers. Find $a+b$.
[b]p7.[/b] What is the remainder when the sum of the first $2024$ odd numbers is divided by $6072$?
[b]p8.[/b] A rhombus $ABCD$ with $\angle A = 60^o$ and $AB = 600$ cm is drawn on a piece of paper. Three ants start moving from point $A$ to the three other points on the rhombus.
One ant walks from $A$ to $B$ at a leisurely speed of $10$ cm/s. The second ant runs from $A$ to $C$ at a slightly quicker pace of $6\sqrt3$ cm/s, arriving to $C$ $x$ seconds after the first ant. The third ant travels from $A$ to $B$ to $D$ at a constant speed, arriving at $D$ $x$ seconds after the second ant.
The speed of the last ant can be written as $\frac{m}{n}$ cm/s, where $m$ and $n$ are relatively prime positive integers. Find $mn$.
[b]p9.[/b] This year, the Apple family has harvested so many apples that they cannot sell them all! Applejack decides to make $40$ glasses of apple cider to give to her friends. If Twilight and Fluttershy each want $1$ or $2$ glasses; Pinkie Pic wants cither $2$, $14$, or $15$ glasses; Rarity wants an amount of glasses that is a power of three; and Rainbow Dash wants any odd number of glasses, then how many ways can Applejack give her apple cider to her friends?
Note: $1$ is considered to be a power of $3$.
[b]p10.[/b] Let $g_x$ be a geometric sequence with first term $27$ and successive ratio $2n$ (so $g_{x+1}/g_x = 2n$). Then, define a function $f$ as $f(x) = \log_n(g_x)$, where $n$ is the base of the logarithm. It is known that the sum of the first seven terms of $f(x)$ is $42$. Find $g_2$, the second term of the geometric sequence.
Note: The logarithm base $b$ of $x$, denoted $\log_b(x)$ is equal to the value $y$ such that $b^y = x$. In other words, if $\log_b(x) = y$, then $b^y = x$.
[b]p11.[/b] Let $\varepsilon$ be an ellipse centered around the origin, such that its minor axis is perpendicular to the $x$-axis. The length of the ellipse's major and minor axes is $8$ and $6$, respectively. Then, let $ABCD$ be a rectangle centered around the origin, such that $AB$ is parallel to the $x$-axis. The lengths of $AB$ and $BC$ are $8$ and $3\sqrt2$, respectively. The area outside the ellipse but inside the rectangle can be expressed as $a\sqrt{b}-c-d\pi$, for positive integers $a$, $b$, $c$, $d$ where $b$ is not divisible by a perfect square of any prime. Find $a + b + c + d$.
[img]https://cdn.artofproblemsolving.com/attachments/e/c/9d943966763ee7830d037ef98c21139cf6f529.png[/img]
[b]p12.[/b] Let $N = 2^7 \cdot 3^7 \cdot 5^5$. Find the number of ways to express $N$ as the product of squares and cubes, all of which are integers greater than $1$.
[b]p13.[/b] Jerry and Eric are playing a $10$-card game where Jerry is deemed the ’’landlord" and Eric is deemed the ' peasant'’. To deal the cards, the landlord keeps one card to himself. Then, the rest of the $9$ cards are dealt out, such that each card has a $1/2$ chance to go to each player. Once all $10$ cards are dealt out, the landlord compares the number of cards he owns with his peasant. The probability that the landlord wins is the fraction of cards he has. (For example, if Jerry has $5$ cards and Eric has $2$ cards, Jerry has a$ 5/7$ ths chance of winning.) The probability that Jerry wins the game can be written as $\frac{p}{q}$ where $p$ and $q$ are relatively prime. Find $p + q$.
[b]p14.[/b] Define $P(x) = 20x^4 + 24x^3 + 10x^2 + 21x+ 7$ to have roots $a$, $b$, $c$, and $d$. If $Q(x)$ has roots $\frac{1}{a-2}$,$\frac{1}{b-2}$,$ \frac{1}{c-2}$, $\frac{1}{d-2}$ and integer coefficients with a greatest common divisor of $1$, then find $Q(2)$.
[b]p15.[/b] Let $\vartriangle ABC$ be a triangle with side lengths $AB = 14$, $BC = 13$, and $AC = 15$. The incircle of $\vartriangle ABC$ is drawn with center $I$, tangent to $\overline{AB}$ at $X$. The line $\overleftrightarrow{IX}$ intersects the incircle again at $Y$ and intersects $\overline{AC}$ at $Z$. The area of $\vartriangle AYZ$ can be expressed as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Find all terms of the arithmetic progression $-1, 18, 37, 56, ...$ whose only digit is $5$.
We say that a real $a\geq-1$ is philosophical if there exists a sequence $\epsilon_1,\epsilon_2,\dots$, with $\epsilon_i \in\{-1,1\}$ for all $i\geq1$, such that the sequence $a_1,a_2,a_3,\dots$, with $a_1=a$, satisfies
$$a_{n+1}=\epsilon_{n}\sqrt{a_{n}+1},\forall n\geq1$$
and is periodic. Find all philosophical numbers.
Pete puts 100 stones in a row: black one, white one, black one, white one, ..., black one, white one. In a single move either Pete chooses two black stones with only white stones between them, and repaints all these white stones in black, or Pete chooses two white stones with only black stones between them, and repaints all these black stones in white. Can Pete with a sequence of moves described above obtain a row of 50 black stones followed by 50 white stones?
Egor Bakaev
Is there an infinite sequence of positive real numbers $x_1,x_2,...,x_n$ satisfying for all $n\ge 1$ the relation $x_{n+2}= \sqrt{x_{n+1}}-\sqrt{x_n}$?