Found problems: 5802
In an in finite sequence $a_1, a_2, a_3, \cdots$, the number $a_1$ equals $1$, and each $a_n, n > 1$, is obtained from $a_{n-1}$ as follows:
[list]- if the greatest odd divisor of $n$ has residue $1$ modulo $4$, then $a_n = a_{n-1} + 1,$
- and if this residue equals $3$, then $a_n = a_{n-1} - 1.$[/list]
Prove that in this sequence
[b](a) [/b] the number $1$ occurs infi nitely many times;
[b](b)[/b] each positive integer occurs infi nitely many times.
(The initial terms of this sequence are $1, 2, 1, 2, 3, 2, 1, 2, 3, 4, 3, \cdots$ )
Let $S$ be a set of $n$ points in the coordinate plane. Say that a pair of points is [i]aligned[/i] if the two points have the same $x$-coordinate or $y$-coordinate. Prove that $S$ can be partitioned into disjoint subsets such that (a) each of these subsets is a collinear set of points, and (b) at most $n^{3/2}$ unordered pairs of distinct points in $S$ are aligned but not in the same subset.
Let $ n$ be an even number, and $ S$ be the set of all arrays of length $ n$ whose elements are from the set $ \left\{0,1\right\}$. Prove that $ S$ can be partitioned into disjoint three-element subsets such that for each three arrays $ \left(a_i\right)_{i \equal{} 1}^n$, $ \left(b_i\right)_{i \equal{} 1}^n$, $ \left(c_i\right)_{i \equal{} 1}^n$ which belong to the same subset and for each $ i\in\left\{1,2,...,n\right\}$, the number $ a_i \plus{} b_i \plus{} c_i$ is divisible by $ 2$.
The sequence $ (x_n)$ is defined as; $ x_1\equal{}a$, $ x_2\equal{}b$ and for all positive integer $ n$, $ x_{n\plus{}2}\equal{}2008x_{n\plus{}1}\minus{}x_n$. Prove that there are some positive integers $ a,b$ such that $ 1\plus{}2006x_{n\plus{}1}x_n$ is a perfect square for all positive integer $ n$.
We say that a function $f: \mathbb{Z}_{\ge 0} \times \mathbb{Z}_{\ge 0} \to \mathbb{Z}$ is [i]great[/i] if for any nonnegative integers $m$ and $n$,
\[f(m + 1, n + 1) f(m, n) - f(m + 1, n) f(m, n + 1) = 1.\]
If $A = (a_0, a_1, \dots)$ and $B = (b_0, b_1, \dots)$ are two sequences of integers, we write $A \sim B$ if there exists a great function $f$ satisfying $f(n, 0) = a_n$ and $f(0, n) = b_n$ for every nonnegative integer $n$ (in particular, $a_0 = b_0$).
Prove that if $A$, $B$, $C$, and $D$ are four sequences of integers satisfying $A \sim B$, $B \sim C$, and $C \sim D$, then $D \sim A$.
[i]Ankan Bhattacharya[/i]
Let $X=\{1,2,\dots,n\},$ and let $k\in X.$ Show that there are exactly $k\cdot n^{n-1}$ functions $f:X\to X$ such that for every $x\in X$ there is a $j\ge 0$ such that $f^{(j)}(x)\le k.$
[Here $f^{(j)}$ denotes the $j$th iterate of $f,$ so that $f^{(0)}(x)=x$ and $f^{(j+1)}(x)=f\left(f^{(j)}(x)\right).$]
Let $n\geq 2$ be an integer and let $a_1, a_2, \ldots, a_n$ be positive real numbers with sum $1$. Prove that $$\sum_{k=1}^n \frac{a_k}{1-a_k}(a_1+a_2+\cdots+a_{k-1})^2 < \frac{1}{3}.$$
Let $P(x)$ and $Q(x)$ be two polynomials with integer coefficients, such that no nonconstant polynomial with rational coefficients divides both $P(x)$ and $Q(x).$ Suppose that for every positive integer $n$ the integers $P(n)$ and $Q(n)$ are positive, and $2^{Q(n)}-1$ divides $3^{P(n)}-1.$ Prove that $Q(x)$ is a constant polynomial.
[i]Proposed by Oleksiy Klurman, Ukraine[/i]
Consider functions $\, f: [0,1] \rightarrow \mathbb{R} \,$ which satisfy
(i) $f(x) \geq 0 \,$ for all $\, x \,$ in $\, [0,1],$
(ii) $f(1) = 1,$
(iii) $f(x) + f(y) \leq f(x+y)\,$ whenever $\, x, \, y, \,$ and $\, x + y \,$ are all in $\, [0,1]$.
Find, with proof, the smallest constant $\, c \,$ such that
\[ f(x) \leq cx \]
for every function $\, f \,$ satisfying (i)-(iii) and every $\, x \,$ in $\, [0,1]$.
We consider the real sequence $(x_n)$ defined by $x_0=0, x_1=1$ and $x_{n+2}=3x_{n+1}-2x_n$ for $n=0,1,...$
We define the sequence $(y_n)$ by $y_n=x_n^2+2^{n+2}$ for every non negative integer $n$.
Prove that for every $n>0$, $y_n$ is the square of an odd integer
Find all triples of positive integers $(a,b,p)$ with $a,b$ positive integers and $p$ a prime number such that $2^a+p^b=19^a$
Let a function $f$ satisfy $f(1) = 1$ and $f(1)+ f(2)+...+ f(n) = n^2f(n)$ for all $n \in N$. Determine $f(1995)$.
Determine the highest possible value of:
$$S = a_1a_2a_3 + a_4a_5a_6 +... + a_{2017}a_{2018}a_{2019} + a_{2020}$$
where $(a_1, a_2, a_3,..., a_{2020})$ is a permutation of $(1,2,3,..., 2020)$.
Clarification: In $S$, each term, except the last one, is the multiplication of three numbers.
Let $ a_0$, $ a_1$, $ a_2$, $ \ldots$ be a sequence of positive integers such that the greatest common divisor of any two consecutive terms is greater than the preceding term; in symbols, $ \gcd (a_i, a_{i \plus{} 1}) > a_{i \minus{} 1}$. Prove that $ a_n\ge 2^n$ for all $ n\ge 0$.
[i]Proposed by Morteza Saghafian, Iran[/i]
Call a triple of numbers [b]Nice[/b] if one of them is the average of the other two. Assume that we have $2k+1$ distinct real numbers with $k^2$ [b] Nice[/b] triples. Prove that these numbers can be devided into two arithmetic progressions with equal ratios
Proposed by [i]Morteza Saghafian[/i]
Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define
$$x_{k+1} = \begin{cases}
x_k + d &\text{if } a \text{ does not divide } x_k \\
x_k/a & \text{if } a \text{ divides } x_k
\end{cases}$$
Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.
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}$.
Determine all finite nonempty sets $S$ of positive integers satisfying
\[ {i+j\over (i,j)}\qquad\mbox{is an element of S for all i,j in S}, \]
where $(i,j)$ is the greatest common divisor of $i$ and $j$.
Is it possible to tile an $8\times8$ board with dominoes ($2\times1$ tiles) so that no two dominoes form a $2\times2$ square?
Let $f$ and $g$ be two nonzero polynomials with integer coefficients and $\deg f>\deg g$. Suppose that for infinitely many primes $p$ the polynomial $pf+g$ has a rational root. Prove that $f$ has a rational root.
Let $m$ and $n$ be positive integers. Let $S$ be the set of integer points $(x,y)$ with $1\leq x\leq 2m$ and $1\leq y\leq 2n$. A configuration of $mn$ rectangles is called [i]happy[/i] if each point in $S$ is a vertex of exactly one rectangle, and all rectangles have sides parallel to the coordinate axes. Prove that the number of happy configurations is odd.
[i]Proposed by Serena An and Claire Zhang[/i]
Compute
\[\cot\left(\sum_{n=1}^{23}\cot^{-1}\left(1+\sum_{k=1}^n2k\right)\right).\]
Let $S$ be the set of $10$-tuples of non-negative integers that have sum $2019$. For any tuple in $S$, if one of the numbers in the tuple is $\geq 9$, then we can subtract $9$ from it, and add $1$ to the remaining numbers in the tuple. Call thus one operation. If for $A,B\in S$ we can get from $A$ to $B$ in finitely many operations, then denote $A\rightarrow B$.
(1) Find the smallest integer $k$, such that if the minimum number in $A,B\in S$ respectively are both $\geq k$, then $A\rightarrow B$ implies $B\rightarrow A$.
(2) For the $k$ obtained in (1), how many tuples can we pick from $S$, such that any two of these tuples $A,B$ that are distinct, $A\not\rightarrow B$.
On some planet, there are $2^N$ countries $(N \geq 4).$ Each country has a flag $N$ units wide and one unit high composed of $N$ fields of size $1 \times 1,$ each field being either yellow or blue. No two countries have the same flag. We say that a set of $N$ flags is diverse if these flags can be arranged into an $N \times N$ square so that all $N$ fields on its main diagonal will have the same color. Determine the smallest positive integer $M$ such that among any $M$ distinct flags, there exist $N$ flags forming a diverse set.
[i]Proposed by Tonći Kokan, Croatia[/i]
Determine the smallest natural number $n$ having the following property: For every integer $p, p \geq n$, it is possible to subdivide (partition) a given square into $p$ squares (not necessarily equal).