Found problems: 5923
A sequence $\{a_n\}$ , $a_1=1,a_2=2,a_{n+1}=\dfrac{a_n^2+(-1)^n}{a_{n-1}}$. Show that $a_m^2+a_{m+1}^2\in\{a_n\},\forall m\in\Bbb N$
Let ${u_n}$ be the Fibonacci sequence, i.e., $u_0=0,u_1=1,u_n=u_{n-1}+u_{n-2}$ for $n>1$. Prove that there exist infinitely many prime numbers $p$ that divide $u_{p-1}$.
For which maximal $N$ there exists an $N$-digit number with the following property: among any sequence of its consecutive decimal digits some digit is present once only?
Alexey Glebov
Two sequences of nonzero reals $a_1, a_2, a_3, \dots$ and $b_2, b_3, \dots$ are such that $b_n=\prod_{i=1}^{n} a_i$ and $a_n=\frac{b_n^2}{3b_n-3}$ for all integers $n > 1$. Given that $a_1=\frac{1}{2}$, find $\lvert b_{60}\rvert$.
[i]Proposed by Andrew Zhao[/i]
Given a positive integer $n$, an allowed move is to form $2n+1$ or $3n+2$. The set $S_{n}$ is the set of all numbers that can be obtained by a sequence of allowed moves starting with $n$. For example, we can form $5 \rightarrow 11 \rightarrow 35$ so $5, 11$ and $35$ belong to $S_{5}$. We call $m$ and $n$ compatible if $S_{m}$ and $S_{n}$ has a common element. Which members of $\{1, 2, 3, ... , 2002\}$ are compatible with $2003$?
Numbers from $1$ to $100$ are written on the board. Is it possible to cross $10$ numbers in such way, that we couldn't select 10 numbers from rest which would form arithmetic progression?
A sequence of integers $a_0, a_1 …$ is called [i]kawaii[/i] if $a_0 =0, a_1=1,$ and $$(a_{n+2}-3a_{n+1}+2a_n)(a_{n+2}-4a_{n+1}+3a_n)=0$$ for all integers $n \geq 0$. An integer is called [i]kawaii[/i] if it belongs to some kawaii sequence.
Suppose that two consecutive integers $m$ and $m+1$ are both kawaii (not necessarily belonging to the same kawaii sequence). Prove that $m$ is divisible by $3,$ and that $m/3$ is also kawaii.
The vertices of a regular $2005$-gon are colored red, white and blue. Whenever two vertices of different colors stand next to each other, we are allowed to recolor them into the third color.
(a) Prove that there exists a finite sequence of allowed recolorings after which all the vertices are of the same color.
(b) Is that color uniquely determined by the initial coloring?
We call a sequence of integers a [i]Fibonacci-type sequence[/i] if it is infinite in both ways and $a_{n}=a_{n-1}+a_{n-2}$ for any $n\in\mathbb{Z}$. How many [i]Fibonacci-type sequences[/i] can we find, with the property that in these sequences there are two consecutive terms, strictly positive, and less or equal than $N$ ? (two sequences are considered to be the same if they differ only by shifting of indices)
[i]Proposed by I. Pevzner[/i]
Find all three digit natural numbers of the form $(abc)_{10}$ such that $(abc)_{10}$, $(bca)_{10}$ and $(cab)_{10}$ are in geometric progression. (Here $(abc)_{10}$ is representation in base $10$.)
Keith decides that a sequence of digits is [i]slick[/i] if every pair of adjacent digits in the sequence is divisible by either $23$ or $17.$ What is the greatest possible number of $2$s in a $2021$-digit long slick sequence?
[b]6.[/b] Let $\{ n_k \}_{k=1}^{\infty}$ be a stricly increasing sequence of positive integers such that
$\lim_{k \to \infty} n_k^{\frac {1}{2^k}}= \infty$
Show that the sum of the series $\sum_{k=1}^{\infty} \frac {1}{n_k} $ is an irrational number. [b](N. 19)[/b]
Rakesh is flipping a fair coin repeatedly. If $T$ denotes the event where the coin lands on tails and $H$ denotes the event where the coin lands on heads, what is the probability Rakesh flips the sequence $HHH$ before the sequence $THH$?
A positive integer $K$ is given. Define the sequence $(a_n)$ by $a_1 = 1$ and $a_n$ is the $n$-th positive integer greater than $a_{n-1}$ which is congruent to $n$ modulo $K$.
[b](a)[/b] Find an explicit formula for $a_n$.
[b](b)[/b] What is the result if $K = 2$?
In the following, a [i]word[/i] will mean a finite sequence of letters "$a$" and "$b$". The [i]length[/i] of a word will mean the number of the letters of the word. For instance, $abaab$ is a word of length $5$. There exists exactly one word of length $0$, namely the empty word.
A word $w$ of length $\ell$ consisting of the letters $x_1$, $x_2$, ..., $x_{\ell}$ in this order is called a [i]palindrome[/i] if and only if $x_j=x_{\ell+1-j}$ holds for every $j$ such that $1\leq j\leq\ell$. For instance, $baaab$ is a palindrome; so is the empty word.
For two words $w_1$ and $w_2$, let $w_1w_2$ denote the word formed by writing the word $w_2$ directly after the word $w_1$. For instance, if $w_1=baa$ and $w_2=bb$, then $w_1w_2=baabb$.
Let $r$, $s$, $t$ be nonnegative integers satisfying $r + s = t + 2$. Prove that there exist palindromes $A$, $B$, $C$ with lengths $r$, $s$, $t$, respectively, such that $AB=Cab$, if and only if the integers $r + 2$ and $s - 2$ are coprime.
[u]Round 5[/u]
[b]5.1.[/b] Julia baked a pie for herself to celebrate pi day this year. If Julia bakes anyone pie on pi day, the following year on pi day she bakes a pie for herself with $1/3$ probability, she bakes her friend a pie with $1/6$ probability, and she doesn't bake anyone a pie with $1/2$ probability. However, if Julia doesn't make pie on pi day, the following year on pi day she bakes a pie for herself with $1/2$ probability, she bakes her friend a pie with $1/3$ probability, and she doesn't bake anyone a pie with $1/6$ probability. The probability that Julia bakes at least $2$ pies on pi day in the next $5$ years can be expressed as $p/q$, for relatively prime positive integers $p$ and $q$. Compute $p + q$.
[b]5.2.[/b] Steven is flipping a coin but doesn't want to appear too lucky. If he ips the coin $8$ times, the probability he only gets sequences of consecutive heads or consecutive tails that are of length $4$ or less can be expressed as $p/q$, for relatively prime positive integers $p$ and $q$. Compute $p + q$.
[b]5.3.[/b] Let $ABCD$ be a square with side length $3$. Further, let $E$ be a point on side$ AD$, such that $AE = 2$ and $DE = 1$, and let $F$ be the point on side $AB$ such that triangle $CEF$ is right with hypotenuse $CF$. The value $CF^2$ can be expressed as $m/n$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.
[u]Round 6[/u]
[b]6.1.[/b] Let $P$ be a point outside circle $\omega$ with center $O$. Let $A,B$ be points on circle $\omega$ such that $PB$ is a tangent to $\omega$ and $PA = AB$. Let $M$ be the midpoint of $AB$. Given $OM = 1$, $PB = 3$, the value of $AB^2$ can be expressed as $m/n$ for relatively prime positive integers $m, n$. Find $m + n$.
[b]6.2.[/b] Let $a_0, a_1, a_2,...$with each term defined as $a_n = 3a_{n-1} + 5a_{n-2}$ and $a_0 = 0$, $a_1 = 1$. Find the remainder when $a_{2020}$ is divided by $360$.
[b]6.3.[/b] James and Charles each randomly pick two points on distinct sides of a square, and they each connect their chosen pair of points with a line segment. The probability that the two line segments intersect can be expressed as $m/n$ for relatively prime positive integers $m, n$. Find $m + n$.
[u]Round 7[/u]
[b]7.1.[/b] For some positive integers $x, y$ let $g = gcd (x, y)$ and $\ell = lcm (2x, y)$: Given that the equation $xy+3g+7\ell = 168$ holds, find the largest possible value of $2x + y$.
[b]7.2.[/b] Marco writes the polynomials $$f(x) = nx^4 +2x^3 +3x^2 +4x+5$$ and $$g(x) = a(x-1)^4 +b(x-1)^3 +6(x-1)^2 + d(x - 1) + e,$$ where $n, a, b, d, e$ are real numbers. He notices that $g(i) = f(i) - |i|$ for each integer $i$ satisfying $-5 \le i \le -1$. Then $n^2$ can be expressed as $p/q$ for relatively prime positive integers $p, q$. Find $p + q$.
[b]7.3. [/b]Equilateral $\vartriangle ABC$ is inscribed in a circle with center $O$. Points $D$ and $E$ are chosen on minor arcs $AB$ and $BC$, respectively. Segment $\overline{CD}$ intersects $\overline{AB}$ and $\overline{AE}$ at $Y$ and $X$, respectively. Given that $\vartriangle DXE$ and $\vartriangle AXC$ have equal area, $\vartriangle AXY$ has area $ 1$, and $\vartriangle ABC$ has area $52$, find the area of $\vartriangle BXC$.
[u]Round 8[/u]
[b]8.[/b] Let $A$ be the number of total webpage visits our website received last month. Let $B$ be the number photos in our photo collection from ABMC onsite 2017. Let $M$ be the mean speed round score. Further, let $C$ be the number of times the letter c appears in our problem bank. Estimate
$$A \cdot B + M \cdot C.$$Your answer will be scored according to the following formula, where $X$ is the correct answer and $I$ is your input.
$$max \left\{ 0, \left\lceil min \left\{13 - \frac{|I-X|}{0.05 |I|}, 13 - \frac{|I-X|}{0.05 |I-2X|} \right\} \right\rceil \right\}$$
PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2766251p24226451]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Consider a cube and two of its vertices $A$ and $B$, which are the endpoints of a face diagonal. A [i]path [/i] is a sequence of cube angles, each step of one angle along a cube edge is walked to one of the three adjacent angles. Let $a$ be the number of paths of length $2012$ that starts at point $A$ and ends at $A$ and let b be the number of ways of length $2012$ that starts in $A$ and ends in $B$. Decide which of the two numbers $a$ and $b$ is the larger.
In a non equilateral triangle $ABC$ the sides $a,b,c$ form an arithmetic progression. Let $I$ be the incentre and $O$ the circumcentre of the triangle $ABC$. Prove that
(1) $IO$ is perpendicular to $BI$;
(2) If $BI$ meets $AC$ in $K$, and $D$, $E$ are the midpoints of $BC$, $BA$ respectively then $I$ is the circumcentre of triangle $DKE$.
The domain of a function $f$ is $\mathbb{N}$ (The set of natural numbers). The function is defined as follows : $$f(n)=n+\lfloor\sqrt{n}\rfloor$$ where $\lfloor k\rfloor$ denotes the nearest integer smaller than or equal to $k$. Prove that, for every natural number $m$, the following sequence contains at least one perfect square $$m,~f(m),~f^2(m),~f^3(m),\cdots$$ The notation $f^k$ denotes the function obtained by composing $f$ with itself $k$ times.
Given a real number $\alpha$ in whose decimal representation $\alpha=0,a_1a_2a_3\dots$ each decimal digit $a_i$ $(i=1,2,3,\dots)$ is a prime number. The decimal digits are arranged along the path indicated by arrows in the accompanying figure, which can be thought of as continuing infinitely to the right and downward. For each $m\geq 1$, the decimal representation of a real number $z_m$ is formed by writing before the decimal point the digit 0 and after the decimal point the sequence of digits of the $m$-th row from the top read from left to right from the adjacent arrangement. In an analogous way, for all $n\geq 1$, the real numbers $s_n$ are formed with the digits of the $n$-th column from the left to be read from top to bottom. For example, $z_3=0,a_5a_6a_7a_{12}a_{23}a_{28}\dots$ and $s_2=0,a_2a_3a_6a_{15}a_{18}a_{35}\dots$.
Show:
(a) If $\alpha$ is rational, then all $z_m$ and all $s_n$ are rational.
(b) The converse of the statement formulated in (a) is false.
Find all triples of natural numbers $(a,b,c)$ such that $a$, $b$ and $c$ are in geometric progression and $a + b + c = 111$.
[u]Part 1[/u]
You might think this round is broken after solving some of these problems, but everything is intentional.
[b]1.1.[/b] The number $n$ can be represented uniquely as the sum of $6$ distinct positive integers. Find $n$.
[b]1.2.[/b] Let $ABC$ be a triangle with $AB = BC$. The altitude from $A$ intersects line $BC$ at $D$. Suppose $BD = 5$ and $AC^2 = 1188$. Find $AB$.
[b]1.3.[/b] A lemonade stand analyzes its earning and operations. For the previous month it had a \$45 dollar budget to divide between production and advertising. If it spent $k$ dollars on production, it could make $2k - 12$ glasses of lemonade. If it spent $k$ dollars on advertising, it could sell each glass at an average price of $15 + 5k$ cents. The amount it made in sales for the previous month was $\$40.50$. Assuming the stand spent its entire budget on production and advertising, what was the absolute di erence between the amount spent on production and the amount spent on advertising?
[b]1.4.[/b] Let $A$ be the number of di erent ways to tile a $1 \times n$ rectangle with tiles of size $1 \times 1$, $1 \times 3$, and $1 \times 6$. Let B be the number of different ways to tile a $1 \times n$ rectangle with tiles of size $1 \times 2$ and $1 \times 5$, where there are 2 different colors available for the $1 \times 2$ tiles. Given that $A = B$, find $n$. (Two tilings that are rotations or reflections of each other are considered distinct.)
[b]1.5.[/b] An integer $n \ge 0$ is such that $n$ when represented in base $2$ is written the same way as $2n$ is in base $5$. Find $n$.
[b]1.6.[/b] Let $x$ be a positive integer such that $3$, $ \log_6(12x)$, $\log_6(18x)$ form an arithmetic progression in some order. Find $x$.
[u]Part 2[/u]
Oops, it looks like there were some [i]intentional [/i] printing errors and some of the numbers from these problems got removed. Any $\blacksquare$ that you see was originally some positive integer, but now its value is no longer readable. Still, if things behave like they did for Part 1, maybe you can piece the answers together.
[b]2.1.[/b] The number $n$ can be represented uniquely as the sum of $\blacksquare$ distinct positive integers. Find $n$.
[b]2.2.[/b] Let $ABC$ be a triangle with $AB = BC$. The altitude from $A$ intersects line $BC$ at $D$. Suppose $BD = \blacksquare$ and $AC^2 = 1536$. Find $AB$.
[b]2.3.[/b] A lemonade stand analyzes its earning and operations. For the previous month it had a $\$50$ dollar budget to divide between production and advertising. If it spent k dollars on production, it could make $2k - 2$ glasses of lemonade. If it spent $k$ dollars on advertising, it could sell each glass at an average price of $25 + 5k$ cents. The amount it made in sales for the previous month was $\$\blacksquare$. Assuming the stand spent its entire budget on production and advertising, what was the absolute di erence between the amount spent on production and the amount spent on advertising?
[b]2.4.[/b] Let $A$ be the number of different ways to tile a $1 \times n$ rectangle with tiles of size $1 \times \blacksquare$, $1 \times \blacksquare$, and $1 \times \blacksquare$. Let $B$ be the number of different ways to tile a $1\times n$ rectangle with tiles of size $1 \times \blacksquare$ and $1 \times \blacksquare$, where there are $\blacksquare$ different colors available for the $1 \times \blacksquare$ tiles. Given that $A = B$, find $n$. (Two tilings that are rotations or reflections of each other are considered distinct.)
[b]2.5.[/b] An integer $n \ge \blacksquare$ is such that $n$ when represented in base $9$ is written the same way as $2n$ is in base $\blacksquare$. Find $n$.
[b]2.6.[/b] Let $x$ be a positive integer such that $1$, $\log_{96}(6x)$, $\log_{96}(\blacksquare x)$ form an arithmetic progression in some order. Find $x$.
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
For $ p\equal{}1,2,\ldots,10$ let $ S_p$ be the sum of the first $ 40$ terms of the arithmetic progression whose first term is $ p$ and whose common difference is $ 2p\minus{}1$; then $ S_1\plus{}S_2\plus{}\cdots\plus{}S_{10}$ is
$ \textbf{(A)}\ 80000
\qquad \textbf{(B)}\ 80200
\qquad \textbf{(C)}\ 80400
\qquad \textbf{(D)}\ 80600
\qquad \textbf{(E)}\ 80800$
Each member of the sequence $112002, 11210, 1121, 117, 46, 34,\ldots$ is obtained by adding five times the rightmost digit to the number formed by omitting that digit. Determine the billionth ($10^9$th) member of this sequence.
Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.