Found problems: 5802
What is the smallest value of \( k \) such that for any polynomial \( f(x) \) of degree $100$ with real coefficients, there exists a polynomial \( g(x) \) of degree at most \( k \) with real coefficients such that the graphs of \( y = f(x) \) and \( y = g(x) \) intersect at exactly $100$ points? \\
Let $a_0,a_1,a_2,\ldots$ be a sequence of integers and $b_0,b_1,b_2,\ldots$ be a sequence of [i]positive[/i] integers such that $a_0=0,a_1=1$, and
\[
a_{n+1} =
\begin{cases}
a_nb_n+a_{n-1} & \text{if $b_{n-1}=1$} \\
a_nb_n-a_{n-1} & \text{if $b_{n-1}>1$}
\end{cases}\qquad\text{for }n=1,2,\ldots.
\]
for $n=1,2,\ldots.$ Prove that at least one of the two numbers $a_{2017}$ and $a_{2018}$ must be greater than or equal to $2017$.
For any $ n\ge 2 $ natural, show that the following inequality holds:
$$ \sum_{i=2}^n\frac{1}{\sqrt[i]{(2i)!}}\ge\frac{n-1}{2n+2} . $$
For an integer $n$, $\sigma(n)$ denotes the sum of postitive divisors of $n$. A sequence of positive integers $(a_i)_{i=0}^{\infty}$ with $a_0 =1$ is defined as follows: For each $n>1$, $a_n$ is the smallest integer greater than $1$ that satisfies
$$\sigma{(a_0a_1\dots a_{n-1})} \vert \sigma{(a_0a_1\dots a_{n})}.$$
Determine the number of divisors of $2024^{2024}$ amongst the sequence.
Let $A_1,A_2,...$ be a sequence of sets such that for any positive integer $i$, there are only finitely many values of $j$ such that $A_j\subseteq A_i$. Prove that there is a sequence of positive integers $a_1,a_2,...$ such that for any pair $(i,j)$ to have $a_i\mid a_j\iff A_i\subseteq A_j$.
Determine all composite integers $n>1$ that satisfy the following property: if $d_1$, $d_2$, $\ldots$, $d_k$ are all the positive divisors of $n$ with $1 = d_1 < d_2 < \cdots < d_k = n$, then $d_i$ divides $d_{i+1} + d_{i+2}$ for every $1 \leq i \leq k - 2$.
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]
Let $k$ be a positive integer. Find all collection of integers $(a_1, a_2,\cdots, a_k)$ such that there exist a non-linear polynomial $P$ with integer coefficients, so that for all positive integers $n$ there exist a positive integer $m$ satisfying: $$P(n+a_1)+P(n+a_2)+...+P(n+a_k)=P(m)$$
[i]Proposed by Ivan Chan Kai Chin[/i]
The function $f:\mathbb{N}\rightarrow \mathbb{N}$ is [b]peruvian[/b] if it satifies the following two properties:
$\triangleright f$ is strictly increasing.
$\triangleright$ The numbers $a_1,a_2,a_3,\dots$ where $a_1=f(1)$ and $a_{n+1}=f(a_n)$ for every $n\geq 1$, are in arithmetic progression.
Determine all peruvian functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that $f(1)=3$.
Let $n,k$ be positive integers so that $n \ge k$.Find the maximum number of binary sequances of length $n$ so that fixing any arbitary $k$ bits they do not produce all binary sequances of length $k$.For exmple if $k=1$ we can only have one sequance otherwise they will differ in at least one bit which means that bit produces all binary sequances of length $1$.
Let $n \in \mathbb N$ and $A_n$ set of all permutations $(a_1, \ldots, a_n)$ of the set $\{1, 2, \ldots , n\}$ for which
\[k|2(a_1 + \cdots+ a_k), \text{ for all } 1 \leq k \leq n.\]
Find the number of elements of the set $A_n$.
[i]Proposed by Vidan Govedarica, Serbia[/i]
Find all pairs $(m, n)$ of positive integers satsifying $m^6+5n^2=m+n^3$.
Find all functions $f: \mathbb{R}^+ \to \mathbb{R}^+$ such that
$$(z + 1)f(x + y) = f(xf(z) + y) + f(yf(z) + x),$$
for all positive real numbers $x, y, z$.
[i]Fajar Yuliawan, Indonesia[/i]
Let $N$ be the positive integer with 1998 decimal digits, all of them 1; that is,
\[N=1111\cdots 11.\]
Find the thousandth digit after the decimal point of $\sqrt N$.
For every positive integer $n$, define the number of non-empty subsets $\mathcal N\subseteq \{1,\ldots ,n\}$ such that $\gcd(n\in\mathcal N)=1$. Show that $f(n)$ is a perfect square if and only if $n=1$.
Let $\mathbb{N}$ denote the set of positive integers. Find all functions $f:\mathbb{N}\longrightarrow\mathbb{N}$ such that
\[n+f(m)\mid f(n)+nf(m)\]
for all $m,n\in \mathbb{N}$
[i]Proposed by Dorlir Ahmeti, Albania[/i]
Let $G$ be a finite simple graph and let $k$ be the largest number of vertices of any clique in $G$. Suppose that we label each vertex of $G$ with a non-negative real number, so that the sum of all such labels is $1$. Define the [i]value of an edge[/i] to be the product of the labels of the two vertices at its ends. Define the [i]value of a labelling[/i] to be the sum of values of the edges.
Prove that the maximum possible value of a labelling of $G$ is $\frac{k-1}{2k}$.
(A [i]finite simple graph[/i] is a graph with finitely many vertices, in which each edge connects two distinct vertices and no two edges connect the same two vertices. A [i]clique[/i] in a graph is a set of vertices in which any two are connected by an edge.)
A crazy physicist discovered a new kind of particle wich he called an imon, after some of them mysteriously appeared in his lab. Some pairs of imons in the lab can be entangled, and each imon can participate in many entanglement relations. The physicist has found a way to perform the following two kinds of operations with these particles, one operation at a time.
(i) If some imon is entangled with an odd number of other imons in the lab, then the physicist can destroy it.
(ii) At any moment, he may double the whole family of imons in the lab by creating a copy $I'$ of each imon $I$. During this procedure, the two copies $I'$ and $J'$ become entangled if and only if the original imons $I$ and $J$ are entangled, and each copy $I'$ becomes entangled with its original imon $I$; no other entanglements occur or disappear at this moment.
Prove that the physicist may apply a sequence of such operations resulting in a family of imons, no two of which are entangled.
Let there be an infinite sequence $ a_{k} $ with $ k\geq 1 $ defined by:
$ a_{k+2} = a_{k} + 14 $ and $ a_{1} = 12 $ , $ a_{2} = 24 $.
[b]a)[/b] Does $2012$ belong to the sequence?
[b]b)[/b] Prove that the sequence doesn't contain perfect squares.
Let $n\geqslant 2$ be a positive integer and $a_1,a_2, \ldots ,a_n$ be real numbers such that \[a_1+a_2+\dots+a_n=0.\]
Define the set $A$ by
\[A=\left\{(i, j)\,|\,1 \leqslant i<j \leqslant n,\left|a_{i}-a_{j}\right| \geqslant 1\right\}\]
Prove that, if $A$ is not empty, then
\[\sum_{(i, j) \in A} a_{i} a_{j}<0.\]
Every cell of a $2017\times 2017$ grid is colored either black or white, such that every cell has at least one side in common with another cell of the same color. Let $V_1$ be the set of all black cells, $V_2$ be the set of all white cells. For set $V_i (i=1,2)$, if two cells share a common side, draw an edge with the centers of the two cells as endpoints, obtaining graphs $G_i$. If both $G_1$ and $G_2$ are connected paths (no cycles, no splits), prove that the center of the grid is one of the endpoints of $G_1$ or $G_2$.
Let $\mathcal{S}$ be a set consisting of $n \ge 3$ positive integers, none of which is a sum of two other distinct members of $\mathcal{S}$. Prove that the elements of $\mathcal{S}$ may be ordered as $a_1, a_2, \dots, a_n$ so that $a_i$ does not divide $a_{i - 1} + a_{i + 1}$ for all $i = 2, 3, \dots, n - 1$.
$\mathbb{N}$ is the set of positive integers. Determine all functions $f:\mathbb{N}\to\mathbb{N}$ such that for every pair $(m,n)\in\mathbb{N}^2$ we have that:
\[f(m)+f(n) \ | \ m+n .\]
A sequence of integers $a_0, a_1 …$ is called [i]kawaii[/i] if $a_0 =0, a_1=1,$ and $$(a_{n+2}-3a_{n+1}+2a_n)(a_{n+2}-4a_{n+1}+3a_n)=0$$ for all integers $n \geq 0$. An integer is called [i]kawaii[/i] if it belongs to some kawaii sequence.
Suppose that two consecutive integers $m$ and $m+1$ are both kawaii (not necessarily belonging to the same kawaii sequence). Prove that $m$ is divisible by $3,$ and that $m/3$ is also kawaii.
You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.