Found problems: 5923
[b]M[/b]ary has a sequence $m_2,m_3,m_4,...$ , such that for each $b \ge 2$, $m_b$ is the least positive integer m for
which none of the base-$b$ logarithms $log_b(m),log_b(m+1),...,log_b(m+2017)$ are integers. Find the largest number in her sequence.
Let $f(n)$ be the sum of the first $n$ terms of the sequence \[ 0, 1,1, 2,2, 3,3, 4,4, 5,5, 6,6, \ldots\, . \] a) Give a formula for $f(n)$.
b) Prove that $f(s+t)-f(s-t)=st$ where $s$ and $t$ are positive integers and $s>t$.
We have $2022$ $1s$ written on a board in a line. We randomly choose a strictly increasing sequence from ${1, 2, . . . , 2022}$ such that the last term is $2022$. If the chosen sequence is $a_1, a_2, ..., a_k$ ($k$ is not fixed), then at the $i^{th}$ step, we choose the first a$_i$ numbers on the line and change the 1s to 0s and 0s to 1s. After $k$ steps are over, we calculate the sum of the numbers on the board, say $S$. The expected value of $S$ is $\frac{a}{b}$ where $a, b$ are relatively prime positive integers. Find $a + b.$
A mathematical organization is producing a set of commemorative license plates. Each plate contains a sequence of five characters chosen from the four letters in AIME and the four digits in $2007$. No character may appear in a sequence more times than it appears among the four letters in AIME or the four digits in $2007$. A set of plates in which each possible sequence appears exactly once contains $N$ license plates. Find $\frac{N}{10}$.
Let $n>1 \in \mathbb{N}$ and $a_1, a_2, ..., a_n$ be a sequence of $n$ natural integers. Let:
$$b_1 = \left[\frac{a_2 + \cdots + a_n}{n-1}\right], b_i = \left[\frac{a_1 + \cdots + a_{i-1} + a_{i+1} + \cdots + a_n}{n-1}\right], b_n = \left[\frac{a_1 + \cdots + a_{n-1}}{n-1}\right]$$
Define a mapping $f$ by $f(a_1,a_2, \cdots a_n) = (b_1,b_2,\cdots,b_n)$.
a) Let $g: \mathbb{N} \to \mathbb{N}$ be a function such that $g(1)$ is the number of different elements in $f(a_1,a_2, \cdots a_n)$ and $g(m)$ is the number od different elements in $f^m(a_1,a_2, \cdots a_n) = f(f^{m-1}(a_1,a_2, \cdots a_n)); m>1$. Prove that $\exists k_0 \in \mathbb{N}$ s.t. for $m \ge k_0$ the function $g(m)$ is periodic.
b) Prove that $\sum_{m=1}^k \frac{g(m)}{m(m+1)} < C$ for all $k \in \mathbb{N}$, where $C$ is a function that doesn't depend on $k$.
Let $\{f_n\}_{n \ge 0}$ be the Fibonacci sequence, given by $f_0 = f_1 = 1$, and for all positive integers $n$ the recurrence $f_{n+1} = f_n + f_{n-1}$.
Let $a_n = f_{n+1}f_n$ for any non-negative integer $n$, and let $$P_n(X) = X^n + a_{n-1}X^{n-1} + ... + a_1X + a_0.$$
Prove that for all positive integers $n \ge 3$ the polynomial $P_n(X)$ is irreducible in $Z[X]$.
Consider the sequence $a(n)$ defined by the following conditions: $$a(1) = 1\,\,\,\, a(n + 1) = a(n) + [\sqrt{a(n)}] \,\,\, , \,\,\,\, n = 1,2,3,...$$
Prove that the sequence contains an infinite number of perfect squares. (Note: $[x]$ means the integer part of $x$, that is the greatest integer not greater than $x$.)
(A Andjans)
Let $a$, $b$, $n$ be positive integers such that $a + b \leq n^2$. Alice and Bob play a game on an (initially uncoloured) $n\times n$ grid as follows:
- First, Alice paints $a$ cells green.
- Then, Bob paints $b$ other (i.e.uncoloured) cells blue.
Alice wins if she can find a path of non-blue cells starting with the bottom left cell and ending with the top right cell (where a path is a sequence of cells such that any two consecutive ones have a common side), otherwise Bob wins. Determine, in terms of $a$, $b$ and $n$, who has a winning strategy.
Consider a sequence $T_0, T_1, \dots$ of polynomials defined recursively by $T_0(x) = 2$, $T_1(x)=x$, and $T_{n+2}(x) = xT_{n+1}(x) - T_n(x)$ for each nonnegative integer $n$. Let $L_n$ be the sequence of Lucas Numbers, defined by $L_0 = 2$, $L_1 = 1$, and $L_{n+2} = L_n+L_{n+1}$ for every nonnegative integer $n$.
Find the remainder when $ T_0\left( L_0 \right) + T_1 \left( L_2 \right) + T_2 \left( L_4 \right) + \dots + T_{359} \left( L_{718} \right)$ is divided by $359$.
[i]Proposed by Yang Liu[/i]
Define a sequence $(x_{n})_{n\geq 1}$ by taking $x_{1}\in\left\{5,7\right\}$; when $k\ge 1$, $x_{k+1}\in\left\{5^{x_{k}},7^{x_{k}}\right\}$. Determine all possible last two digits of $x_{2009}$.
Let the sequence $(a_n)$ be constructed in the following way:
$$
a_1=1,\mbox{ }a_2=1,\mbox{ }a_{n+2}=a_{n+1}+\frac{1}{a_n},\mbox{ }n=1,2,\ldots.
$$
Prove that $a_{180}>19$.
[i](Folklore)[/i]
It is known that a sequence of positive real numbers \(\left(x_n\right)\) satisfies the relation:
\[
x_{n+1} = x_n + \sqrt{x_n + \frac{1}{4}} + \sqrt{x_{n+1} + \frac{1}{4}}, \quad n \geq 1
\]
Prove that the following inequality holds:
\[
\frac{1}{x_2} + \frac{1}{x_3} + \cdots + \frac{1}{x_{2025}} < \frac{1}{\sqrt{x_1}}
\]
[i]Proposed by Oleksii Masalitin[/i]
[b]p1.[/b] Insert "$+$" signs between some of the digits in the following sequence to obtain correct equality:
$$1\,\,\,\, 2\,\,\,\, 3\,\,\,\, 4\,\,\,\,5\,\,\,\, 6\,\,\,\, 7 = 100$$
[b]p2.[/b] A square is tiled by smaller squares as shown in the figure. Find the area of the black square in the middle if the perimeter of the big square $ABCD$ is $40$ cm.
[img]https://cdn.artofproblemsolving.com/attachments/8/c/d54925cba07f63ec8578048f46e1e730cb8df3.png[/img]
[b]p3.[/b] Jack made $3$ quarts of fruit drink from orange and apple juice. $\frac25$ of his drink is orange juice and the rest is apple juice. Nick prefers more orange juice in the drink. How much orange juice should he add to the drink to obtain a drink composed of $\frac35$ of orange juice?
[b]p4.[/b] A train moving at $55$ miles per hour meets and is passed by a train moving moving in the opposite direction at $35$ miles per hour. A passenger in the first train sees that the second train takes $8$ seconds to pass him. How long is the second train?
[b]p5.[/b] It is easy to arrange $16$ checkers in $10$ rows of $4$ checkers each, but harder to arrange $9$ checkers in $10$ rows of $3$ checkers each. Do both.
[b]p6.[/b] Every human that lived on Earth exchanged some number of handshakes with other humans. Show that the number of people that made an odd number of handshakes is even.
PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Call a positive integer [i]monotonous[/i] if it is a one-digit number or its digits, when read from left to right, form either a strictly increasing or a strictly decreasing sequence. For example, 3, 23578, and 987620 are monotonous, but 88, 7434, and 23557 are not. How many monotonous positive integers are there?
$\textbf{(A)} \text{ 1024} \qquad \textbf{(B)} \text{ 1524} \qquad \textbf{(C)} \text{ 1533} \qquad \textbf{(D)} \text{ 1536} \qquad \textbf{(E)} \text{ 2048}$
Consider a rectangle $ABCD$ with $AB = a$ and $AD = b.$ Let $l$ be a line through $O,$ the center of the rectangle, that cuts $AD$ in $E$ such that $AE/ED = 1/2$. Let $M$ be any point on $l,$ interior to the rectangle.
Find the necessary and sufficient condition on $a$ and $b$ that the four distances from M to lines $AD, AB, DC, BC$ in this order form an arithmetic progression.
Let $x_{1,1}$, $x_{2,1}$, ..., $x_{n,1}$, $n \ge 2$, be a sequence of integers and assume that not all $x_{i,1}$ are equal. For $k \ge 2$, if sequence $\{x_{i,k}\}^n_{i=1}$ is defined, we define sequence $\{x_{i,k+1}\}^n_{i=1}$ as \[x_{i,k+1}=\frac{1}{2}(x_{i,k}+x_{i+1,k}),\] for $i=1, 2, ..., n$, (where $x_{n+1,k}=x_{1,k}$). Show that if $n$ is odd then there exist indices $j$ and $k$ such that $x_{j,k}$ is not an integer.
Source: 2017 Canadian Open Math Challenge, Problem B4
-----
Numbers $a$, $b$ and $c$ form an arithmetic sequence if $b - a = c - b$. Let $a$, $b$, $c$ be positive integers forming an arithmetic sequence with $a < b < c$. Let $f(x) = ax2 + bx + c$. Two distinct real numbers $r$ and $s$ satisfy $f(r) = s$ and $f(s) = r$. If $rs = 2017$, determine the smallest possible value of $a$.
Let $\alpha(n)$ be the number of digits equal to one in the dyadic representation of a positive integer $n$. Prove that [list=a] [*] the inequality $\alpha(n^2 ) \le \frac{1}{2} \alpha(n) (1+\alpha(n))$ holds, [*] equality is attained for infinitely $n\in\mathbb{N}$, [*] there exists a sequence $\{n_i\}$ such that $\lim_{i \to \infty} \frac{ \alpha({n_{i}}^2 )}{ \alpha(n_{i}) } = 0$.[/list]
Let $k \in \mathbb{Z}^+$ and set $n=2^k+1.$ Prove that $n$ is a prime number if and only if the following holds: there is a permutation $a_{1},\ldots,a_{n-1}$ of the numbers $1,2, \ldots, n-1$ and a sequence of integers $g_{1},\ldots,g_{n-1},$ such that $n$ divides $g^{a_i}_i - a_{i+1}$ for every $i \in \{1,2,\ldots,n-1\},$ where we set $a_n = a_1.$
[i]Proposed by Vasily Astakhov, Russia[/i]
The sequence $x_1,x_2, ...$ is defined by the following equations:
$$x_1=19, \ \ x_2=97, \ \ x_{n+2} =x_n - \frac{1}{x_{n+1}}$$
for $n \ge 1$. Prove that there exists a positive integer $k$ such that $x_k=0$ and find $k$.
(A Berzinsh)
Consider a function $f$ on nonnegative integers such that $f(0)=1, f(1)=0$ and $f(n)+f(n-1)=nf(n-1)+(n-1)f(n-2)$ for $n \ge 2$. Show that
\[\frac{f(n)}{n!}=\sum_{k=0}^n \frac{(-1)^k}{k!}\]
A sequence $(a_n)$ of positive integers satisfies$(a_m,a_n) = a_{(m,n)}$ for all $m,n$.
Prove that there is a unique sequence $(b_n)$ of positive integers such that $a_n = \prod_{d|n} b_d$
In the sequence of integers $(a_n)$, the sum $a_m + a_n$ is divided by $m + n$ with any different $m$ and $n$. Prove that $a_n$ is a multiple of $n$ for any $n$.
[list=a]
[*] Let $a<b$ and $f:[a,b]\rightarrow\mathbb{R}$ be a strictly monotonous function such that $\int_a^b f(x) dx=0$. Show that $f(a)\cdot f(b)<0$.
[*] Find all convergent sequences $(a_n)_{n\geq 1}$ for which there exists a scrictly monotonous function $f:\mathbb{R}\rightarrow\mathbb{R}$ such that $$\int_{a_{n-1}}^{a_n} f(x)dx = \int_{a_n}^{a_{n+1}} f(x)dx,\text{ for all }n\geq 2.$$
Let $\{x_n\}^\infty_{n=0}$ be the sequence such that $x_0=2$, $x_1=1$ and $x_{n+2}$ is the remainder of the number $x_{n+1}+x_n$ divided by $7$. Prove that $x_n$ is the remainder of the number
$$4^n\sum_{k=0}^{\left\lfloor\frac n2\right\rfloor}2\binom n{2k}5^k$$