Found problems: 5923
Consider the sequence of positive integers defined by $s_1,s_2,s_3, \dotsc $ of positive integers defined by
[list]
[*]$s_1=2$, and[/*]
[*]for each positive integer $n$, $s_{n+1}$ is equal to $s_n$ plus the product of prime factors of $s_n$.[/*]
[/list]
The first terms of the sequence are $2,4,6,12,18,24$.
Prove that the product of the $2019$ smallest primes is a term of the sequence.
The sequence $(a_n)$ is defined by $a_1=0$,
$$
a_{n+1}={a_1+a_2+\ldots+a_n\over n}+1.
$$
Prove that $a_{2016}>{1\over 2}+a_{1000}$.
A sequence $a_1, a_2, \ldots$ satisfies $a_1 = \dfrac 52$ and $a_{n + 1} = {a_n}^2 - 2$ for all $n \ge 1.$ Let $M$ be the integer which is closest to $a_{2023}.$ The last digit of $M$ equals
$$
\mathrm a. ~ 0\qquad \mathrm b.~2\qquad \mathrm c. ~4 \qquad \mathrm d. ~6 \qquad \mathrm e. ~8
$$
Show that the number
\[p_n=\left(\frac{3+\sqrt5}{2}\right)^n+\left(\frac{3-\sqrt5}{2}\right)^n-2\]
is a positive integer for any positive integer $n.$ Furthermore, show that the numbers $p_{2n-1}$ and $p_{2n}/5$ are perfect squares $($for any positive integer $n).$
[u]Round 1[/u]
[b]p1.[/b] Three two-digit numbers are written on a board. One starts with $5$, another with $6$, and the last one with $7$. Annie added the first and the second numbers; Benny added the second and the third numbers; Denny added the third and the first numbers. Could it be that one of these sums is equal to $148$, and the two other sums are three-digit numbers that both start with $12$?
[b]p2.[/b] Three rocks, three seashells, and one pearl are placed in identical boxes on a circular plate in the order shown. The lids of the boxes are then closed, and the plate is secretly rotated. You can open one box at a time. What is the smallest number of boxes you need to open to know where the pearl is, no matter how the plate was rotated?
[img]https://cdn.artofproblemsolving.com/attachments/0/2/6bb3a2a27f417a84ab9a64100b90b8768f7978.png[/img]
[b]p3.[/b] Two detectives, Holmes and Watson, are hunting the thief Raffles in a library, which has the floorplan exactly as shown in the diagram. Holmes and Watson start from the center room marked $D$. Show that no matter where Raffles is or how he moves, Holmes and Watson can find him. Holmes and Watson do not need to stay together. A detective sees Raffles only if they are in the same room. A detective cannot stand in a doorway to see two rooms at the same time.
[img]https://cdn.artofproblemsolving.com/attachments/c/1/6812f615e60a36aea922f145a1ffc470d0f1bc.png[/img]
[b]p4.[/b] A museum has a $4\times 4$ grid of rooms. Every two rooms that share a wall are connected by a door. Each room contains some paintings. The total number of paintings along any path of $7$ rooms from the lower left to the upper right room is always the same. Furthermore, the total number of paintings along any path of $7$ rooms from the lower right to the upper left room is always the same. The guide states that the museum has exactly $500$ paintings. Show that the guide is mistaken.
[img]https://cdn.artofproblemsolving.com/attachments/4/6/bf0185e142cd3f653d4a9c0882d818c55c64e4.png[/img]
[b]p5.[/b] The numbers $1–14$ are placed around a circle in some order. You can swap two neighbors if they differ by more than $1$. Is it always possible to rearrange the numbers using swaps so they are ordered clockwise from $1$ to $14$?
[u]Round 2[/u]
[b]p6.[/b] A triangulation of a regular polygon is a way of drawing line segments between its vertices so that no two segments cross, and the interior of the polygon is divided into triangles. A flip move erases a line segment between two triangles, creating a quadrilateral, and replaces it with the opposite diagonal through that quadrilateral. This results in a new triangulation.
[img]https://cdn.artofproblemsolving.com/attachments/a/a/657a7cf2382bab4d03046075c6e128374c72d4.png[/img]
Given any two triangulations of a polygon, is it always possible to find a sequence of flip moves that transforms the first one into the second one?
[img]https://cdn.artofproblemsolving.com/attachments/0/9/d09a3be9a01610ffc85010d2ac2f5b93fab46a.png[/img]
[b]p7.[/b] Is it possible to place the numbers from $1$ to $121$ in an $11\times 11$ table so that numbers that differ by $1$ are in horizontally or vertically adjacent cells and all the perfect squares $(1, 4, 9,..., 121)$ are in one column?
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$
\[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n}, \]
where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof.
Show that $L_{2n+1}+(-1)^{n+1}(n \geq 1)$ can be written as a product of three (not necessarily distinct) Fibonacci numbers.
Determine if there exists an infinite sequence $a_0, a_1, a_2, a_3,...$ of nonegative integers that satisfies the following conditions:
(i) All nonegative integers appear in the sequence exactly once.
(ii) The succession
$b_n=a_{n}+n,$, $n\geq0$,
is formed by all prime numbers and each one appears exactly once.
Let $a_1,a_2,\ldots$ be a sequence defined by $a_1 = 1$ and for $n\ge1$, $a_{n+1} = \sqrt{a_n^2 -2a_n + 3} + 1$. Find $a_{513}$.
[i]Ray Li.[/i]
Let $x_0,x_1,x_2,\ldots$ be a sequence of rational numbers defined recursively as follows: $x_0$ can be any rational number and, for $n\ge 0$,
\[
x_{n+1}=\begin{cases} \left|\frac{x_n}2-1\right| & \text{if the numerator of }x_n\text{ is even}, \\
\left|\frac1{x_n}-1\right| & \text{if the numerator of }x_n\text{ is odd},\end{cases}
\]
where by numerator of a rational number we mean the numerator of the fraction in its lowest terms. Prove that for any value of $x_0$:
(a) the sequence contains only finitely many distinct terms;
(b) the sequence contains exactly one of the numbers $0$ and $2/3$ (namely, either there exists an index $k$ such that $x_k=0$, or there exists an index $m$ such that $x_m=2/3$, but not both).
Define a sequence $\{ a_n \}_{n=0}^{\infty}$ by $a_0 = 1,$ $a_1 = 8,$ and $a_n = 2a_{n-1} + a_{n-2}$ for $n \geq 2.$ The infinite sum
\[ \sum_{n=1}^{\infty} \int_{0}^{2021\pi/14} \sin(a_{n-1}x)\sin(a_nx)\,dx \]
can be expressed as a common fraction $\tfrac{p}{q}.$ Compute $p + q.$
Consider the sequence $ \{a_n\}_{n\geq1}$ defined as follows: $ a_1 \equal{} 1$, $ a_{2k} \equal{} 1 \plus{} a_k$ and $ a_{2k \plus{} 1} \equal{} \frac {1}{a_{2k}}$ for every $ k\geq 1$. Prove that every positive rational number appears on the sequence $ \{a_n\}$ exactly once.
Given three infinite arithmetic progressions of natural numbers such that each of the numbers 1,2,3,4,5,6,7 and 8 belongs to at least one of them, prove that the number 1980 also belongs to at least one of them.
The infinity sequence $r_{1},r_{2},...$ of rational numbers it satisfies that:
$\prod_{i=1}^ {k}r_{i}=\sum_{i=1}^{k} r_{i}$.
For all natural k.
Show that $\frac{1}{r_{n}}-\frac{3}{4}$ is a square of rationale number for all natural $n\geq3$
Two real sequence $ \{x_{n}\}$ and $ \{y_{n}\}$ satisfies following recurrence formula;
$ x_{0}\equal{} 1$, $ y_{0}\equal{} 2007$
$ x_{n\plus{}1}\equal{} x_{n}\minus{}(x_{n}y_{n}\plus{}x_{n\plus{}1}y_{n\plus{}1}\minus{}2)(y_{n}\plus{}y_{n\plus{}1})$,
$ y_{n\plus{}1}\equal{} y_{n}\minus{}(x_{n}y_{n}\plus{}x_{n\plus{}1}y_{n\plus{}1}\minus{}2)(x_{n}\plus{}x_{n\plus{}1})$
Then show that for all nonnegative integer $ n$, $ {x_{n}}^{2}\leq 2007$.
Given a positive integer $k\geq2$, set $a_1=1$ and, for every integer $n\geq 2$, let $a_n$ be the smallest solution of equation
\[x=1+\sum_{i=1}^{n-1}\left\lfloor\sqrt[k]{\frac{x}{a_i}}\right\rfloor\]
that exceeds $a_{n-1}$. Prove that all primes are among the terms of the sequence $a_1,a_2,\ldots$
The angles at $A,B,C,D,E$ of a pentagon $ABCDE$ inscribed in a circle form an increasing sequence. Show that the angle at $C$ is greater than $\pi/2$, and that this lower bound cannot be improved.
Let $k$ be an integer and $k > 1$. Define a sequence $\{a_n\}$ as follows:
$a_0 = 0$,
$a_1 = 1$, and
$a_{n+1} = ka_n + a_{n-1}$ for $n = 1,2,...$.
Determine, with proof, all possible $k$ for which there exist non-negative integers $l,m (l \not= m)$ and positive integers $p,q$ such that $a_l + ka_p = a_m + ka_q$.
In how many ways can $345$ be written as the sum of an increasing sequence of two or more consecutive positive integers?
$\textbf{(A)}\ 1\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 5\qquad\textbf{(D)}\ 6\qquad\textbf{(E)}\ 7$
Let $x_1,x_2,\cdots,x_n$ $(n\geq2)$ be a non-decreasing monotonous sequence of positive numbers such that $x_1,\frac{x_2}{2},\cdots,\frac{x_n}{n}$ is a non-increasing monotonous sequence .Prove that
\[ \frac{\sum_{i=1}^{n} x_i }{n\left (\prod_{i=1}^{n}x_i \right )^{\frac{1}{n}}}\le \frac{n+1}{2\sqrt[n]{n!}}\]
If $$\Omega_n=\sum \limits_{k=1}^n \left(\int \limits_{-\frac{1}{k}}^{\frac{1}{k}}(2x^{10} + 3x^8 + 1)\cos^{-1}(kx)dx\right)$$Then find $$\Omega=\lim \limits_{n\to \infty}\left(\Omega_n-\pi H_n\right)$$
Alex Lishkov is trying to guess sequence of $2009$ random ternary digits ($0, 1$, or $2$). After he guesses each digit, he finds out whether he was right or not. If he guesses incorrectly, and $k$ was the correct answer, then an oracle tells him what the next $k$ digits will be. Being Bulgarian, Lishkov plays to maximize the expected number of digits guessed correctly. Let $P_n$ be the probability that Lishkov guesses the nth digit correctly. Find $P_{2009}$. Write your answer in the form $x + yRe(\rho^k)$, where $x$ and $y$ are rational, $\rho$ is complex, and $k$ is a positive integer
Let $\frac{2}{\sqrt5+1}\leq p < 1$, and let the real sequence $\{ a_n \}$ have the following property: for every sequence $\{ e_n \}$ of $0$'s and $\pm 1$'s for which $\sum_{n=1}^\infty e_np^n=0$, we also have $\sum_{n=1}^\infty e_na_n=0$. Prove that there is a number $c$ such that $a_n=cp^n$ for all $n$. [Z. Daroczy, I. Katai]
Anja has to write $2014$ integers on the board such that arithmetic mean of any of the three numbers is among those $2014$ numbers. Show that this is possible only when she writes nothing but $2014$ equal integers.
Define sequence of positive integers $(a_n)$ as $a_1 = a$ and $a_{n+1} = a^2_n + 1$ for $n \ge 1$. Prove that there is no index $n$ for which $$\prod_{k=1}^{n} \left(a^2_k + a_k + 1\right)$$ is a perfect square.
Are there infinite increasing sequence of natural numbers, such that sum of every 2 different numbers are relatively prime with sum of every 3 different numbers?