Found problems: 5923
Arithmetic sequence with all items real, and the common difference is $4$. If the sum of the square of the first item and all items else is not more than $100$, then there are________items at most.
For each sequence of $n$ zeros and $n$ units, we assign a number that is a number sections of the same digits in it. (For example, sequence $00111001$ has $4$ such sections $00, 111,00, 1$.) For a given $n$ we sum up all the numbers assigned to each such sequence. Prove that the sum total is equal to $(n+1){2n \choose n} $
Is there an infinite periodic sequence consisting of the letters $a$ and$ b$, such that if all letters are replaced simultaneously $a$ to $aba$ and letters $b$ to $bba$ does it transform into itself (possibly with a shift)? (A sequence is called periodic if there is such natural number $n$, which for every $i = 1, 2, . . . i$-th member of this sequence is equal to the ($i + n$)- th.)
The Fibonacci sequence is determined by conditions $ F_0 \equal{} 0, F1 \equal{} 1$, and $ F_k\equal{}F_{k\minus{}1}\plus{}F_{k\minus{}2}$ for all $ k \ge 2$. Let $ n$ be a positive integer and let $ P(x) \equal{} a_mx^m \plus{}. . .\plus{} a_1x\plus{} a_0$ be a polynomial that satisfies the following two conditions:
(1) $ P(F_n) \equal{} F_{n}^{2}$ ;
(2) $ P(F_k) \equal{} P(F_{k\minus{}1}) \plus{} P(F_{k\minus{}2}$ for all $ k \ge 2$.
Find the sum of the coefficients of P.
Define a sequence $a_n$ such that $a_n = a_{n-1} - a_{n-2}$. Let $a_1 = 6$ and $a_2 = 5$. Find $\Sigma_{n=1}^{1000}a_n$.
Is there an infinite sequence of prime numbers $p_1, p_2, ..., p_n, ...,$ such that for every $i \in \mathbb{N}, p_{i + 1} \in \{2p_i - 1, 2p_i + 1\}$ is satisfied? Explain the answer.
Determine is there a function $a: \mathbb{N} \rightarrow \mathbb{N}$ such that:
$i)$ $a(0)=0$
$ii)$ $a(n)=n-a(a(n))$, $\forall n \in$ $ \mathbb{N}$.
If exists prove:
$a)$ $a(k)\geq a(k-1)$
$b)$ Does not exist positive integer $k$ such that $a(k-1)=a(k)=a(k+1)$.
An open necklace can contain rubies, emeralds, and sapphires. At every step we can perform any of the following operations:
[list=1]
[*]We can replace two consecutive rubies with an emerald and a sapphire, where the emerald is on the left of the sapphire.[/*]
[*]We can replace three consecutive emeralds with a sapphire and a ruby, where the sapphire is on the left of the ruby. [/*]
[*]If we find two consecutive sapphires then we can remove them.[/*]
[*]If we find consecutively and in this order a ruby, an emerald, and a sapphire, then we can remove them.[/*]
[/list]
Furthermore we can also reverse all of the above operations. For example by reversing 3. we can put two consecutive sapphires on any position we wish.
Initially the necklace has one sapphire (and no other precious stones). Decide, with proof, whether there is a finite sequence of steps such that at the end of this sequence the necklace contains one emerald (and no other precious stones).
[i]Remark:[/i] A necklace is open if its precious stones are on a line from left to right. We are not allowed to move a precious stone from the rightmost position to the leftmost as we would be able to do if the necklace was closed.
[i]Proposed by Demetres Christofides, Cyprus[/i]
The natural numbers are written in sequence, in increasing order, and by this we get an infinite sequence of digits. Find the least natural $k$, for which among the first $k$ digits of this sequence, any two nonzero digits have been written a different number of times.
[i]Aleksandar Ivanov, Emil Kolev [/i]
The plane is divided into a net of equilateral triangles of side length $1$, with disjoint interiors. A checker is placed initialy inside a triangle. The checker can be moved into another triangle sharing a common vertex (with the triangle hosting the checker) and having the opposite sides (with respect to this vertex) parallel. A path consists in a finite sequence of moves. Prove that there is no path between two triangles sharing a common side.
[u]Round 1[/u]
[b]p1.[/b] A positive integer is said to be transcendent if it leaves a remainder of $1$ when divided by $2$. Find the $1010$th smallest positive integer that is transcendent.
[b]p2.[/b] The two diagonals of a square are drawn, forming four triangles. Determine, in degrees, the sum of the interior angle measures in all four triangles.
[b]p3.[/b] Janabel multiplied $2$ two-digit numbers together and the result was a four digit number. If the thousands digit was nine and hundreds digit was seven, what was the tens digit?
[u]Round 2[/u]
[b]p4.[/b] Two friends, Arthur and Brandon, are comparing their ages. Arthur notes that $10$ years ago, his age was a third of Brandon’s current age. Brandon points out that in $12$ years, his age will be double of Arthur’s current age. How old is Arthur now?
[b]p5.[/b] A farmer makes the observation that gathering his chickens into groups of $2$ leaves $1$ chicken left over, groups of $3$ leaves $2$ chickens left over, and groups of $5$ leaves $4$ chickens left over. Find the smallest possible number of chickens that the farmer could have.
[b]p6.[/b] Charles has a bookshelf with $3$ layers and $10$ indistinguishable books to arrange. If each layer must hold less books than the layer below it and a layer cannot be empty, how many ways are there for Charles to arrange his $10$ books?
[u]Round 3[/u]
[b]p7.[/b] Determine the number of factors of $2^{2019}$.
[b]p8.[/b] The points $A$, $B$, $C$, and $D$ lie along a line in that order. It is given that $\overline{AB} : \overline{CD} = 1 : 7$ and $\overline{AC} : \overline{BD} = 2 : 5$. If $BC = 3$, find $AD$.
[b]p9.[/b] A positive integer $n$ is equal to one-third the sum of the first $n$ positive integers. Find $n$.
[u]Round 4[/u]
[b]p10.[/b] Let the numbers $a,b,c$, and $d$ be in arithmetic progression. If $a +2b +3c +4d = 5$ and $a =\frac12$ , find $a +b +c +d$.
[b]p11.[/b] Ten people playing brawl stars are split into five duos of $2$. Determine the probability that Jeff and Ephramare paired up.
[b]p12.[/b] Define a sequence recursively by $F_0 = 0$, $F_1 = 1$, and for all $n\ge 2$, $$F_n = \left \lceil
\frac{F_{n-1}+F_{n-2}}{2} \right \rceil +1,$$ where $\lceil r \rceil$ denotes the least integer greater than or equal to $r$ . Find $F_{2019}$.
PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h3166019p28809679]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3166115p28810631]here[/url].Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Define a sequence by $a_1=1,a_2=\frac12$, and $a_{n+2}=a_{n+1}-\frac{a_na_{n+1}}2$ for $n$ a positive integer. Find $\lim_{n\to\infty}na_n$.
Define sequence $ (a_n)$ by $ \sum_{d|n} a_d \equal{} 2^n.$ Show that $ n|a_n.$
Prove that numbers $1,2,...,16$ can be divided in sequence such that sum of any two neighboring numbers is perfect square
Let $A, B$ be two variable points on a parabola $P_{0}$, such that the tangents at $A$ and $B$ are perpendicular to each other. Show that the locus of the centroid of the triangle formed by $A,B$ and the vertex of $P_0$ is a parabola $P_1 .$ Apply the same process to $P_1$ and repeat the process, obtaining the sequence of parabolas $P_1, P_2 , \ldots, P_n$. If the equation of $P_0$ is $y=m x^2$, find the equation of $P_n .$
Francisco wrote a sequence of numbers starting with $25$. From the fourth term of the sequence onwards, each term of the sequence is the average of the previous three. Given that the first six terms of the sequence are natural numbers and that the sixth number written was $8$, what is the fifth term of the sequence?
Let $(a_n)_{n\geq 1}$ be a monotone decreasing sequence of real numbers that converges to $0$. Prove that $\sum_{n=1}^{\infty}\frac{a_n}{n}$ is convergent if and only if the sequence $(a_n\ln n)_{n\geq 1}$ is bounded and $\sum_{n=1}^{\infty} (a_n-a_{n+1})\ln n$ is convergent.
The sequence $ (a_{n})_{n\geq 1}$ is defined by $ a_{1} \equal{} 1, a_{2} \equal{} 3$, and $ a_{n \plus{} 2} \equal{} (n \plus{} 3)a_{n \plus{} 1} \minus{} (n \plus{} 2)a_{n}, \forall n \in \mathbb{N}$. Find all values of $ n$ for which $ a_{n}$ is divisible by $ 11$.
The sequence of natural numbers $1, 5, 6, 25, 26, 30, 31,...$ is made up of powers of $5$ with natural exponents or sums of powers of $5$ with different natural exponents, written in ascending order. Determine the term of the string written in position $167$.
Let $n$ be a positive integer. We start with $n$ piles of pebbles, each initially containing a single pebble. One can perform moves of the following form: choose two piles, take an equal number of pebbles from each pile and form a new pile out of these pebbles. Find (in terms of $n$) the smallest number of nonempty piles that one can obtain by performing a finite sequence of moves of this form.
There exists a unique strictly increasing arithmetic sequence $\{a_i\}_{i=1}^{100}$ of positive integers such that \[a_1+a_4+a_9+\cdots+a_{100}=\text{1000},\] where the summation runs over all terms of the form $a_{i^2}$ for $1\leq i\leq 10$. Find $a_{50}$.
[i]Proposed by David Altizio and Tony Kim[/i]
[b]R[/b]thea, a distant planet, is home to creatures whose DNA consists of two (distinguishable) strands of bases with a fixed orientation. Each base is one of the letters H, M, N, T, and each strand consists of a sequence of five bases, thus forming five pairs. Due to the chemical properties of the bases, each pair must consist of distinct bases. Also, the bases H and M cannot appear next to each other on the same strand; the same is true for N and T. How many possible DNA sequences are there on Rthea?
Let $a_n, b_n$ be sequences of positive reals such that,$$a_{n+1}= a_n + \frac{1}{2b_n}$$ $$b_{n+1}= b_n + \frac{1}{2a_n}$$ for all $n\in\mathbb N$.
Prove that, $\text{max}\left(a_{2018}, b_{2018}\right) >44$.
Every member of a given sequence, beginning with the second , is equal to the sum of the preceding one and the sum of its digits . The first member equals $1$ . Is there, among the members of this sequence, a number equal to $123456$ ?
(S. Fomin , Leningrad)
Shirley has a magical machine. If she inputs a positive even integer $n$, the machine will output $n/2$, but if she inputs a positive odd integer $m$, the machine will output $m+3$. The machine keeps going by automatically using its output as a new input, stopping immediately before it obtains a number already processed. Shirley wants to create the longest possible output sequence possible with initial input at most $100$. What number should she input?