Found problems: 5802
Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \cdots , a_d $ such that $a_1 + a_2 + \cdots + a_d = n$ and $0 \le a_i \le 1$ for $i=1,2,\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.
A polynomial $P$ in $n$ variables and real coefficients is called [i]magical[/i] if $P(\mathbb{N}^n)\subset \mathbb{N}$, and moreover the map $P: \mathbb{N}^n \to \mathbb{N}$ is a bijection. Prove that for all positive integers $n$, there are at least
\[n!\cdot (C(n)-C(n-1))\]
magical polynomials, where $C(n)$ is the $n$-th Catalan number.
Here $\mathbb{N}=\{0,1,2,\dots\}$.
Prove that for any given positive integer $m$ and $n$, there is always a positive integer $k$ so that $2^k-m$ has at least $n$ different prime divisors.
An ordered pair $(x, y)$ of integers is a primitive point if the greatest common divisor of $x$ and $y$ is $1$. Given a finite set $S$ of primitive points, prove that there exist a positive integer $n$ and integers $a_0, a_1, \ldots , a_n$ such that, for each $(x, y)$ in $S$, we have:
$$a_0x^n + a_1x^{n-1} y + a_2x^{n-2}y^2 + \cdots + a_{n-1}xy^{n-1} + a_ny^n = 1.$$
[i]Proposed by John Berman, United States[/i]
Let $Z^+$ be positive integers set. $f:\mathbb{Z^+}\to\mathbb{Z^+}$ is a function and
we show $ f \circ f \circ ...\circ f $ with $f_l$ for all $l\in \mathbb{Z^+}$ where $f$ is repeated $l$ times. Find all $f:\mathbb{Z^+}\to\mathbb{Z^+}$ functions such that $$ (n-1)^{2020}< \prod _{l=1}^{2020} {f_l}(n)< n^{2020}+n^{2019} $$
for all $n\in \mathbb{Z^+}$
Let $n$ be a positive integer. Show that there exist a polynomial $P(x)$ with integer coefficient that satisfy the following
[list]
[*]Degree of $P(x)$ is at most $2^n - n -1$
[*]$|P(k)| = (k-1)!(2^n-k)!$ for each $k \in \{1,2,3,\dots,2^n\}$
[/list]
Find all functions $f:\mathbb{R^+}\to\mathbb{R^+}$ satisfying$$f(xy+x+y)=(f(x)-f(y))f(y-x-1)$$ for all $x>0, y>x+1$.
$\{a_{n}\}_{n\geq 0}$ and $\{b_{n}\}_{n\geq 0}$ are two sequences of positive integers that $a_{i},b_{i}\in \{0,1,2,\cdots,9\}$. There is an integer number $M$ such that $a_{n},b_{n}\neq 0$ for all $n\geq M$ and for each $n\geq 0$
$$(\overline{a_{n}\cdots a_{1}a_{0}})^{2}+999 \mid(\overline{b_{n}\cdots b_{1}b_{0}})^{2}+999 $$
prove that $a_{n}=b_{n}$ for $n\geq 0$.\\
(Note that $(\overline{x_nx_{n-1}\dots x_0}) = 10^n\times x_n + \dots + 10\times x_1 + x_0$.)
[i]Proposed by Yahya Motevassel[/i]
Find all integers $m$ such that $\frac{2m^2+7m-9}{m^2+m+1}$ is integer
Function $f(x, y): \mathbb N \times \mathbb N \to \mathbb Q$ satisfies the conditions:
(i) $f(1, 1) =1$,
(ii) $f(p + 1, q) + f(p, q + 1) = f(p, q)$ for all $p, q \in \mathbb N$, and
(iii) $qf(p + 1, q) = pf(p, q + 1)$ for all $p, q \in \mathbb N$.
Find $f(1990, 31).$
An [i]animal[/i] with $n$ [i]cells[/i] is a connected figure consisting of $n$ equal-sized cells[1].
A [i]dinosaur[/i] is an animal with at least $2007$ cells. It is said to be [i]primitive[/i] it its cells cannot be partitioned into two or more dinosaurs. Find with proof the maximum number of cells in a primitive dinosaur.
(1) Animals are also called [i]polyominoes[/i]. They can be defined inductively. Two cells are [i]adjacent[/i] if they share a complete edge. A single cell is an animal, and given an animal with $n$ cells, one with $n+1$ cells is obtained by adjoining a new cell by making it adjacent to one or more existing cells.
Let be two natural numbers $ m,n, $ and $ m $ pairwise disjoint sets of natural numbers $ A_0,A_1,\ldots ,A_{m-1}, $ each having $ n $ elements, such that no element of $ A_{i\pmod m} $ is divisible by an element of $ A_{i+1\pmod m} , $ for any natural number $ i. $
Determine the number of ordered pairs
$$ (a,b)\in\bigcup_{0\le j < m} A_j\times\bigcup_{0\le j < m} A_j $$
such that $ a|b $ and such that $ \{ a,b \}\not\in A_k, $ for any $ k\in\{ 0,1,\ldots ,m-1 \} . $
[i]Radu Bumbăcea[/i]
Given a sequence of eight integers $x_{1},x_{2},...,x_{8}$ in a single operation one replaces these numbers with $|x_{1}-x_{2}|,|x_{2}-x_{3}|,...,|x_{8}-x_{1}|$. Find all the eight-term sequences of integers which reduce to a sequence with all the terms equal after finitely many single operations.
For a positive integer $k\ge 2$ define $\mathcal{T}_k=\{(x,y)\mid x,y=0,1,\ldots, k-1\}$ to be a collection of $k^2$ lattice points on the cartesian coordinate plane. Let $d_1(k)>d_2(k)>\cdots$ be the decreasing sequence of the distinct distances between any two points in $T_k$. Suppose $S_i(k)$ be the number of distances equal to $d_i(k)$.
Prove that for any three positive integers $m>n>i$ we have $S_i(m)=S_i(n)$.
Let $n$ be a positive integer. We start with $n$ piles of pebbles, each initially containing a single pebble. One can perform moves of the following form: choose two piles, take an equal number of pebbles from each pile and form a new pile out of these pebbles. Find (in terms of $n$) the smallest number of nonempty piles that one can obtain by performing a finite sequence of moves of this form.
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$.
The sequence $<a_n>$ is defined as follows, $a_1=a_2=1$, $a_3=2$,
$$a_{n+3}=\frac{a_{n+2}a_{n+1}+n!}{a_n},$$
$n \ge 1$.
Prove that all the terms in the sequence are integers.
Let $n$ be a positive integer.
(a) Prove that there exists a set $S$ of $6n$ pairwise different positive integers, such that the least common multiple of any two elements of $S$ is no larger than $32n^2$.
(b) Prove that every set $T$ of $6n$ pairwise different positive integers contains two elements the least common multiple of which is larger than $9n^2$.
A given rectangle $ R$ is divided into $mn$ small rectangles by straight lines parallel to its sides. (The distances between the parallel lines may not be equal.) What is the minimum number of appropriately selected rectangles’ areas that should be known in order to determine the area of $ R$?
Let $n$ be a positive integer. We call $(a_1,a_2,\cdots,a_n)$ a [i]good[/i] $n-$tuple if $\sum_{i=1}^{n}{a_i}=2n$ and there doesn't exist a set of $a_i$s such that the sum of them is equal to $n$. Find all [i]good[/i] $n-$tuple.
(For instance, $(1,1,4)$ is a [i]good[/i] $3-$tuple, but $(1,2,1,2,4)$ is not a [i]good[/i] $5-$tuple.)
Consider an infinite sequence of positive integers $a_1, a_2, a_3, \dots$ such that $a_1 > 1$ and $(2^{a_n} - 1)a_{n+1}$ is a square for all positive integers $n$. Is it possible for two terms of such a sequence to be equal?
[i]Proposed by Pavel Kozlov, Russia[/i]
For any two nonnegative integers $n$ and $k$ satisfying $n\geq k$, we define the number $c(n,k)$ as follows:
- $c\left(n,0\right)=c\left(n,n\right)=1$ for all $n\geq 0$;
- $c\left(n+1,k\right)=2^{k}c\left(n,k\right)+c\left(n,k-1\right)$ for $n\geq k\geq 1$.
Prove that $c\left(n,k\right)=c\left(n,n-k\right)$ for all $n\geq k\geq 0$.
Suppose $\, q_{0}, \, q_{1}, \, q_{2}, \ldots \; \,$ is an infinite sequence of integers satisfying the following two conditions:
(i) $\, m-n \,$ divides $\, q_{m}-q_{n}\,$ for $\, m > n \geq 0,$
(ii) there is a polynomial $\, P \,$ such that $\, |q_{n}| < P(n) \,$ for all $\, n$
Prove that there is a polynomial $\, Q \,$ such that $\, q_{n}= Q(n) \,$ for all $\, n$.
Let $\mathbb N$ denote the set of positive integers, and for a function $f$, let $f^k(n)$ denote the function $f$ applied $k$ times. Call a function $f : \mathbb N \to \mathbb N$ [i]saturated[/i] if \[ f^{f^{f(n)}(n)}(n) = n \] for every positive integer $n$. Find all positive integers $m$ for which the following holds: every saturated function $f$ satisfies $f^{2014}(m) = m$.
[i]Proposed by Evan Chen[/i]
Determine all positive integers $n$ such that the following statement holds: If a convex polygon with with $2n$ sides $A_1 A_2 \ldots A_{2n}$ is inscribed in a circle and $n-1$ of its $n$ pairs of opposite sides are parallel, which means if the pairs of opposite sides
\[(A_1 A_2, A_{n+1} A_{n+2}), (A_2 A_3, A_{n+2} A_{n+3}), \ldots , (A_{n-1} A_n, A_{2n-1} A_{2n})\]
are parallel, then the sides \[ A_n A_{n+1}, A_{2n} A_1\] are parallel as well.