Found problems: 5923
Let be a $ \beta >1. $ Calculate $ \lim_{n\to\infty} \frac{k(n)}{n} ,$ where $ k(n) $ is the smallest natural number that satisfies the inequality $ (1+n)^k\ge n^k\beta . $
[i]Neculai Hârţan[/i]
Five distinct $2$-digit numbers are in a geometric progression. Find the middle term.
Alice, Bob, and Carol repeatedly take turns tossing a die. Alice begins; Bob always follows Alice; Carol always follows Bob; and Alice always follows Carol. Find the probability that Carol will be the first one to toss a six. (The probability of obtaining a six on any toss is $ \frac{1}{6}$, independent of the outcome of any other toss.)
$ \textbf{(A)}\ \frac{1}{3}\qquad
\textbf{(B)}\ \frac{2}{9}\qquad
\textbf{(C)}\ \frac{5}{18}\qquad
\textbf{(D)}\ \frac{25}{91}\qquad
\textbf{(E)}\ \frac{36}{91}$
The sequence of Fibonnaci's numbers if defined from the two first digits $f_1=f_2=1$ and the formula $f_{n+2}=f_{n+1}+f_n$, $\forall n \in N$.
[b](a)[/b] Prove that $f_{2010} $ is divisible by $10$.
[b](b)[/b] Is $f_{1005}$ divisible by $4$?
Albanian National Mathematical Olympiad 2010---12 GRADE Question 4.
Let $ \mathcal{C}$ be the hyperbola $ y^2 \minus{} x^2 \equal{} 1$. Given a point $ P_0$ on the $ x$-axis, we construct a sequence of points $ (P_n)$ on the $ x$-axis in the following manner: let $ \ell_n$ be the line with slope $ 1$ passing passing through $ P_n$, then $ P_{n\plus{}1}$ is the orthogonal projection of the point of intersection of $ \ell_n$ and $ \mathcal C$ onto the $ x$-axis. (If $ P_n \equal{} 0$, then the sequence simply terminates.)
Let $ N$ be the number of starting positions $ P_0$ on the $ x$-axis such that $ P_0 \equal{} P_{2008}$. Determine the remainder of $ N$ when divided by $ 2008$.
The Fibonacci sequence is defined by $F_0=F_1=1$ and $F_{n+2}=F_{n+1}+F_n$ for $n\ge0$. Prove that the sum of $2000$ consecutive terms of the Fibonacci sequence is never a term of the sequence.
Let $s_1,s_2,s_3,s_4,...$ be a sequence (infinite list) of $1$s and $0$s. For example $1,0,1,0,1,0,...$, that is, $s_n=1$ if $n$ is odd and $s_n=0$ if $n$ is even, is such a sequence. Prove that it is possible to delete infinitely many terms in $s_1,s_2,s_3,s_4,...$ so that the resulting sequence is the original sequence. For the given example, one can delete $s_3,s_4,s_7,s_8,s_{11},s_{12},...$
Two-way flights are operated between $80$ cities in such a way that each city is connected to at least $7$ other cities by a direct flight and any two cities are connected by a finite sequence of flights. Find the smallest $k$ such that for any such arrangement of flights it is possible to travel from any city to any other city by a sequence of at most $k$ flights.
Let $n$ be a positive integer. Consider a triangular array of nonnegative integers as follows: \[
\begin{array}{rccccccccc}
\text{Row } 1: &&&&& a_{0,1} &&&& \smallskip\\
\text{Row } 2: &&&& a_{0,2} && a_{1,2} &&& \smallskip\\
&&& \vdots && \vdots && \vdots && \smallskip\\
\text{Row } n-1: && a_{0,n-1} && a_{1,n-1} && \cdots && a_{n-2,n-1} & \smallskip\\
\text{Row } n: & a_{0,n} && a_{1,n} && a_{2,n} && \cdots && a_{n-1,n}
\end{array}
\] Call such a triangular array [i]stable[/i] if for every $0 \le i < j < k \le n$ we have \[ a_{i,j} + a_{j,k} \le a_{i,k} \le a_{i,j} + a_{j,k} + 1. \] For $s_1, \ldots s_n$ any nondecreasing sequence of nonnegative integers, prove that there exists a unique stable triangular array such that the sum of all of the entries in row $k$ is equal to $s_k$.
Let $ a_1$, $ a_2$, $ \ldots$, $ a_n$ be distinct positive integers, $ n\ge 3$. Prove that there exist distinct indices $ i$ and $ j$ such that $ a_i \plus{} a_j$ does not divide any of the numbers $ 3a_1$, $ 3a_2$, $ \ldots$, $ 3a_n$.
[i]Proposed by Mohsen Jamaali, Iran[/i]
Let $m$ be a positive integer, and let $a_0, a_1,\ldots,a_m$ be a sequence of reals such that $a_0=37$, $a_1=72$, $a_m=0$, and \[a_{k+1}=a_{k-1}-\frac{3}{a_k}\] for $k=1,2, \dots, m-1$. Find $m$.
Radii of five concentric circles $\omega_0,\omega_1,\omega_2,\omega_3,\omega_4$ form a geometric progression with common ratio $q$ in this order. What is the maximal value of $q$ for which it's possible to draw a broken line $A_0A_1A_2A_3A_4$ consisting of four equal segments such that $A_i$ lies on $\omega_i$ for every $i=\overline{0,4}$?
[hide=thanks ]Thanks to the user Vlados021 for translating the problem.[/hide]
George plays the following game: At every step he can replace a triple of integers $(x,y,z)$ which is written on the blackboard, with any of the following triples:
(i) $(x,z,y)$
(ii) $(-x,y,z)$
(iii) $(x+y,y,2x+y+z)$
(iv) $(x-y,y,y+z-2x)$
Initially, the triple $(1,1,1)$ is written on the blackboard. Determine whether George can, with a sequence of allowed steps, end up at the triple $(2021,2019,2023)$, fully justifying your answer.
Given a positive integer $n$, consider the sequence $(a_i)$, $1 \leq i \leq 2n$, defined as follows:
$a_{2k-1} = -k, 1 \leq k \leq n$
$a_{2k} = n-k+1, 1 \leq k \leq n.$
We call a pair of numbers $(b,c)$ good if the following conditions are met:
$i) 1 \leq b < c \leq 2n,$
$ii) \sum_{j=b}^{c}a_j = 0$
If $B(n)$ is the number of good pairs corresponding to $n$, prove that there are infinitely many $n$ for which $B(n) = n$.
A sequence of real numbers $a_1,a_2,\ldots$ satisfies the relation
$$a_n=-\max_{i+j=n}(a_i+a_j)\qquad\text{for all}\quad n>2017.$$
Prove that the sequence is bounded, i.e., there is a constant $M$ such that $|a_n|\leq M$ for all positive integers $n$.
Consider the infinite polynomial $G(x) = F_1x+F_2x^2 +F_3x^3 +...$ defined for $0 < x <\frac{\sqrt5 -1}{2}$ where Fk is the $k$th term of the Fibonacci sequence defined to be $F_k = F_{k-1} + F_{k-2}$ with $F_1 = 1$, $F_2 = 1$. Determine the value a such that $G(a) = 2$.
Let $a,b,c>0.$ If $\frac 1a,\frac 1b,\frac 1c$ are in arithmetic progression, and if $a^2+b^2,b^2+c^2,c^2+a^2$ are in geometric progression, show that $a=b=c.$
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.
Let a_1, a_2, a_3,... be a sequence of positive numbers. If there exists a positive number M such that for n = 1,2,3,...,
$a^{2}_{1}+a^{2}_{2}+...+a^{2}_{n}< Ma^{2}_{n+1}$
then prove that there exist a positive number M' such that for every n = 1,2,3,...,
$a_{1}+a_{2}+...+a_{n}< M'a_{n+1}$
The numeric sequence $(a_n)_{n\geq1}$ verifies the relation $a_{n+1} = \frac{n+2}{n} \cdot (a_n-1)$ for any $n\in N^*$.Show that $a_n \in Z$ for any $n\in N^*$ ,if $a_1\in Z$.
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$.
Find the limit of the sequence $x_n$ defined by recurrence relation $$x_{n+2}=\frac{1}{12}x_{n+1}+\frac{1}{2}x_{n}+1$$ where $n=0,1,2,...$ for any initial values $x_2,x_1$.
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 $\{a_n\}_{n\geq 1}$ is defined by $a_{n+2}=7a_{n+1}-a_n$ for positive integers $n$ with initial values $a_1=1$ and $a_2=8$. Another sequence, $\{b_n\}$, is defined by the rule $b_{n+2}=3b_{n+1}-b_n$ for positive integers $n$ together with the values $b_1=1$ and $b_2=2$. Find $\gcd(a_{5000},b_{501})$.
Given a positive integer $\ell,$ define the sequence $\{a^{(\ell)}\}_{n=1}^{\infty}$ such that $a_n^{(\ell)}=\lfloor n + \sqrt[\ell]{n}+\tfrac{1}{2}\rfloor$ for all positive integers $n.$ Let $S$ denote the set of positive integers that appear in all three of the sequences $\{a_n^{(2)} \}_{n=1}^{\infty},$ $\{a_n^{(3)} \}_{n=1}^{\infty},$ and $\{a_n^{(4)} \}_{n=1}^{\infty}.$ Find the sum of the elements of $S$ that lie in the interval $[1,100].$