Found problems: 766
Determine if there are positive integers $a, b$ such that all terms of the sequence defined by
\[ x_{1}= 2010,x_{2}= 2011\\ x_{n+2}= x_{n}+ x_{n+1}+a\sqrt{x_{n}x_{n+1}+b}\quad (n\ge 1) \] are integers.
A permutation $\sigma: \{1,2,\ldots,n\}\to\{1,2,\ldots,n\}$ is called [i]straight[/i] if and only if for each integer $k$, $1\leq k\leq n-1$ the following inequality is fulfilled
\[ |\sigma(k)-\sigma(k+1)|\leq 2. \]
Find the smallest positive integer $n$ for which there exist at least 2003 straight permutations.
[i]Valentin Vornicu[/i]
Let $x_{1}$ be a positive real number and for every integer $n \geq 1$ let $x_{n+1} = 1 + x_{1}x_{2}\ldots x_{n-1}x_{n}$.
If $x_{5} = 43$, what is the sum of digits of the largest prime factors of $x_{6}$?
The people in an infinitely long line are numbered $1,2,3,\dots$. Then, each person says either ``Karl" or ``Lark" independently and at random. Let $S$ be the set of all positive integers $i$ such that people $i$, $i+1$, and $i+2$ all say ``Karl," and define $X = \sum_{i \in S} 2^{-i}$. Then the expected value of $X^2$ is $\frac{m}{n}$, where $m$ and $n$ are positive integers with $\gcd(m,n)=1$. Compute $100m+n$.
[i]Proposed by Ankit Bisain[/i]
Let $ c$ be a positive integer. The sequence $ a_1,a_2,\ldots$ is defined as follows $ a_1\equal{}c$, $ a_{n\plus{}1}\equal{}a_n^2\plus{}a_n\plus{}c^3$ for all positive integers $ n$. Find all $ c$ so that there are integers $ k\ge1$ and $ m\ge2$ so that $ a_k^2\plus{}c^3$ is the $ m$th power of some integer.
Let $A$ and $E$ be opposite vertices of an octagon. A frog starts at vertex $A.$ From any vertex except $E$ it jumps to one of the two adjacent vertices. When it reaches $E$ it stops. Let $a_n$ be the number of distinct paths of exactly $n$ jumps ending at $E$. Prove that: \[ a_{2n-1}=0, \quad a_{2n}={(2+\sqrt2)^{n-1} - (2-\sqrt2)^{n-1} \over\sqrt2}. \]
Let $ n \geq 2$ be a positive integer and $ \lambda$ a positive real number. Initially there are $ n$ fleas on a horizontal line, not all at the same point. We define a move as choosing two fleas at some points $ A$ and $ B$, with $ A$ to the left of $ B$, and letting the flea from $ A$ jump over the flea from $ B$ to the point $ C$ so that $ \frac {BC}{AB} \equal{} \lambda$.
Determine all values of $ \lambda$ such that, for any point $ M$ on the line and for any initial position of the $ n$ fleas, there exists a sequence of moves that will take them all to the position right of $ M$.
The polynomials $P_n(x,y), n=1,2,... $ are defined by \[P_1(x,y)=1, P_{n+1}(x,y)=(x+y-1)(y+1)P_n(x,y+2)+(y-y^2)P_n(x,y)\] Prove that $P_{n}(x,y)=P_{n}(y,x)$ for all $x,y \in \mathbb{R}$ and $n $.
An infinite sequence of positive real numbers is defined by $a_0=1$ and $a_{n+2}=6a_n-a_{n+1}$ for $n=0,1,2,\cdots$. Find the possible value(s) of $a_{2007}$.
Define the function $f:(0,1)\to (0,1)$ by \[\displaystyle f(x) = \left\{ \begin{array}{lr} x+\frac 12 & \text{if}\ \ x < \frac 12\\ x^2 & \text{if}\ \ x \ge \frac 12 \end{array} \right.\] Let $a$ and $b$ be two real numbers such that $0 < a < b < 1$. We define the sequences $a_n$ and $b_n$ by $a_0 = a, b_0 = b$, and $a_n = f( a_{n -1})$, $b_n = f (b_{n -1} )$ for $n > 0$. Show that there exists a positive integer $n$ such that \[(a_n - a_{n-1})(b_n-b_{n-1})<0.\]
[i]Proposed by Denmark[/i]
Does there exist a row of Pascal’s Triangle containing four distinct values $a,b,c$ and $d$ such that $b = 2a$ and $d = 2c$?
Recall that Pascal’s triangle is the pattern of numbers that begins as follows
[img]https://cdn.artofproblemsolving.com/attachments/2/1/050e56f0f1f1b2a9c78481f03acd65de50c45b.png[/img]
where the elements of each row are the sums of pairs of adjacent elements of the prior row. For example, $10 =4+6$.
Also note that the last row displayed above contains the four elements $a = 5,b = 10,d = 10,c = 5$, satisfying $b = 2a$ and $d = 2c$, but these four values are NOT distinct.
Consider the succession of integers $\{f(n)\}_{n=1}^{\infty}$ defined as:
$\bullet$ $f(1) = 1$.
$\bullet$ $f(n) = f(n/2)$ if $n$ is even.
$\bullet$ If $n > 1$ odd and $f(n-1)$ odd, then $f(n) = f(n-1)-1$.
$\bullet$ If $n > 1$ odd and $f(n-1)$ even, then $f(n) = f(n-1)+1$.
a) Compute $f(2^{2020}-1)$.
b) Prove that $\{f(n)\}_{n=1}^{\infty}$ is not periodical, that is, there do not exist positive integers $t$ and $n_0$ such that $f(n+t) = f(n)$ for all $n \geq n_0$.
A group of people is lined up in [i]almost-order[/i] if, whenever person $A$ is to the left of person $B$ in the line, $A$ is not more than $8$ centimeters taller than $B$. For example, five people with heights $160, 165, 170, 175$, and $180$ centimeters could line up in almost-order with heights (from left-to-right) of $160, 170, 165, 180, 175$ centimeters.
(a) How many different ways are there to line up $10$ people in [i]almost-order[/i] if their heights are $140, 145, 150, 155,$ $160,$ $165,$ $170,$ $175,$ $180$, and $185$ centimeters?
The sequence $(a_n)$ is defined with the recursion $a_{n + 1} = 5a^6_n + 3a^3_{n-1} + a^2_{n-2}$ for $n\ge 2$ and the set of initial values $\{a_0, a_1, a_2\} = \{2013, 2014, 2015\}$. (That is, the initial values are these three numbers in any order.)
Show that the sequence contains no sixth power of a natural number.
The infinite sequence $a_0, a_1, a_2, a_3,... $ is defined by $a_0 = 2$ and
$$a_n =\frac{2a_{n-1} + 1}{a_{n-1} + 2}$$ , $n = 1, 2, 3, ...$ Prove that $1 < a_n < 1 + \frac{1}{3^n}$ for all $n = 1, 2, 3, . .$
An integer sequence satisfies $a_{n+1}={a_n}^3 +1999$. Show that it contains at most one square.
Define binary operations $\diamondsuit$ and $\heartsuit$ by $$a \, \diamondsuit \, b = a^{\log_{7}(b)} \qquad \text{and} \qquad a \, \heartsuit \, b = a^{\frac{1}{\log_{7}(b)}}$$
for all real numbers $a$ and $b$ for which these expressions are defined. The sequence $(a_n)$ is defined recursively by $a_3 = 3\, \heartsuit\, 2$ and $$a_n = (n\, \heartsuit\, (n-1)) \,\diamondsuit\, a_{n-1}$$
for all integers $n \geq 4$. To the nearest integer, what is $\log_{7}(a_{2019})$?
$\textbf{(A) } 8 \qquad \textbf{(B) } 9 \qquad \textbf{(C) } 10 \qquad \textbf{(D) } 11 \qquad \textbf{(E) } 12$
Find all functions $f \colon \mathbb{R_{+}}\to \mathbb{R_{+}}$ satisfying : \[f ( f (x)-x) = 2x\] for all $x > 0$.
Find all functions $f : \mathbb{Z} \to \mathbb{Z}$ such that:
- $f$ is strictly increasing,
- there exists $M \in \mathbb{N}$ such that $f(x+1) - f(x) < M$ for all $x \in \mathbb{N}$,
- for every $x \in \mathbb{Z}$, there exists $y \in \mathbb{Z}$ such that
\[
f(y) = \frac{f(x) + f(x + 2024)}{2}.
\]
[i]Proposed by Pavle Martinović[/i]
The sequences $(a_n)$ and (c_n) are given by $a_0 =\frac12$, $c_0=4$ , and for $n \ge 0$ , $a_{n+1}=\frac{2a_n}{1+a_n^2}$, $c_{n+1}=c_n^2-2c_n+2$
Prove that for all $n\ge 1$, $a_n=\frac{2c_0c_1...c_{n-1}}{c_n}$
Find the greatest natural number $n$ such there exist natural numbers $x_{1}, x_{2}, \ldots, x_{n}$ and natural $a_{1}< a_{2}< \ldots < a_{n-1}$ satisfying the following equations for $i =1,2,\ldots,n-1$: \[x_{1}x_{2}\ldots x_{n}= 1980 \quad \text{and}\quad x_{i}+\frac{1980}{x_{i}}= a_{i}.\]
Let $f : N\to N$ such that $$f(1) = 0\,\, , \,\,f(3n) = 2f(n) + 2\,\, , \,\,f(3n-1) = 2f(n) + 1\,\, , \,\,f(3n-2) = 2f(n).$$ Determine the smallest value of $n$ so that $f (n) = 2014.$
[b]p1.[/b] What is $\sqrt[2015]{2^01^5}$?
[b]p2.[/b] What is the ratio of the area of square $ABCD$ to the area of square $ACEF$?
[b]p3.[/b] $2015$ in binary is $11111011111$, which is a palindrome. What is the last year which also had this property?
[b]p4.[/b] What is the next number in the following geometric series: $1020100$, $10303010$, $104060401$?
[b]p5.[/b] A circle has radius $A$ and area $r$. If $A = r^2\pi$, then what is the diameter, $C$, of the circle?
[b]p6.[/b] If
$$O + N + E = 1$$
$$T + H + R + E + E = 3$$
$$N + I + N + E = 9$$
$$T + E + N = 10$$
$$T + H + I + R + T + E + E + N = 13$$
Then what is the value of $O$?
[b]p7.[/b] By shifting the initial digit, which is $6$, of the positive integer $N$ to the end (for example, $65$ becomes $56$), we obtain a number equal to $\frac{N}{4}$ . What is the smallest such $N$?
[b]p8.[/b] What is $\sqrt[3]{\frac{2015!(2013!)+2014!(2012!)}{2013!(2012!)}}$ ?
[b]p9.[/b] How many permutations of the digits of $1234$ are divisible by $11$?
[b]p10.[/b] If you choose $4$ cards from a normal $52$ card deck (with replacement), what is the probability that you will get exactly one of each suit (there are $4$ suits)?
[b]p11.[/b] If $LMT$ is an equilateral triangle, and $MATH$ is a square, such that point $A$ is in the triangle, then what is $HL/AL$?
[b]p12.[/b] If
$$\begin{tabular}{cccccccc}
& & & & & L & H & S\\
+ & & & & H & I & G & H \\
+ & & S & C & H & O & O & L \\
\hline
= & & S & O & C & O & O & L \\
\end{tabular}$$ and $\{M, A, T,H, S, L,O, G, I,C\} = \{0, 1, 2, 3,4, 5, 6, 7, 8, 9\} $, then what is the ordered pair $(M + A +T + H, [T + e + A +M])$ where $e$ is $2.718...$and $[n]$ is the greatest integer less than or equal to $n$ ?
[b]p13.[/b] There are $5$ marbles in a bag. One is red, one is blue, one is green, one is yellow, and the last is white. There are $4$ people who take turns reaching into the bag and drawing out a marble without replacement. If the marble they draw out is green, they get to draw another marble out of the bag. What is the probability that the $3$rd person to draw a marble gets the white marble?
[b]p14.[/b] Let a "palindromic product" be a product of numbers which is written the same when written back to front, including the multiplication signs. For example, $234 * 545 * 432$, $2 * 2 *2 *2$, and $14 * 41$ are palindromic products whereas $2 *14 * 4 * 12$, $567 * 567$, and $2* 2 * 3* 3 *2$ are not. 2015 can be written as a "palindromic product" in two ways, namely $13 * 5 * 31$ and $31 * 5 * 13$. How many ways can you write $2016$ as a palindromic product without using 1 as a factor?
[b]p15.[/b] Let a sequence be defined as $S_n = S_{n-1} + 2S_{n-2}$, and $S_1 = 3$ and $S_2 = 4$. What is $\sum_{n=1}^{\infty}\frac{S_n}{3^n}$ ?
[b]p16.[/b] Put the numbers $0-9$ in some order so that every $2$-digit substring creates a number which is either a multiple of $7$, or a power of $2$.
[b]p17.[/b] Evaluate
$\dfrac{8+ \dfrac{8+ \dfrac{8+...}{3+...}}{3+ \dfrac{8+...}{3+...}}}{3+\dfrac{8+ \dfrac{8+...}{3+...}}{
3+ \dfrac{8+...}{3+...}}}$, assuming that it is a positive real number.
[b]p18.[/b] $4$ non-overlapping triangles, each of area $A$, are placed in a unit circle. What is the maximum value of $A$?
[b]p19.[/b] What is the sum of the reciprocals of all the (positive integer) factors of $120$ (including $1$ and $120$ itself).
[b]p20.[/b] How many ways can you choose $3$ distinct elements of $\{1, 2, 3,...,4000\}$ to make an increasing arithmetic series?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Given is an integer sequence $\{a_n\}_{n \ge 0}$ such that $a_{0}=2$, $a_{1}=3$ and, for all positive integers $n \ge 1$, $a_{n+1}=2a_{n-1}$ or $a_{n+1}= 3a_{n} - 2a_{n-1}$. Does there exist a positive integer $k$ such that $1600 < a_{k} < 2000$?
Consider a sequence of polynomials $P_0(x), P_1(x), P_2(x), \ldots, P_n(x), \ldots$, where $P_0(x) = 2, P_1(x) = x$ and for every $n \geq 1$ the following equality holds:
\[P_{n+1}(x) + P_{n-1}(x) = xP_n(x).\]
Prove that there exist three real numbers $a, b, c$ such that for all $n \geq 1,$
\[(x^2 - 4)[P_n^2(x) - 4] = [aP_{n+1}(x) + bP_n(x) + cP_{n-1}(x)]^2.\]