How many non-negative integral values of $x$ satisfy the equation $ \lfloor \frac{x}{5}\rfloor = \lfloor \frac{x}{7}\rfloor $

For the integer numbers $i,j,k$ satisfying the condtion $i^2+j^2+k^2=2011$, what is the largest value of $i+j+k$? $\textbf{(A)}\ 71 \qquad\textbf{(B)}\ 73 \qquad\textbf{(C)}\ 74 \qquad\textbf{(D)}\ 76 \qquad\textbf{(E)}\ 77$

A rational number $ x$ is called [i]good[/i] if it satisfies: $ x\equal{}\frac{p}{q}>1$ with $ p$, $ q$ being positive integers, $ \gcd (p,q)\equal{}1$ and there exists constant numbers $ \alpha$, $ N$ such that for any integer $ n\geq N$, \[ |\{x^n\}\minus{}\alpha|\leq\dfrac{1}{2(p\plus{}q)}\] Find all the good numbers.

A rectangular table $ 9$ rows $ \times$ $ 2008$ columns is fulfilled with numbers $ 1$, $ 2$, ...,$ 2008$ in a such way that each number appears exactly $ 9$ times in table and difference between any two numbers from same column is not greater than $ 3$. What is maximum value of minimum sum in column (with minimal sum)?

Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all $m,n\in\mathbb{N}$, \[(2^m+1)f(n)f(2^mn)=2^mf(n)^2+f(2^mn)^2+(2^m-1)^2n. \]

Find all polynomials $P(x)$ with real coefficients having the following property: There exists a positive integer n such that the equality $$\sum_{k=1}^{2n+1}(-1)^k \left[\frac{k}{2}\right] P(x + k)=0$$ holds for infinitely many real numbers $x$.

Let $a, b, c$, and $d$ be real numbers. Suppose that $\lfloor na\rfloor +\lfloor nb\rfloor =\lfloor nc\rfloor +\lfloor nd\rfloor $ for all positive integers $n$. Show that at least one of $a+b$, $a-c$, $a-d$ is an integer.

Prove that there are no $x\in\mathbb{R}^+$ such that $$x^{\lfloor x \rfloor }=\frac92.$$

Show that for any natural number $n$, the number $A = [\frac{n + 3}{4}] + [ \frac{n + 5}{4} ] + [\frac{n}{2} ] +n^2 + 3n + 3$ is a perfect square. ($[x]$ denotes the integer part of the real number x.)

Let $\lambda$ the positive root of the equation $t^2-1998t-1=0$. It is defined the sequence $x_0,x_1,x_2,\ldots,x_n,\ldots$ by $x_0=1,\ x_{n+1}=\lfloor\lambda{x_n}\rfloor\mbox{ for }n=1,2\ldots$ Find the remainder of the division of $x_{1998}$ by $1998$. Note: $\lfloor{x}\rfloor$ is the greatest integer less than or equal to $x$.

Given a positive integer $n$, we say that a polynomial $P$ with real coefficients is $n$-pretty if the equation $P(\lfloor x \rfloor)=\lfloor P(x) \rfloor$ has exactly $n$ real solutions. Show that for each positive integer $n$ [list=a] [*] there exists an n-pretty polynomial; [*] any $n$-pretty polynomial has a degree of at least $\tfrac{2n+1}{3}$. [/list] ([i]Remark.[/i] For a real number $x$, we denote by $\lfloor x \rfloor$ the largest integer smaller than or equal to $x$.)

Let $n\ge 2$ be a given integer. Show that the number of strings of length $n$ consisting of $0'$s and $1'$s such that there are equal number of $00$ and $11$ blocks in each string is equal to \[2\binom{n-2}{\left \lfloor \frac{n-2}{2}\right \rfloor}\]

Prove that for all positive integers $n$, \[\lfloor \sqrt[3]{n}+\sqrt[3]{n+1}\rfloor =\lfloor \sqrt[3]{8n+3}\rfloor.\]

Consider the finite sequence $\left\lfloor \frac{k^2}{1998} \right\rfloor$, for $k=1,2,\ldots, 1997$. How many distinct terms are there in this sequence? [i]Greece[/i]

