Found problems: 5923
For $2k$ real numbers $a_1, a_2, ..., a_k$, $b_1, b_2, ..., b_k$ define a sequence of numbers $X_n$ by \[
X_n = \sum_{i=1}^k [a_in + b_i] \quad (n=1,2,...).
\] If the sequence $X_N$ forms an arithmetic progression, show that $\textstyle\sum_{i=1}^k a_i$ must be an integer. Here $[r]$ denotes the greatest integer less than or equal to $r$.
Lines in the xy-plane are drawn through the point $(3,4)$ and the trisection points of the line segment joining the points $(-4,5)$ and $(5,-1).$ One of these lines has the equation
$\textbf{(A) }3x-2y-1=0\qquad\textbf{(B) }4x-5y+8=0\qquad\textbf{(C) }5x+2y-23=0\qquad$
$\textbf{(D) }x+7y-31=0\qquad \textbf{(E) }x-4y+13=0$
A sequence $(x_n)_{n\ge 0}$ is defined as follows: $x_0=a,x_1=2$ and $x_n=2x_{n-1}x_{n-2}-x_{n-1}-x_{n-2}+1$ for all $n>1$. Find all integers $a$ such that $2x_{3n}-1$ is a perfect square for all $n\ge 1$.
Define a sequence $\{a_n\}_{n \geq 1}$ recursively by $a_1=1$, $a_2=2$, and for all integers $n \geq 2$, $a_{n+1}=(n+1)^{a_n}$. Determine the number of integers $k$ between $2$ and $2020$, inclusive, such that $k+1$ divides $a_k - 1$.
[i]Proposed by Taiki Aiba[/i]
Consider a $m\times n$ rectangular board consisting of $mn$ unit squares. Two of its unit squares are called [i]adjacent[/i] if they have a common edge, and a [i]path[/i] is a sequence of unit squares in which any two consecutive squares are adjacent. Two parths are called [i]non-intersecting[/i] if they don't share any common squares.
Each unit square of the rectangular board can be colored black or white. We speak of a [i]coloring[/i] of the board if all its $mn$ unit squares are colored.
Let $N$ be the number of colorings of the board such that there exists at least one black path from the left edge of the board to its right edge. Let $M$ be the number of colorings of the board for which there exist at least two non-intersecting black paths from the left edge of the board to its right edge.
Prove that $N^{2}\geq M\cdot 2^{mn}$.
Let $a$ be a positive integer. The sequence $\{x_n\}_{n\geq 1}$ is defined by $x_1=1$, $x_2=a$ and $x_{n+2} = ax_{n+1} + x_n$ for all $n\geq 1$. Prove that $(y,x)$ is a solution of the equation \[ |y^2 - axy - x^2 | = 1 \] if and only if there exists a rank $k$ such that $(y,x)=(x_{k+1},x_k)$.
[i]Serban Buzeteanu[/i]
Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties:
[list=disc]
[*]every term in the sequence is less than or equal to $2^{2023}$, and
[*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\]
[/list]
Let $n$ be a natural number. We define sequences $\langle a_i\rangle$ and $\langle b_i\rangle$ of integers as follows. We let $a_0=1$ and $b_0=n$. For $i>0$, we let $$\left( a_i,b_i\right)=\begin{cases} \left(2a_{i-1}+1,b_{i-1}-a_{i-1}-1\right) & \text{if } a_{i-1}<b_{i-1},\\
\left( a_{i-1}-b_{i-1}-1,2b_{i-1}+1\right) & \text{if } a_{i-1}>b_{i-1},\\
\left(a_{i-1},b_{i-1}\right) & \text{if } a_{i-1}=b_{i-1}.\end{cases}$$
Given that $a_k=b_k$ for some natural number $k$, prove that $n+3$ is a power of two.
Choose positive integers $b_1, b_2, \dotsc$ satisfying
\[1=\frac{b_1}{1^2} > \frac{b_2}{2^2} > \frac{b_3}{3^2} > \frac{b_4}{4^2} > \dotsb\]
and let $r$ denote the largest real number satisfying $\tfrac{b_n}{n^2} \geq r$ for all positive integers $n$. What are the possible values of $r$ across all possible choices of the sequence $(b_n)$?
[i]Carl Schildkraut and Milan Haiman[/i]
Prove that there do not exist eleven primes, all less than $20000$, which form an arithmetic progression.
Given a positive integer $k$ show that there exists a prime $p$ such that one can choose distinct integers $a_1,a_2\cdots, a_{k+3} \in \{1, 2, \cdots ,p-1\}$ such that p divides $a_ia_{i+1}a_{i+2}a_{i+3}-i$ for all $i= 1, 2, \cdots, k$.
[i]South Africa [/i]
Does there exist an increasing sequence of positive integers $a_1 , a_2 ,\cdots$ with the following two properties?
(i) Every positive integer $n$ can be uniquely expressed in the form $n = a_j - a_i$ ,
(ii) $\frac{a_k}{k^3}$ is bounded.
In the given sequence $1,4,8,10,16,19,21,25,30,43$, sum of a few adjacent numbers in the sequence is a multiple of $11$. The number of such number sets is________.
Let $k$ be a given positive integer. The sequence $x_n$ is defined as follows: $x_1 =1$ and $x_{n+1}$ is the least positive integer which is not in $\{x_{1}, x_{2},..., x_{n}, x_{1}+k, x_{2}+2k,..., x_{n}+nk \}$. Show that there exist real number $a$ such that $x_n = \lfloor an\rfloor$ for all positive integer $n$.
[b]p1.[/b] David is taking a $50$-question test, and he needs to answer at least $70\%$ of the questions correctly in order to pass the test. What is the minimum number of questions he must answer correctly in order to pass the test?
[b]p2.[/b] You decide to flip a coin some number of times, and record each of the results. You stop flipping the coin once you have recorded either $20$ heads, or $16$ tails. What is the maximum number of times that you could have flipped the coin?
[b]p3.[/b] The width of a rectangle is half of its length. Its area is $98$ square meters. What is the length of the rectangle, in meters?
[b]p4.[/b] Carol is twice as old as her younger brother, and Carol's mother is $4$ times as old as Carol is. The total age of all three of them is $55$. How old is Carol's mother?
[b]p5.[/b] What is the sum of all two-digit multiples of $9$?
[b]p6.[/b] The number $2016$ is divisible by its last two digits, meaning that $2016$ is divisible by $16$. What is the smallest integer larger than $2016$ that is also divisible by its last two digits?
[b]p7.[/b] Let $Q$ and $R$ both be squares whose perimeters add to $80$. The area of $Q$ to the area of $R$ is in a ratio of $16 : 1$. Find the side length of $Q$.
[b]p8.[/b] How many $8$-digit positive integers have the property that the digits are strictly increasing from left to right? For instance, $12356789$ is an example of such a number, while $12337889$ is not.
[b]p9.[/b] During a game, Steve Korry attempts $20$ free throws, making 16 of them. How many more free throws does he have to attempt to finish the game with $84\%$ accuracy, assuming he makes them all?
[b]p10.[/b] How many di erent ways are there to arrange the letters $MILKTEA$ such that $TEA$ is a contiguous substring?
For reference, the term "contiguous substring" means that the letters $TEA$ appear in that order, all next to one another. For example, $MITEALK$ would be such a string, while $TMIELKA$ would not be.
[b]p11.[/b] Suppose you roll two fair $20$-sided dice. What is the probability that their sum is divisible by $10$?
[b]p12.[/b] Suppose that two of the three sides of an acute triangle have lengths $20$ and $16$, respectively. How many possible integer values are there for the length of the third side?
[b]p13.[/b] Suppose that between Beijing and Shanghai, an airplane travels $500$ miles per hour, while a train travels at $300$ miles per hour. You must leave for the airport $2$ hours before your flight, and must leave for the train station $30$ minutes before your train. Suppose that the two methods of transportation will take the same amount of time in total. What is the distance, in miles, between the two cities?
[b]p14.[/b] How many nondegenerate triangles (triangles where the three vertices are not collinear) with integer side lengths have a perimeter of $16$? Two triangles are considered distinct if they are not congruent.
[b]p15.[/b] John can drive $100$ miles per hour on a paved road and $30$ miles per hour on a gravel road. If it takes John $100$ minutes to drive a road that is $100$ miles long, what fraction of the time does John spend on the paved road?
[b]p16.[/b] Alice rolls one pair of $6$-sided dice, and Bob rolls another pair of $6$-sided dice. What is the probability that at least one of Alice's dice shows the same number as at least one of Bob's dice?
[b]p17.[/b] When $20^{16}$ is divided by $16^{20}$ and expressed in decimal form, what is the number of digits to the right of the decimal point? Trailing zeroes should not be included.
[b]p18.[/b] Suppose you have a $20 \times 16$ bar of chocolate squares. You want to break the bar into smaller chunks, so that after some sequence of breaks, no piece has an area of more than $5$. What is the minimum possible number of times that you must break the bar?
For an example of how breaking the chocolate works, suppose we have a $2\times 2$ bar and wish to break it entirely into $1\times 1$ bars. We can break it once to get two $2\times 1$ bars. Then, we would have to break each of these individual bars in half in order to get all the bars to be size $1\times 1$, and we end up using $3$ breaks in total.
[b]p19.[/b] A class of $10$ students decides to form two distinguishable committees, each with $3$ students. In how many ways can they do this, if the two committees can have no more than one student in common?
[b]p20.[/b] You have been told that you are allowed to draw a convex polygon in the Cartesian plane, with the requirements that each of the vertices has integer coordinates whose values range from $0$ to $10$ inclusive, and that no pair of vertices can share the same $x$ or $y$ coordinate value (so for example, you could not use both $(1, 2)$ and $(1, 4)$ in your polygon, but $(1, 2)$ and $(2, 1)$ is fine). What is the largest possible area that your polygon can have?
PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $a_1, a_2,\cdots , a_n$ and $b_1, b_2,\cdots , b_n$ be (not necessarily distinct) positive integers. We continue the sequences as follows: For every $i>n$, $a_i$ is the smallest positive integer which is not among $b_1, b_2,\cdots , b_{i-1}$, and $b_i$ is the smallest positive integer which is not among $a_1, a_2,\cdots , a_{i-1}$. Prove that there exists $N$ such that for every $i>N$ we have $a_i=b_i$ or for every $i>N$ we have $a_{i+1}=a_i$.
The sequence $a_1, a_2, a_3, ...$ is defined by $a_1 = a_2 = a_3 = 1$, $a_{n+3} = a_{n+2}a_{n+1} + a_n$. Show that for any positive integer $r$ we can find $s$ such that $a_s$ is a multiple of $r$.
Minivan and Megavan play a game. For a positive integer $n$, Minivan selects a sequence of integers $a_1,a_2,\ldots,a_n$. An operation on $a_1,a_2,\ldots,a_n$ means selecting an $a_i$ and increasing it by $1$. Minivan and Megavan take turns, with Minivan going first. On Minivan's turn, he performs at most $2025$ operations, and he may choose the same integer repeatedly. On Megavan's turn, he performs exactly $1$ operation instead. Megavan wins if at any point in the game, including in the middle of Minivan's operations, two numbers in the sequence are equal.
[i](Proposed by Ho Janson)[/i]
Let $(x_n)_{n \in \mathbb{N}}$ be the sequence defined as $x_n = \sin(2 \pi n! e)$ for all $n \in \mathbb{N}$. Compute $\lim_{n \to \infty} x_n$.
Consider the set $A_n=\{x_1,x_2,\ldots,x_n,y_1,y_2,\ldots,y_n\}$ of $2n$ variables. How many permutations of set $A_n$ are there for which it is possible to assign real values from the interval $(0,1)$ to the $2n$ variables so that:
(i) $x_i+y_i=1$ for each $i$;
(ii) $x_1<x_2<\ldots<x_n$;
(iii) the $2n$ terms of the permutation form a strictly increasing sequence?
Define a sequence $(a_n)$ by $a_0 =0$ and $a_n = 1 +\sin(a_{n-1}-1)$ for $n\geq 1$. Evaluate
$$\lim_{n\to \infty} \frac{1}{n} \sum_{k=1}^{n} a_k.$$
Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$.
Prove that Sisyphus cannot reach the aim in less than
\[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \]
turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )
Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$.
[i]Proposed by Jaroslaw Wroblewski, Poland[/i]
A serpentine is a sequence of points $P_1 , ..., P_m$ in a plane, not necessarily all different, such that the distance between $P_i$ and $P_{i+1}$ is at least 1, and the segments $P_i P_{i +1}$ are alternately horizontal and vertical. Construct a compact set in which there is a sequence of serpentines with arbitrary long lengths but there is no closed serpentine ($P_m = P_i$ for some i < m).
Let $a_0,a_1,a_2,...$ be an infinite sequence of positive integers such that $a_0 = 1$ and $a_i^2 > a_{i-1}a_{i+1}$ for all $i > 0$.
(a) Prove that $a_i < a_1^i$ for all $i > 1$.
(b) Prove that $a_i > i$ for all $i$.