Found problems: 766
Let the sequence an be defined by $a_0 = 2, a_1 = 15$, and $a_{n+2 }= 15a_{n+1} + 16a_n$ for $n \ge 0$.
Show that there are infinitely many integers $k$ such that $269 | a_k$.
Let $a_n$ be a sequence of natural numbers defined by $a_1 = m$ and for $n > 1$. We call apair$ (a_k, a_{\ell })$ [i]interesting [/i] if
(i) $0 < \ell - k < 2016$,
(ii) $a_k$ divides $a_{\ell }$.
Show that there exists a $m$ such that the sequence $a_n$ contains no interesting pair.
Sequence $\{a_n\}$ defined by recurrence relation $a_{n+1} = 1+\frac{n^2}{a_n}$. Given $a_1>1$, find the value of $\lim\limits_{n\to\infty} \frac{a_n}{n}$ with proof.
Determine all sequences $(x_1,x_2,\ldots,x_{2011})$ of positive integers, such that for every positive integer $n$ there exists an integer $a$ with \[\sum^{2011}_{j=1} j x^n_j = a^{n+1} + 1\]
[i]Proposed by Warut Suksompong, Thailand[/i]
Let $n$ be a positive integer. Show that there exist a polynomial $P(x)$ with integer coefficient that satisfy the following
[list]
[*]Degree of $P(x)$ is at most $2^n - n -1$
[*]$|P(k)| = (k-1)!(2^n-k)!$ for each $k \in \{1,2,3,\dots,2^n\}$
[/list]
You are given a rectangular playing field of size $13 \times 2$ and any number of dominoes of sizes $2\times 1$ and $3\times 1$. The playing field should be seamless with such dominoes and without overlapping, with no domino protruding beyond the playing field may. Furthermore, all dominoes must be aligned in the same way, i. e. their long sides must be parallel to each other. How many such coverings are possible?
(Walther Janous)
Define a sequence of integers $a_0=m, a_1=n$ and $a_{k+1}=4a_k-5a_{k-1}$ for all $k \ge 1$. Suppose $p>5$ is a prime with $p \equiv 1 \pmod{4}$. Prove that it is possible to choose $m,n$ such that $p \nmid a_k$ for any $k \ge 0$.
Suppose that the set $M=\{1,2,\cdots,n\}$ is split into $t$ disjoint subsets $M_{1}$, $\cdots$, $M_{t}$ where the cardinality of $M_i$ is $m_{i}$, and $m_{i} \ge m_{i+1}$, for $i=1,\cdots,t-1$. Show that if $n>t!\cdot e$ then at least one class $M_z$ contains three elements $x_{i}$, $x_{j}$, $x_{k}$ with the property that $x_{i}-x_{j}=x_{k}$.
Let $a_0,a_1,a_2,\ldots$ be a sequence of integers and $b_0,b_1,b_2,\ldots$ be a sequence of [i]positive[/i] integers such that $a_0=0,a_1=1$, and
\[
a_{n+1} =
\begin{cases}
a_nb_n+a_{n-1} & \text{if $b_{n-1}=1$} \\
a_nb_n-a_{n-1} & \text{if $b_{n-1}>1$}
\end{cases}\qquad\text{for }n=1,2,\ldots.
\]
for $n=1,2,\ldots.$ Prove that at least one of the two numbers $a_{2017}$ and $a_{2018}$ must be greater than or equal to $2017$.
The sequence $<a_n>$ is defined as follows, $a_1=a_2=1$, $a_3=2$,
$$a_{n+3}=\frac{a_{n+2}a_{n+1}+n!}{a_n},$$
$n \ge 1$.
Prove that all the terms in the sequence are integers.
Consider the positive integers written in the decimal system with $n$ digits, the start of which is not zero and where there are no two sevens next to each other. The number of these numbers is called $u_n$. Derive a relation that expresses $u_{n+2}$ in terms of $u_{n+1}$ and $u_n$.
Let $P=A_1A_2\cdots A_k$ be a convex polygon in the plane. The vertices $A_1, A_2, \ldots, A_k$ have integral coordinates and lie on a circle. Let $S$ be the area of $P$. An odd positive integer $n$ is given such that the squares of the side lengths of $P$ are integers divisible by $n$. Prove that $2S$ is an integer divisible by $n$.
Let $(a_n)_{n=0}^{\infty}$ be a sequence of real numbers defined as follows:
[list]
[*] $a_0 = 3$, $a_1 = 2$, and $a_2 = 12$; and
[*] $2a_{n + 3} - a_{n + 2} - 8a_{n + 1} + 4a_n = 0$ for $n \geq 0$.
[/list]
Show that $a_n$ is always a strictly positive integer.
Given a positive integer $n \ge 2$, determine the largest positive integer $N$ for which there exist $N+1$ real numbers $a_0, a_1, \dots, a_N$ such that
$(1) \ $ $a_0+a_1 = -\frac{1}{n},$ and
$(2) \ $ $(a_k+a_{k-1})(a_k+a_{k+1})=a_{k-1}-a_{k+1}$ for $1 \le k \le N-1$.
Let $n$ be a positive integer. Given a sequence $\varepsilon_1$, $\dots$, $\varepsilon_{n - 1}$ with $\varepsilon_i = 0$ or $\varepsilon_i = 1$ for each $i = 1$, $\dots$, $n - 1$, the sequences $a_0$, $\dots$, $a_n$ and $b_0$, $\dots$, $b_n$ are constructed by the following rules: \[a_0 = b_0 = 1, \quad a_1 = b_1 = 7,\] \[\begin{array}{lll}
a_{i+1} =
\begin{cases}
2a_{i-1} + 3a_i, \\
3a_{i-1} + a_i,
\end{cases} &
\begin{array}{l}
\text{if } \varepsilon_i = 0, \\
\text{if } \varepsilon_i = 1, \end{array}
& \text{for each } i = 1, \dots, n - 1, \\[15pt]
b_{i+1}=
\begin{cases}
2b_{i-1} + 3b_i, \\
3b_{i-1} + b_i,
\end{cases} &
\begin{array}{l}
\text{if } \varepsilon_{n-i} = 0, \\
\text{if } \varepsilon_{n-i} = 1, \end{array}
& \text{for each } i = 1, \dots, n - 1.
\end{array}\] Prove that $a_n = b_n$.
[i]Proposed by Ilya Bogdanov, Russia[/i]
[u]Part 1[/u]
[b]p1.[/b] Two kids $A$ and $B$ play a game as follows: From a box containing $n$ marbles ($n > 1$), they alternately take some marbles for themselves, such that:
1. $A$ goes first.
2. The number of marbles taken by $A$ in his first turn, denoted by $k$, must be between $1$ and $n$, inclusive.
3. The number of marbles taken in a turn by any player must be between $1$ and $k$, inclusive.
The winner is the one who takes the last marble. What is the sum of all $n$ for which $B$ has a winning strategy?
[b]p2.[/b] How many ways can your rearrange the letters of "Alejandro" such that it contains exactly one pair of adjacent vowels?
[b]p3.[/b] Assuming real values for $p, q, r$, and $s$, the equation $$x^4 + px^3 + qx^2 + rx + s$$ has four non-real roots. The sum of two of these roots is $q + 6i$, and the product of the other two roots is $3 - 4i$. Find the smallest value of $q$.
[b]p4.[/b] Lisa has a $3$D box that is $48$ units long, $140$ units high, and $126$ units wide. She shines a laser beam into the box through one of the corners, at a $45^o$ angle with respect to all of the sides of the box. Whenever the laser beam hits a side of the box, it is reflected perfectly, again at a $45^o$ angle. Compute the distance the laser beam travels until it hits one of the eight corners of the box.
[u]Part 2[/u]
[b]p5.[/b] How many ways can you divide a heptagon into five non-overlapping triangles such that the vertices of the triangles are vertices of the heptagon?
[b]p6.[/b] Let $a$ be the greatest root of $y = x^3 + 7x^2 - 14x - 48$. Let $b$ be the number of ways to pick a group of $a$ people out of a collection of $a^2$ people. Find $\frac{b}{2}$ .
[b]p7.[/b] Consider the equation
$$1 -\frac{1}{d}=\frac{1}{a}+\frac{1}{b}+\frac{1}{c},$$
with $a, b, c$, and $d$ being positive integers. What is the largest value for $d$?
[b]p8.[/b] The number of non-negative integers $x_1, x_2,..., x_{12}$ such that $$x_1 + x_2 + ... + x_{12} \le 17$$
can be expressed in the form ${a \choose b}$ , where $2b \le a$. Find $a + b$.
[u]Part 3[/u]
[b]p9.[/b] In the diagram below, $AB$ is tangent to circle $O$. Given that $AC = 15$, $AB = 27/2$, and $BD = 243/34$, compute the area of $\vartriangle ABC$.
[img]https://cdn.artofproblemsolving.com/attachments/b/f/b403e5e188916ac4fb1b0ba74adb7f1e50e86a.png[/img]
[b]p10.[/b] If
$$\left[2^{\log x}\right]^{[x^{\log 2}]^{[2^{\log x}]...}}= 2, $$
where $\log x$ is the base-$10$ logarithm of $x$, then it follows that $x =\sqrt{n}$. Compute $n^2$.
[b]p11.[/b]
[b]p12.[/b] Find $n$ in the equation $$133^5 + 110^5 + 84^5 + 27^5 = n^5, $$ where $n$ is an integer less than $170$.
[u]Part 4[/u]
[b]p13.[/b] Let $x$ be the answer to number $14$, and $z$ be the answer to number $16$. Define $f(n)$ as the number of distinct two-digit integers that can be formed from digits in $n$. For example, $f(15) = 4$ because the integers $11$, $15$, $51$, $55$ can be formed from digits of $15$. Let $w$ be such that $f(3xz - w) = w$. Find $w$.
[b]p14.[/b] Let $w$ be the answer to number $13$ and $z$ be the answer to number $16$. Let $x$ be such that the coefficient of $a^xb^x$ in $(a + b)^{2x}$ is $5z^2 + 2w - 1$. Find $x$.
[b]p15.[/b] Let $w$ be the answer to number $13$, $x$ be the answer to number $14$, and $z$ be the answer to number $16$. Let $A$, $B$, $C$, $D$ be points on a circle, in that order, such that $\overline{AD}$ is a diameter of the circle. Let $E$ be the intersection of $\overleftrightarrow{AB}$ and $\overleftrightarrow{DC}$, let $F$ be the intersection of $\overleftrightarrow{AC}$ and $\overleftrightarrow{BD}$, and let $G$ be the intersection of $\overleftrightarrow{EF}$ and $\overleftrightarrow{AD}$. Now, let $AE = 3x$, $ED = w^2 - w + 1$, and $AD = 2z$. If $FG = y$, find $y$.
[b]p16.[/b] Let $w$ be the answer to number $13$, and $x$ be the answer to number $16$. Let $z$ be the number of integers $n$ in the set $S = \{w,w + 1, ... ,16x - 1, 16x\}$ such that $n^2 + n^3$ is a perfect square. Find $z$.
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $x_0,x_1,x_2,\dots$ be the sequence such that $x_0=1$ and for $n\ge 0,$
\[x_{n+1}=\ln(e^{x_n}-x_n)\]
(as usual, the function $\ln$ is the natural logarithm). Show that the infinite series
\[x_0+x_1+x_2+\cdots\]
converges and find its sum.
A sequence $(a_n)_{n\ge 1}$ of integers is defined by the recurrence
\[a_1=1,\ a_2=5,\ a_n=\frac{a_{n-1}^2+4}{a_{n-2}}\ \text{for}\ n\ge 2.\]
Prove that all terms of the sequence are integers and find an explicit formula for $a_n$.
Consider the following sequence: $a_1 = 1$, $a_2 = 2$, $a_3 = 3$, and
\[a_{n+3} = \frac{a_{n+1}^2 + a_{n+2}^2 - 2}{a_n}\]
for all integers $n \ge 1$. Prove that every term of the sequence is a positive integer.
The sequence of real numbers $a_1, a_2, a_3, ...$ is defined as follows: $a_1 = 2019$, $a_2 = 2020$, $a_3 = 2021$ and for all $n \ge 1$
$$a_{n+3} = 5a^6_{n+2} + 3a^3_{n+1} + a^2_n.$$
Show that this sequence does not contain numbers of the form $m^6$ where $m$ is a positive integer.
Let $a_1\in (0,1)$ and $(a_n)_{n\ge 1}$ a sequence of real numbers defined by $a_{n+1}=a_n(1-a_n^2),\ (\forall)n\ge 1$. Evaluate $\lim_{n\to \infty} a_n\sqrt{n}$.
$(GBR 5)$ Let us define $u_0 = 0, u_1 = 1$ and for $n\ge 0, u_{n+2} = au_{n+1}+bu_n, a$ and $b$ being positive integers. Express $u_n$ as a polynomial in $a$ and $b.$ Prove the result. Given that $b$ is prime, prove that $b$ divides $a(u_b -1).$
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.
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.\]
Determine all functions $f$ from the reals to the reals for which
(1) $f(x)$ is strictly increasing and (2) $f(x) + g(x) = 2x$ for all real $x$,
where $g(x)$ is the composition inverse function to $f(x)$. (Note: $f$ and $g$ are said to be composition inverses if $f(g(x)) = x$ and $g(f(x)) = x$ for all real $x$.)