Find all natural numbers $n$, such that $\min_{k\in \mathbb{N}}(k^2+[n/k^2])=1991$. ($[n/k^2]$ denotes the integer part of $n/k^2$.)

Each of the subsets $ A_1$, $ A_2$, $ \dots,$ $ A_n$ of a 2009-element set $ X$ contains at least 4 elements. The intersection of every two of these subsets contains at most 2 elements. Prove that in $ X$ there is a 24-element subset $ B$ containing neither of the sets $ A_1$, $ A_2$, $ \dots,$ $ A_n$.

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.$

Find the minimum positive noninteger root of $ \sin x=\sin \lfloor x \rfloor $. F. Petrov

Let $k \ge 1$ be an integer and $a_1, a_2, ... , a_k, b1, b_2, ..., b_k$ rational numbers with the property that for any irrational numbers $x_i >1$, $i = 1, 2, ..., k$, there exist the positive integers $n_1, n_2, ... , n_k, m_1, m_2, ..., m_k$ such that $$a_1\lfloor x^{n_1}_1\rfloor + a_2 \lfloor x^{n_2}_2\rfloor + ...+ a_k\lfloor x^{n_k}_k\rfloor=b_1\lfloor x^{m_1}_1\rfloor +2_1\lfloor x^{m_2}_2\rfloor+...+b_k\lfloor x^{m_k}_k\rfloor $$ Prove that $a_i = b_i$ for all $i = 1, 2, ... , k$.

There is a sequence with $a(2)=0$, $a(3)=1$ and $a(n)=a\left(\left\lfloor\dfrac n2\right\rfloor\right)+a\left(\left\lceil\dfrac n2\right\rceil\right)$ for $n\geq 4$. Find $a(2014)$. [Note that $\left\lfloor\dfrac n2\right\rfloor$ and $\left\lceil\dfrac n2\right\rceil$ denote the floor function (largest integer $\leq\tfrac n2$) and the ceiling function (smallest integer $\geq\tfrac n2$), respectively.]

Let $X$ be an $n$-element set and let $A_1,\ldots ,A_m$ be subsets of $X$ such that i) $|A_i|=3$ for each $i=1,\ldots ,m$. ii) $|A_i\cap A_j|\le 1$ for any two distinct indices $i,j$. Show that there exists a subset of $X$ with at least $\lfloor\sqrt{2n}\rfloor$ elements which does not contain any of the $A_i$’s.

The National Foundation of Happiness (NFoH) wants to estimate the happiness of people of country. NFoH selected $n$ random persons, and on every morning asked from each of them whether she is happy or not. On any two distinct days, exactly half of the persons gave the same answer. Show that after $k$ days, there were at most $n-\frac{n}{k}$ persons whose “yes” answers equals their “no” answers.

Three speed skaters have a friendly "race" on a skating oval. They all start from the same point and skate in the same direction, but with different speeds that they maintain throughout the race. The slowest skater does $1$ lap per minute, the fastest one does $3.14$ laps per minute, and the middle one does $L$ laps a minute for some $1 < L < 3.14$. The race ends at the moment when all three skaters again come together to the same point on the oval (which may differ from the starting point.) Determine the number of different choices for $L$ such that exactly $117$ passings occur before the end of the race. Note: A passing is defined as when one skater passes another one. The beginning and the end of the race when all three skaters are together are not counted as passings.

Prove that: $ \sum_{i\equal{}1}^{n^2} \lfloor \frac{i}{3} \rfloor\equal{} \frac{n^2(n^2\minus{}1)}{6}$ For all $ n \in N$.

Let $n$ be a natural number and $f(n) = 2n - 1995 \lfloor \frac{n}{1000} \rfloor$($\lfloor$ $\rfloor$ denotes the floor function). 1. Show that if for some integer $r$: $f(f(f...f(n)...))=1995$ (where the function $f$ is applied $r$ times), then $n$ is multiple of $1995$. 2. Show that if $n$ is multiple of 1995, then there exists r such that:$f(f(f...f(n)...))=1995$ (where the function $f$ is applied $r$ times). Determine $r$ if $n=1995.500=997500$