This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 5923

Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.
A $\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and $$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$
Find all positive values of $a$, for which there is a number $b$ such that the parabola $y=ax^2-b$ intersects the unit circle at four distinct points. Also prove that for every such a there exists $b$ such that the parabola $y=ax^2-b$ intersects the unit circle at four distinct points whose $x$-coordinates form an arithmetic progression.
Let $0<k<1$ be a given real number and let $(a_n)_{n\ge1}$ be an infinite sequence of real numbers which satisfies $a_{n+1}\le\left(1+\frac kn\right)a_n-1$. Prove that there is an index $t$ such that $a_t<0$.
Let $a_0 < a_1 < a_2 < \dots$ be an infinite sequence of positive integers. Prove that there exists a unique integer $n\geq 1$ such that \[a_n < \frac{a_0+a_1+a_2+\cdots+a_n}{n} \leq a_{n+1}.\] [i]Proposed by Gerhard Wöginger, Austria.[/i]
For a function $ f(x)\equal{}\int_x^{\frac{\pi}{4}\minus{}x} \log_4 (1\plus{}\tan t)dt\ \left(0\leq x\leq \frac{\pi}{8}\right)$, answer the following questions. (1) Find $ f'(x)$. (2) Find the $ n$ th term of the sequence $ a_n$ such that $ a_1\equal{}f(0),\ a_{n\plus{}1}\equal{}f(a_n)\ (n\equal{}1,\ 2,\ 3,\ \cdots)$.
A sequence $x_1, x_2, \ldots$ is defined by $x_1 = 1$ and $x_{2k}=-x_k, x_{2k-1} = (-1)^{k+1}x_k$ for all $k \geq 1.$ Prove that $\forall n \geq 1$ $x_1 + x_2 + \ldots + x_n \geq 0.$ [i]Proposed by Gerhard Wöginger, Austria[/i]
The equation $x^2 + bx + c = 0$ has two different roots $x_1$ and $x_2$. It is also known that the numbers $b$, $x_1$, $c$, $x_2$ in the indicated order form an arithmetic progression. Find the difference of this progression.
Let $({{A}_{n}})_{n=1}^{\infty }$ and $({{a}_{n}})_{n=1}^{\infty }$ be sequences of positive integers. Assume that for each positive integer $x$, there is a unique positive integer $N$ and a unique $N-tuple$ $({{x}_{1}},...,{{x}_{N}})$ such that $0\le {{x}_{k}}\le {{a}_{k}}$ for $k=1,2,...N$, ${{x}_{N}}\ne 0$, and $x=\sum\limits_{k=1}^{N}{{{A}_{k}}{{x}_{k}}}$. (a) Prove that ${{A}_{k}}=1$ for some $k$; (b) Prove that ${{A}_{k}}={{A}_{j}}\Leftrightarrow k=j$; (c) Prove that if ${{A}_{k}}\le {{A}_{j}}$, then $\left. {{A}_{k}} \right|{{A}_{j}}$.
[b]p1.[/b] How many lines of symmetry does a square have? [b]p2.[/b] Compute$ 1/2 + 1/6 + 1/12 + 1/4$. [b]p3.[/b] What is the maximum possible area of a rectangle with integer side lengths and perimeter $8$? [b]p4.[/b] Given that $1$ printer weighs $400000$ pennies, and $80$ pennies weighs $2$ books, what is the weight of a printer expressed in books? [b]p5.[/b] Given that two sides of a triangle are $28$ and $3$ and all three sides are integers, what is the sum of the possible lengths of the remaining side? [b]p6.[/b] What is half the sum of all positive integers between $1$ and $15$, inclusive, that have an even number of positive divisors? [b]p7.[/b] Austin the Snowman has a very big brain. His head has radius $3$, and the volume of his torso is one third of his head, and the volume of his legs combined is one third of his torso. If Austin's total volume is $a\pi$ where $a$ is an integer, what is $a$? [b]p8.[/b] Neethine the Kiwi says that she is the eye of the tiger, a fighter, and that everyone is gonna hear her roar. She is standing at point $(3, 3)$. Neeton the Cat is standing at $(11,18)$, the farthest he can stand from Neethine such that he can still hear her roar. Let the total area of the region that Neeton can stand in where he can hear Neethine's roar be $a\pi$ where $a$ is an integer. What is $a$? [b]p9.[/b] Consider $2018$ identical kiwis. These are to be divided between $5$ people, such that the first person gets $a_1$ kiwis, the second gets $a_2$ kiwis, and so forth, with $a_1 \le a_2 \le a_3 \le a_4 \le a_5$. How many tuples $(a_1, a_2, a_3, a_4, a_5)$ can be chosen such that they form an arithmetic sequence? [b]p10.[/b] On the standard $12$ hour clock, each number from $1$ to $12$ is replaced by the sum of its divisors. On this new clock, what is the number of degrees in the measure of the non-reflex angle between the hands of the clock at the time when the hour hand is between $7$ and $6$ while the minute hand is pointing at $15$? [b]p11.[/b] In equiangular hexagon $ABCDEF$, $AB = 7$, $BC = 3$, $CD = 8$, and $DE = 5$. The area of the hexagon is in the form $\frac{a\sqrt{b}}{c}$ with $b$ square free and $a$ and $c$ relatively prime. Find $a+b+c$ where $a, b,$ and $c$ are integers. [b]p12.[/b] Let $\frac{p}{q} = \frac15 + \frac{2}{5^2} + \frac{3}{5^3} + ...$ . Find $p + q$, where $p$ and $q$ are relatively prime positive integers. [b]p13.[/b] Two circles $F$ and $G$ with radius $10$ and $4$ respectively are externally tangent. A square $ABMC$ is inscribed in circle $F$ and equilateral triangle $MOP$ is inscribed in circle $G$ (they share vertex $M$). If the area of pentagon $ABOPC$ is equal to $a + b\sqrt{c}$, where $a$, $b$, $c$ are integers $c$ is square free, then find $a + b + c$. [b]p14.[/b] Consider the polynomial $P(x) = x^3 + 3x^2 + ax + 8$. Find the sum of all integer $a$ such that the sum of the squares of the roots of $P(x)$ divides the sum of the coecients of $P(x)$. [b]p15.[/b] Nithin and Antonio play a number game. At the beginning of the game, Nithin picks a prime $p$ that is less than $100$. Antonio then tries to find an integer $n$ such that $n^6 + 2n^5 + 2n^4 + n^3 + (n^2 + n + 1)^2$ is a multiple of $p$. If Antonio can find such a number n, then he wins, otherwise, he loses. Nithin doesn't know what he is doing, and he always picks his prime randomly while Antonio always plays optimally. The probability of Antonio winning is $a/b$ where $a$ and $b$ are relatively prime positive integers. Find$a + b$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $ F:\mathbb{R}\longrightarrow\mathbb{R} $ be a primitive with $ F(0)=0 $ of the function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ defined by $ f(x)=\frac{x}{1+e^x} , $ and let be a sequence $ \left( x_n \right)_{n\ge 0} $ such that $ x_0>0 $ and defined as $ x_n=F\left( x_{n-1} \right) . $ Calculate $ \lim_{n\to\infty } \frac{1}{n}\sum_{k=1}^n \frac{x_k}{\sqrt{x_{k+1}}} $ [i]Florian Dumitrel[/i]
Consider a sequence of real numbers defined by: \begin{align*} x_{1} & = c \\ x_{n+1} & = cx_{n} + \sqrt{c^{2} - 1}\sqrt{x_{n}^{2} - 1} \quad \text{for all } n \geq 1. \end{align*} Show that if $c$ is a positive integer, then $x_{n}$ is an integer for all $n \geq 1$. [i](South Africa)[/i]
Determine the number of sequences of positive integers $1 = x_0 < x_1 < \dots < x_{10} = 10^{5}$ with the property that for each $m=0,\dots,9$ the number $\tfrac{x_{m+1}}{x_m}$ is a prime number. [i]Proposed by Evan Chen[/i]
Let $\{a_n\}$ be a bounded real sequence. (a) Prove that if X is a positive-measure subset of $\mathbb R$, then for almost all $x\in X$, there exist a subsequence $\{y_n\}$ of X such that $$\sum_{n=1}^\infty (n(y_n-x)-a_n)=1$$ (b) construct an unbounded sequence $\{a_n\}$ for which the above equation is also true.
Given a sequence of real numbers, a move consists of choosing two terms and replacing each with their arithmetic mean. Show that there exists a sequence of 2015 distinct real numbers such that after one initial move is applied to the sequence -- no matter what move -- there is always a way to continue with a finite sequence of moves so as to obtain in the end a constant sequence.
Show that if $ \left( s_n \right)_{n\ge 0} $ is a sequence that tends to $ 6, $ then, the sequence $$ \left( \sqrt[3]{s_n+\sqrt[3]{s_{n-1}+\sqrt[3]{s_{n-2}+\sqrt[3]{\cdots +\sqrt[3]{s_0}}}}} \right)_{n\ge 0} $$ tends to $ 2. $ [i]Mihai Bălună[/i]
For positive integers $ n$, $ f_n \equal{} \lfloor2^n\sqrt {2008}\rfloor \plus{} \lfloor2^n\sqrt {2009}\rfloor$. Prove there are infinitely many odd numbers and infinitely many even numbers in the sequence $ f_1,f_2,\ldots$.
The sequence $\left(a_{n}\right)_{n\in\mathbb{N}}$ is defined recursively as $a_{0}=a_{1}=1$, $a_{n+2}=5a_{n+1}-a_{n}-1$, $\forall n\in\mathbb{N}$ Prove that $$a_{n}\mid a_{n+1}^{2}+a_{n+1}+1$$ for any $n\in\mathbb{N}$
Two non-decreasing sequences of nonnegative integers have different first terms. Each sequence has the property that each term beginning with the third is the sum of the previous two terms, and the seventh term of each sequence is $N$. What is the smallest possible value of $N$? ${ \textbf{(A)}\ 55\qquad\textbf{(B)}\ 89\qquad\textbf{(C)}\ 104\qquad\textbf{(D}}\ 144\qquad\textbf{(E)}\ 273 $
Let $m,n$ and $a_1,a_2,\dots,a_m$ be arbitrary positive integers. Ali and Mohammad Play the following game. At each step, Ali chooses $b_1,b_2,\dots,b_m \in \mathbb{N}$ and then Mohammad chosses a positive integers $s$ and obtains a new sequence $\{c_i=a_i+b_{i+s}\}_{i=1}^m$, where $$b_{m+1}=b_1,\ b_{m+2}=b_2, \dots,\ b_{m+s}=b_s$$ The goal of Ali is to make all the numbers divisible by $n$ in a finite number of steps. FInd all positive integers $m$ and $n$ such that Ali has a winning strategy, no matter how the initial values $a_1, a_2,\dots,a_m$ are. [hide=clarification] after we create the $c_i$ s, this sequence becomes the sequence that we continue playing on, as in it is our 'new' $a_i$[/hide] Proposed by Shayan Gholami
Consider the sequence $$1,7,8,49,50,56,57,343\ldots$$ which consists of sums of distinct powers of$7$, that is, $7^0$, $7^1$, $7^0+7^1$, $7^2$,$\ldots$ in increasing order. At what position will $16856$ occur in this sequence?
The sequence of functions $f_0,f_1,f_2,...$ is given by the conditions: $f_0(x) = |x|$ for all $x \in R$ $f_{n+1}(x) = |f_n(x)-2|$ for $n=0,1,2,...$ and all $x \in R$. For each positive integer $n$, solve the equation $f_n(x)=1$.
Given a finite sequence with terms in the set $A=\{0,1,…,121\}$ , it is allowed to replace each term by a number from the set $A$ so that like terms are replaced by like numbers, and different terms by different numbers. (Terms may remain without replacement.) The objective is to obtain, from a given sequence, through several such changes, a new sequence with sum divisible by $121$ . Show that it is possible to achieve the objective for every initial sequence. [hide=original wording]Dada una secuencia finita con términos en el conjunto A={0,1,…,121} , está permitido reemplazar cada término por un número del conjunto A de modo que términos iguales se reemplacen por números iguales, y términos distintos por números distintos. (Pueden quedar términos sin reemplazar.) El objetivo es obtener, a partir de una sucesión dada, mediante varios de tales cambios, una nueva sucesión con suma divisible por 121 . Demostrar que es posible lograr el objetivo para toda sucesión inicial.[/hide]
Let $0<f(1)<f(2)<f(3)<\ldots$ a sequence with all its terms positive$.$ The $n-th$ positive integer which doesn't belong to the sequence is $f(f(n))+1.$ Find $f(240).$
Prove that for three arbitrary infinite sequences, of natural numbers $a_1,a_2,...,a_n,... $ , $b_1,b_2,...,b_n,... $, $c_1,c_2,...,c_n,...$ there exist numbers $p$ and $q$ such, that $a_p \ge a_q$, $b_p \ge b_q$ and $c_p \ge c_q$.