Found problems: 5923
We consider the two sequences $(a_n)_{n\ge 0}$ and $(b_n) _{n\ge 0}$ of integers, which are given by $a_0 = b_0 = 2$ and $a_1= b_1 = 14$ and for $n\ge 2$ they are defined as
$a_n = 14a_{n-1} + a_{n-2}$ ,
$b_n = 6b_{n-1}-b_{n-2}$.
Determine whether there are infinite numbers that occur in both sequences
Now Wendy wanders over and joins Dr. Lisi and her younger siblings. Thinking she knows everything there is about how to work with arithmetic series, she nearly turns right around to walk back home when Dr. Lisi poses a more challenging problem. "Suppose I select two distinct terms at random from the $2008$ term sequence. What's the probability that their product is positive?" If $a$ and $b$ are relatively prime positive integers such that $a/b$ is the probability that the product of the two terms is positive, find the value of $a+b$.
Let $a_1, a_2, \ldots , a_{11}$ be 11 pairwise distinct positive integer with sum less than 2007. Let S be the sequence of $1,2, \ldots ,2007$. Define an [b]operation[/b] to be 22 consecutive applications of the following steps on the sequence $S$: on $i$-th step, choose a number from the sequense $S$ at random, say $x$. If $1 \leq i \leq 11$, replace $x$ with $x+a_i$ ; if $12 \leq i \leq 22$, replace $x$ with $x-a_{i-11}$ . If the result of [b]operation[/b] on the sequence $S$ is an odd permutation of $\{1, 2, \ldots , 2007\}$, it is an [b]odd operation[/b]; if the result of [b]operation[/b] on the sequence $S$ is an even permutation of $\{1, 2, \ldots , 2007\}$, it is an [b]even operation[/b]. Which is larger, the number of odd operation or the number of even permutation? And by how many?
Here $\{x_1, x_2, \ldots , x_{2007}\}$ is an even permutation of $\{1, 2, \ldots ,2007\}$ if the product $\prod_{i > j} (x_i - x_j)$ is positive, and an odd one otherwise.
Here are $n^2$ numbers:
$a_{11},a_{12},a_{13},\cdots,a_{1n}\\
a_{21},a_{22},a_{23},\cdots,a_{2n}\\
\cdots\\
a_{n1},a_{n2},a_{n3},\cdots,a_{nn}$
Numbers in each line are arithmetic sequence, numbers in each column are geometric series.
If $a_{24}=1,a_{42}=\frac{1}{8},a_{43}=\frac{3}{16}$, find $a_{11}+a_{22}+\cdots+a_{nn}$.
Let $a_n$ be a recursively defined sequence with $a_0=2024$ and $a_{n+1}=a_n^3+5a_n^2+10a_n+6$ for $n\ge 0.$ Determine the value of $$\sum_{n=0}^{\infty} \frac{2^n(a_n+1)}{a_n^2+3a_n+4}.$$
Suppose $ 2015= a_1 <a_2 < a_3<\cdots <a_k $ be a finite sequence of positive integers, and for all $ m, n \in \mathbb{N} $ and $1\le m,n \le k $, $$ a_m+a_n\ge a_{m+n}+|m-n| $$ Determine the largest possible value $ k $ can obtain.
Let $\mathcal{A}$ be the set of finite sequences of positive integers $a_1,a_2,\dots,a_k$ such that $|a_n-a_{n-1}|=a_{n-2}$ for all $3\leqslant n\leqslant k$. If $a_1=a_2=1$, and $k=18$, determine the number of elements of $\mathcal{A}$.
A house has an even number of lamps distributed among its rooms in such a way that there are at least three lamps in every room. Each lamp shares a switch with exactly one other lamp, not necessarily from the same room. Each change in the switch shared by two lamps changes their states simultaneously. Prove that for every initial state of the lamps there exists a sequence of changes in some of the switches at the end of which each room contains lamps which are on as well as lamps which are off.
[i]Proposed by Australia[/i]
Let $(a_n)_n\geq 0$ and $a_{m+n}+a_{m-n}=\frac{1}{2}(a_{2m}+a_{2n})$ for every $m\geq n\geq0.$ If $a_1=1,$ then find the value of $a_{2007}.$
Consider the sequence $a_1, a_2, a_3, \ldots$ with
$$ a_n = \frac{1}{n(n+1)}.$$
In how many ways can the number $\frac{1}{1980}$ be represented as the sum of finitely many consecutive terms of
this sequence?
Let $K > 0$ be an integer. An integer $k \in [0,K]$ is randomly chosen. A sequence of integers is defined starting on $k$ and ending on $0$, where each nonzero term $t$ is followed by $t$ minus the largest Lucas number not exceeding $t$.
The probability that $4$, $5$, or $6$ is in this sequence approaches $\tfrac{a - b \sqrt c}{d}$ for arbitrarily large $K$, where $a$, $b$, $c$, $d$, are positive integers, $\gcd(a,b,d) = 1$, and $c$ is squarefree. Find $a + b + c + d$.
[i](Lucas numbers are defined as the members of the infinite integer sequence $2$, $1$, $3$, $4$, $7$, $\ldots$ where each term is the sum of the two before it.)[/i]
[i]Proposed by Evan Chang[/i]
The Fibonacci sequence $\{F_{n}\}$ is defined by \[F_{1}=1, \; F_{2}=1, \; F_{n+2}=F_{n+1}+F_{n}.\] Show that $F_{mn-1}-F_{n-1}^{m}$ is divisible by $F_{n}^{2}$ for all $m \ge 1$ and $n>1$.
In the decimal expansion of $\sqrt{2}=1.4142\dots$, Isabelle finds a sequence of $k$ successive zeroes where $k$ is a positive integer.
Show that the first zero of this sequence can occur no earlier than at the $k$-th position after the decimal point.
For the sequence of real numbers $a_1,a_2,\dots ,a_k$ we say it is [i]invested[/i] on the interval $[b,c]$ if there exists numbers $x_0,x_1,\dots ,x_k$ in the interval $[b,c]$ such that $|x_i-x_{i-1}|=a_i$ for $i=1,2,3,\dots k$ .
A sequence is [i]normed[/i] if all its members are not greater than $1$ . For a given natural $n$ , prove :
a)Every [i]normed[/i] sequence of length $2n+1$ is [i]invested[/i] in the interval $\left[ 0, 2-\frac{1}{2^n} \right ]$.
b) there exists [i]normed[/i] sequence of length $4n+3$ wich is not [i]invested[/i] on $\left[ 0, 2-\frac{1}{2^n} \right ]$.
Consider an arrangement of tokens in the plane, not necessarily at distinct points. We are allowed to apply a sequence of moves of the following kind: select a pair of tokens at points $A$ and $B$ and move both of them to the midpoint of $A$ and $B$.
We say that an arrangement of $n$ tokens is [i]collapsible[/i] if it is possible to end up with all $n$ tokens at the same point after a finite number of moves. Prove that every arrangement of $n$ tokens is collapsible if and only if $n$ is a power of $2$.
Prove that there is a similarity between a triangle $ABC$ and the triangle having as sides the medians of the triangle $ABC$ if and only if the squares of the lengths of the sides of triangle $ABC$ form an arithmetic sequence.
[i]Marian Teler & Marin Ionescu[/i]
Let $a_0, a_1, \ldots , a_n$ and $b_0, b_1, \ldots , b_n$ be sequences of real numbers such that $a_0 = b_0 \geqslant 0$, $a_n = b_n > 0$ and \[a_i=\sqrt{\frac{a_{i+1}+a_{i-1}}{2}},\quad b_i=\sqrt{\frac{b_{i+1}+b_{i-1}}{2}},\]for all $i=1,\ldots,n-1$. Prove that $a_1 = b_1$.
Consider the sequence $(a_n)_{n\ge 1}$ such that $a_1=1$ and $a_{n+1}=\sqrt{a_n+n^2}$, $\forall n\ge 1$.
$\textbf{(a)}$ Prove that there is exactly one rational number among the numbers $a_1,a_2,a_3,\dots$.
$\textbf{(b)}$ Consider the sequence $(S_n)_{n\ge 1}$ such that
$$S_n=\sum_{i=1}^n\frac{4}{\left (\left \lfloor a_{i+1}^2\right \rfloor-\left \lfloor a_i^2\right \rfloor\right)\left(\left \lfloor a_{i+2}^2\right \rfloor-\left \lfloor a_{i+1}^2\right \rfloor\right)}.$$
Prove that there exists an integer $N$ such that $S_n>0.9$, $\forall n>N$.
[i] (Stefan Obadă)[/i]
Consider the sequence $$1,1,2,1,2,4,1,2,4,8,1,2,4,8,16,1, . . .$$ formed by writing the first power of two, followed by the first two powers of two, followed by the first three powers of two, and so on. Find the smallest positive integer $N$ such that $N > 100$ and the sum of the first $N$ terms of this sequence is a power of two.
Every month a forester Ermolay has planted 2000 trees along a fence. On every tree, he has written how many oaks there are among itself and trees at his right and left. This way a sequence of 2000 numbers was created. How many distinct sequences could the forester Ermolay get? (oak is a certain type of tree)
[I]Proposed by A. Khrabrov, D.Rostovski[/i]
[b]p1.[/b] Let $D(n)$ denote the number of positive factors of the integer $n$. For example, $D(6) = 4$ , since the factors of $6$ are $1, 2, 3$ , and $6$ . Note that $D(n) = 2$ if and only if $n$ is a prime number.
(a) Describe the set of all solutions to the equation $D(n) = 5$ .
(b) Describe the set of all solutions to the equation $D(n) = 6$ .
(c) Find the smallest $n$ such that $D(n) = 21$ .
[b]p2.[/b] At a party with $n$ married couples present (and no one else), various people shook hands with various other people. Assume that no one shook hands with his or her spouse, and no one shook hands with the same person more than once. At the end of the evening Mr. Jones asked everyone else, including his wife, how many hands he or she had shaken. To his surprise, he got a different answer from each person. Determine the number of hands that Mr. Jones shook that evening,
(a) if $n = 2$ .
(b) if $n = 3$ .
(c) if $n$ is an arbitrary positive integer (the answer may depend on $n$).
[b]p3.[/b] Let $n$ be a positive integer. A square is divided into triangles in the following way. A line is drawn from one corner of the square to each of $n$ points along each of the opposite two sides, forming $2n + 2$ nonoverlapping triangles, one of which has a vertex at the opposite corner and the other $2n + 1$ of which have a vertex at the original corner. The figure shows the situation for $n = 2$ . Assume that each of the $2n + 1$ triangles with a vertex in the original corner has area $1$. Determine the area of the square,
(a) if $n = 1$ .
(b) if $n$ is an arbitrary positive integer (the answer may depend on $n$).
[img]https://cdn.artofproblemsolving.com/attachments/1/1/62a54011163cc76cc8d74c73ac9f74420e1b37.png[/img]
[b]p4.[/b] Arthur and Betty play a game with the following rules. Initially there are one or more piles of stones, each pile containing one or more stones. A legal move consists either of removing one or more stones from one of the piles, or, if there are at least two piles, combining two piles into one (but not removing any stones). Arthur goes first, and play alternates until a player cannot make a legal move; the player who cannot move loses.
(a) Determine who will win the game if initially there are two piles, each with one stone, assuming that both players play optimally.
(b) Determine who will win the game if initially there are two piles, each with $n$ stones, assuming that both players play optimally; $n$ is a positive integer, and the answer may depend on $n$ .
(c) Determine who will win the game if initially there are $n$ piles, each with one stone, assuming that both players play optimally; $n$ is a positive integer, and the answer may depend on $n$ .
[b]p5.[/b] Suppose $x$ and $y$ are real numbers such that $0 < x < y$. Define a sequence$ A_0 , A_1 , A_2, A_3, ...$ by-setting $A_0 = x$ , $A_1 = y$ , and then $A_n= |A_{n-1}| - A_{n-2}$ for each $n \ge 2$ (recall that $|A_{n-1}|$ means the absolute value of $A_{n-1}$ ).
(a) Find all possible values for $A_6$ in terms of $x$ and $y$ .
(b) Find values of $x$ and $y$ so that $A_{1987} = 1987$ and $A_{1988} = -1988$ (simultaneously).
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
The sequence of real numbers $(a_n)_{n\geq 0}$ is such that $a_0 = 1$, $a_1 = a > 2$ and $\displaystyle a_{n+1} = \left(\left(\frac{a_n}{a_{n-1}}\right)^2 -2\right)a_n$ for every positive integer $n$. Prove that $\displaystyle \sum_{i=0}^k \frac{1}{a_i} < \frac{2+a-\sqrt{a^2-4}}{2}$ for every positive integer $k$.
Let $0<k<\frac{1}{2}$ be a real number and let $a_0, b_0$ be arbitrary real numbers in $(0,1)$. The sequences $(a_n)_{n\ge 0}$ and $(b_n)_{n\ge 0}$ are then defined recursively by
$$a_{n+1} = \dfrac{a_n+1}{2} \text{ and } b_{n+1} = b_n^k$$
for $n\ge 0$. Prove that $a_n<b_n$ for all sufficiently large $n$.
[i]Proposed by Michael Ma
p1. Let $U_n$ be a sequence of numbers that satisfy:
$U_1=1$, $U_n=1+U_1U_2U_3...U_{n-1}$ for $n=2,3,...,2020$
Prove that $\frac{1}{U_1}+\frac{1}{U_2}+...+\frac{1}{U_{2019}}<2$
p2. If $a= \left \lceil \sqrt{2020+\sqrt{2020+...+\sqrt{2020}}} \right\rceil$ , $b= \left \lfloor \sqrt{1442+\sqrt{1442+...+\sqrt{1442}}} \right \rfloor$, and $c=a-b$, then determine the value of $c$.
p3. Fajar will buy a pair of koi fish in the aquarium. If he randomly picks $2$ fish, then the probability that the $2$ fish are of the same sex is $1/2$. Prove that the number of koi fish in the aquarium is a perfect square.
p4. A pharmacist wants to put $155$ ml of liquid into $3$ bottles. There are 3 bottle choices, namely
a. Bottle A
$\bullet$ Capacity: $5$ ml
$\bullet$ The price of one bottle is $10,000$ Rp
$\bullet$ If you buy the next bottle, you will get a $20\%$ discount, up to the $4$th purchase or if you buy $4$ bottles, get $ 1$ free bottle A
b. Bottle B
$\bullet$ Capacity: $8$ ml
$\bullet$ The price of one bottle is $15.000$ Rp
$\bullet$ If you buy $2$ : $20\%$ discount
$\bullet$ If you buy $3$ : Free $ 1$ bottle of B
c. Bottle C
$\bullet$ Capacity : $14$ ml
$\bullet$ Buy $ 1$ : $25.000$ Rp
$\bullet$ Buy $2$ : Free $ 1$ bottle of A
$\bullet$ Buy $3$ : Free $ 1$ bottle of B
If in one purchase, you can only buy a maximum of $4$ bottles, then look for the possibility of pharmacists putting them in bottles so that the cost is minimal (bottles do not have to be filled to capacity).
p5. Two circles, let's say $L_1$ and $L_2$ have the same center, namely at point $O$. Radius of $L_1$ is $10$ cm and radius of $L_2$ is $5$ cm. The points $A, B, C, D, E, F$ lie on $L_1$ so the arcs $AB,BC,CD,DE,EF,FA$ are equal. The points $P, Q, R$ lie on $L_2$ so that the arcs $PQ,QR,RS$ are equal and $PA=PF=QB=QC=RD=RD$ . Determine the area of the shaded region.
[img]https://cdn.artofproblemsolving.com/attachments/b/5/0729eca97488ddfc82ab10eda02c708fecd7ae.png[/img]
Do there exist two sequences of real numbers $ \{a_i\}, \{b_i\},$ $ i \in \mathbb{N},$ satisfying the following conditions:
\[ \frac{3 \cdot \pi}{2} \leq a_i \leq b_i\]
and
\[ \cos(a_i x) \minus{} \cos(b_i x) \geq \minus{} \frac{1}{i}\]
$ \forall i \in \mathbb{N}$ and all $ x,$ with $ 0 < x < 1?$