Found problems: 5802
There is an $n*n$ table with some unit cells colored black and the others are white.
In each step , Amin takes a $row$ with exactly one black cell in it , and color all cells in that black cell's $column$ red.
While Ali , takes a $column$ with exactly one black cell in it , and color all cells in that black cell's $row$ red.
Prove that Amin can color all the cells red , iff Ali can do so.
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$.
Misha has a $100$x$100$ chessboard and a bag with $199$ rooks. In one move he can either put one rook from the bag on the lower left cell of the grid, or remove two rooks which are on the same cell, put one of them on the adjacent square which is above it or right to it, and put the other in the bag. Misha wants to place exactly $100$ rooks on the board, which don't beat each other. Will he be able to achieve such arrangement?
For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$
[i]Proposed by Shahjalal Shohag, Bangladesh[/i]
Find all pairs $(m,n)$ of nonnegative integers for which \[m^2 + 2 \cdot 3^n = m\left(2^{n+1} - 1\right).\]
[i]Proposed by Angelo Di Pasquale, Australia[/i]
Find all positive integers $n$ such that $\sum_{k=1}^{n}\frac{n}{k!}$ is an integer.
Prove that the number of odd binomial coefficients in any finite binomial expansion is a power of $2.$
Find all polynomials $f$ with real coefficients such that for all reals $a,b,c$ such that $ab+bc+ca = 0$ we have the following relations
\[ f(a-b) + f(b-c) + f(c-a) = 2f(a+b+c). \]
$p$ is an odd prime number. Find all $\frac{p-1}2$-tuples $\left(x_1,x_2,\dots,x_{\frac{p-1}2}\right)\in \mathbb{Z}_p^{\frac{p-1}2}$ such that
$$\sum_{i = 1}^{\frac{p-1}{2}} x_{i} \equiv \sum_{i = 1}^{\frac{p-1}{2}} x_{i}^{2} \equiv \cdots \equiv \sum_{i = 1}^{\frac{p-1}{2}} x_{i}^{\frac{p - 1}{2}} \pmod p.$$
[i]Proposed by Ali Partofard[/i]
Prove that for all $ n\ge 2 $ natural numbers there exist $ a_n\in\mathbb{Q} $ such that
$$ X^{2n}+a_nX^n+1\Huge\vdots X^2+\frac{1}{2}X+1, $$
and that there isn´t any $ a_n\in\mathbb{R}\setminus\mathbb{Q} $ with this property.
For a given integer $n\ge 2$, let $a_0,a_1,\ldots ,a_n$ be integers satisfying $0=a_0<a_1<\ldots <a_n=2n-1$. Find the smallest possible number of elements in the set $\{ a_i+a_j \mid 0\le i \le j \le n \}$.
What least possible number of unit squares $(1\times1)$ must be drawn in order to get a picture of $25 \times 25$-square divided into $625$ of unit squares?
Find all integers $n \geq 3$ such that among any $n$ positive real numbers $a_1, a_2, \hdots, a_n$ with $\text{max}(a_1,a_2,\hdots,a_n) \leq n \cdot \text{min}(a_1,a_2,\hdots,a_n)$, there exist three that are the side lengths of an acute triangle.
Determine all integers $n\geqslant 2$ with the following property: every $n$ pairwise distinct integers whose sum is not divisible by $n$ can be arranged in some order $a_1,a_2,\ldots, a_n$ so that $n$ divides $1\cdot a_1+2\cdot a_2+\cdots+n\cdot a_n.$
[i]Arsenii Nikolaiev, Anton Trygub, Oleksii Masalitin, and Fedir Yudin[/i]
Prove that for that for every positive integer $ n$, the smallest integer that is greater than $ (\sqrt {3} \plus{} 1)^{2n}$ is divisible by $ 2^{n \plus{} 1}$.
We have many $\text{three-element}$ subsets of a $1000\text{-element}$ set. We know that the union of every $5$ of them has at least $12$ elements. Find the most possible value for the number of these subsets.
Prove that there exists a set $ S$ of $ n \minus{} 2$ points inside a convex polygon $ P$ with $ n$ sides, such that any triangle determined by $3$ vertices of $ P$ contains exactly one point from $ S$ inside or on the boundaries.
A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula
\[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0;
\]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large.
[i]Proposed by Harmel Nestra, Estionia[/i]
Let $k$ be a positive integer and let $S$ be a finite set of odd prime numbers. Prove that there is at most one way (up to rotation and reflection) to place the elements of $S$ around the circle such that the product of any two neighbors is of the form $x^2+x+k$ for some positive integer $x$.
Consider the polynomial $W(x) = (x - a)^kQ(x)$, where $a \neq 0$, $Q$ is a nonzero polynomial, and $k$ a natural number. Prove that $W$ has at least $k + 1$ nonzero coefficients.
An arrangement of 12 real numbers in a row is called [i]good[/i] if for any four consecutive numbers the arithmetic mean of the first and last numbers is equal to the product of the two middle numbers. How many good arrangements are there in which the first and last numbers are 1, and the second number is the same as the third?
Let $a_1,a_2,\ldots a_n,k$, and $M$ be positive integers such that
$$\frac{1}{a_1}+\frac{1}{a_2}+\cdots+\frac{1}{a_n}=k\quad\text{and}\quad a_1a_2\cdots a_n=M.$$
If $M>1$, prove that the polynomial
$$P(x)=M(x+1)^k-(x+a_1)(x+a_2)\cdots (x+a_n)$$
has no positive roots.
A sequence of real numbers $a_0, a_1, . . .$ is said to be good if the following three conditions hold.
(i) The value of $a_0$ is a positive integer.
(ii) For each non-negative integer $i$ we have $a_{i+1} = 2a_i + 1 $ or $a_{i+1} =\frac{a_i}{a_i + 2} $
(iii) There exists a positive integer $k$ such that $a_k = 2014$.
Find the smallest positive integer $n$ such that there exists a good sequence $a_0, a_1, . . .$ of real numbers with the property that $a_n = 2014$.
[i]Proposed by Wang Wei Hua, Hong Kong[/i]
Find all pairs of function $ f: \mathbb{N} \rightarrow \mathbb{N}$ and polynomial with integer coefficients $ p$ such that:
(i) $ p(mn) \equal{} p(m)p(n)$ for all positive integers $ m,n > 1$ with $ \gcd(m,n) \equal{} 1$, and
(ii) $ \sum_{d|n}f(d) \equal{} p(n)$ for all positive integers $ n$.
Find all functions $f:\mathbb{N} \rightarrow \mathbb{N}$ such that for every prime number $p$ and natural number $x$,
$$\{ x,f(x),\cdots f^{p-1}(x) \} $$
is a complete residue system modulo $p$. With $f^{k+1}(x)=f(f^k(x))$ for every natural number $k$ and $f^1(x)=f(x)$.
[i]Proposed by IndoMathXdZ[/i]