Found problems: 1187
A rectangular array has $ n$ rows and $ 6$ columns, where $ n \geq 2$. In each cell there is written either $ 0$ or $ 1$. All rows in the array are different from each other. For each two rows $ (x_{1},x_{2},x_{3},x_{4},x_{5},x_{6})$ and $ (y_{1},y_{2},y_{3},y_{4},y_{5},y_{6})$, the row $ (x_{1}y_{1},x_{2}y_{2},x_{3}y_{3},x_{4}y_{4},x_{5}y_{5},x_{6}y_{6})$ can be found in the array as well. Prove that there is a column in which at least half of the entries are zeros.
There are $a$ straight lines in a plane, no two of which are parallel to each other and no three intersect in one point.
a) Prove that there exist a straight line for which each of the two Half-Planes defined by it contains at least
$\lfloor \frac{(a-1)(a-2)}{10} \rfloor$
intersection points.
b) Find all $a$ for which the evaluation in a) is the best possible.
Let $X$ be a non-empty set of positive integers which satisfies the following: [list] [*] if $x \in X$, then $4x \in X$, [*] if $x \in X$, then $\lfloor \sqrt{x}\rfloor \in X$. [/list] Prove that $X=\mathbb{N}$.
There are $ n$ websites $ 1,2,\ldots,n$ ($ n \geq 2$). If there is a link from website $ i$ to $ j$, we can use this link so we can move website $ i$ to $ j$.
For all $ i \in \left\{1,2,\ldots,n - 1 \right\}$, there is a link from website $ i$ to $ i+1$.
Prove that we can add less or equal than $ 3(n - 1)\log_{2}(\log_{2} n)$ links so that for all integers $ 1 \leq i < j \leq n$, starting with website $ i$, and using at most three links to website $ j$. (If we use a link, website's number should increase. For example, No.7 to 4 is impossible).
Sorry for my bad English.
Let $M$ be the set of palindromic integers of the form $5n+4$ where $n\ge 0$ is an integer.
[list=a]
[*]If we write the elements of $M$ in increasing order, what is the $50^{\text{th}}$ number?
[*]Among all numbers in $M$ with nonzero digits which sum up to $2014$ which is the largest and smallest one?[/list]
Find the largest prime number less than $2008$ that is a divisor of some integer in the infinite sequence \[\left\lfloor\dfrac{2008}1\right\rfloor,\,\,\,\,\,\,\,\,\,\left\lfloor\dfrac{2008^2}2\right\rfloor,\,\,\,\,\,\,\,\,\,\left\lfloor\dfrac{2008^3}3\right\rfloor,\,\,\,\,\,\,\,\,\,\left\lfloor\dfrac{2008^4}4\right\rfloor,\,\,\,\,\,\,\,\,\,\ldots.\]
Let $k, M$ be positive integers such that $k-1$ is not squarefree. Prove that there exist a positive real $\alpha$, such that $\lfloor \alpha\cdot k^n \rfloor$ and $M$ are coprime for any positive integer $n$.
For a given number $\alpha{}$ let $f_\alpha$ be a function defined as \[f_\alpha(x)=\left\lfloor\alpha x+\frac{1}{2}\right\rfloor.\]Let $\alpha>1$ and $\beta=1/\alpha$. Prove that for any natural $n{}$ the relation $f_\beta(f_\alpha(n))=n$ holds.
[i]Proposed by I. Dorofeev[/i]
For how many positive integers $n \le 1000$ is $$\left\lfloor \dfrac{998}{n} \right\rfloor+\left\lfloor \dfrac{999}{n} \right\rfloor+\left\lfloor \dfrac{1000}{n}\right \rfloor$$ not divisible by $3$? (Recall that $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.)
$\textbf{(A) } 22 \qquad\textbf{(B) } 23 \qquad\textbf{(C) } 24 \qquad\textbf{(D) } 25 \qquad\textbf{(E) } 26$
Denote $S$ as the subset of $\{1,2,3,\dots,1000\}$ with the property that none of the sums of two different elements in $S$ is in $S$. Find the maximum number of elements in $S$.
Let $P(x)$ and $Q(x)$ be arbitrary polynomials with real coefficients, and let $d$ be the degree of $P(x)$. Assume that $P(x)$ is not the zero polynomial. Prove that there exist polynomials $A(x)$ and $B(x)$ such that:
(i) both $A$ and $B$ have degree at most $d/2$
(ii) at most one of $A$ and $B$ is the zero polynomial.
(iii) $\frac{A(x)+Q(x)B(x)}{P(x)}$ is a polynomial with real coefficients. That is, there is some polynomial $C(x)$ with real coefficients such that $A(x)+Q(x)B(x)=P(x)C(x)$.
For $ a_i \in \mathbb{Z}^ \plus{}$, $ i \equal{} 1, \ldots, k$, and $ n \equal{} \sum^k_{i \equal{} 1} a_i$, let $ d \equal{} \gcd(a_1, \ldots, a_k)$ denote the greatest common divisor of $ a_1, \ldots, a_k$.
Prove that $ \frac {d} {n} \cdot \frac {n!}{\prod\limits^k_{i \equal{} 1} (a_i!)}$ is an integer.
[i]Dan Schwarz, Romania[/i]
Suppose that f is a function $f : R_{\ge 0} \to R$ so that for all $x, y \in R_{\ge 0}$ (nonnegative reals) we have that $$f(x)+f(y) = f(x+y+xy)+f(x)f(y).$$ Given that $f\left(\frac{3}{5} \right) = \frac12$ and$ f(1) = 3$, determine
$$\lfloor \log_2 (-f(10^{2021} - 1)) \rfloor.$$
For every $m$ and $k$ integers with $k$ odd, denote by $[\frac{m}{k}]$ the integer closest to $\frac{m}{k}$. For every odd integer $k$, let $P\left(k\right)$ be the probability that \[ [\frac{n}{k}] + [\frac{100-n}{k}] = [\frac{100}{k}] \] for an integer $n$ randomly chosen from the interval $1 \le n \le 99!$. What is the minimum possible value of $P\left(k\right)$ over the odd integers $k$ in the interval $1 \le k \le 99$?
$ \textbf{(A)}\ \frac{1}{2} \qquad
\textbf{(B)}\ \frac{50}{99} \qquad
\textbf{(C)}\ \frac{44}{87} \qquad
\textbf{(D)}\ \frac{34}{67} \qquad
\textbf{(E)}\ \frac{7}{13} $
Find the smallest possible value of the expression \[\left\lfloor\frac{a+b+c}{d}\right\rfloor+\left\lfloor\frac{b+c+d}{a}\right\rfloor+\left\lfloor\frac{c+d+a}{b}\right\rfloor+\left\lfloor\frac{d+a+b}{c}\right\rfloor\]
in which $a,~ b,~ c$, and $d$ vary over the set of positive integers.
(Here $\lfloor x\rfloor$ denotes the biggest integer which is smaller than or equal to $x$.)
For any integer $n\ge 2$, let $N(n)$ be the maximum number of triples $(a_j,b_j,c_j),j=1,2,3,\cdots ,N(n),$ consisting of non-negative integers $a_j,b_j,c_j$ (not necessarily distinct) such that the following two conditions are satisfied:
(a) $a_j+b_j+c_j=n,$ for all $j=1,2,3,\cdots N(n)$;
(b) $j\neq k$, then $a_j\neq a_k$, $b_j\neq b_k$ and $c_j\neq c_k$.
Determine $N(n)$ for all $n\ge 2$.
Find the maximum possible number of edges of a simple graph with $8$ vertices and without any quadrilateral. (a simple graph is an undirected graph that has no loops (edges connected at both ends to the same vertex) and no more than one edge between any two different vertices.)
Find all nonnegative integers $m,n$ so that \[\sum_{k=1}^{2^{m}}\lfloor \frac{kn}{2^{m}}\rfloor\in \{28,29,30\}\]
Let $n \ge 6$ be an integer and $F$ be the system of the $3$-element subsets of the set $\{1, 2,...,n \}$ satisfying the following condition:
for every $1 \le i < j \le n$ there is at least $ \lfloor \frac{1}{3} n \rfloor -1$ subsets $A\in F$ such that $i, j \in A$.
Prove that for some integer $m \ge 1$ exist the mutually disjoint subsets $A_1, A_2 , ... , A_m \in F $ also, that $|A_1\cup A_2 \cup ... \cup A_m |\ge n-5 $
(Poland)
PS. just in case my translation does not make sense,
I leave the original in Slovak, in case someone understands something else
How many of the first 1000 positive integers can be expressed in the form
\[ \lfloor 2x \rfloor + \lfloor 4x \rfloor + \lfloor 6x \rfloor + \lfloor 8x \rfloor, \]
where $x$ is a real number, and $\lfloor z \rfloor$ denotes the greatest integer less than or equal to $z$?
Let $p\ge 17$ be a prime. Prove that $t=3$ is the largest positive integer which satisfies the following condition:
For any integers $a,b,c,d$ such that $abc$ is not divisible by $p$ and $(a+b+c)$ is divisible by $p$, there exists integers $x,y,z$ belonging to the set $\{0,1,2,\ldots , \left\lfloor \frac{p}{t} \right\rfloor - 1\}$ such that $ax+by+cz+d$ is divisible by $p$.
Given natural numbers $a,b$ and function $f: \mathbb{N} \to \mathbb{N} $ such that for any natural number $n, f\left( n+a \right)$ is divided by $f\left( {\left[ {\sqrt n } \right] + b} \right)$. Prove that for any natural $n$ exist $n$ pairwise distinct and pairwise relatively prime natural numbers ${{a}_{1}}$, ${{a}_{2}}$, $\ldots$, ${{a}_{n}}$ such that the number $f\left( {{a}_{i+1}} \right)$ is divided by $f\left( {{a}_{i}} \right)$ for each $i=1,2, \dots ,n-1$ .
(Here $[x]$ is the integer part of number $x$, that is, the largest integer not exceeding $x$.)
Let $x,y,z>0$ such that
$$(x+y+z)\left(\frac1x+\frac1y+\frac1z\right)=\frac{91}{10}$$
Compute
$$\left[(x^3+y^3+z^3)\left(\frac1{x^3}+\frac1{y^3}+\frac1{z^3}\right)\right]$$
where $[.]$ represents the integer part.
[i]Proposed by Marian Cucoanoeş and Marius Drăgan[/i]
Let $f: \mathbb N \to \mathbb N$ be a function such that $f(1)=1$ and
\[f(n)=n - f(f(n-1)), \quad \forall n \geq 2.\]
Prove that $f(n+f(n))=n $ for each positive integer $n.$
Determine all positive integers $a$ for which there exist exactly $2014$ positive integers $b$ such that $\displaystyle2\leq\frac{a}{b}\leq5$.