Assume that $a$ is a given irrational number. (a) Prove that for each positive real number $\epsilon$ there exists at least one integer $q\ge0$ such that $aq-\lfloor aq\rfloor<\epsilon$. (b) Prove that for given $\epsilon>0$ there exist infinitely many rational numbers $\frac pq$ such that $q>0$ and $\left|a-\frac pq\right|<\frac\epsilon q$.

Let $ a, b, c$ be positive integers satisfying the conditions $ b > 2a$ and $ c > 2b.$ Show that there exists a real number $ \lambda$ with the property that all the three numbers $ \lambda a, \lambda b, \lambda c$ have their fractional parts lying in the interval $ \left(\frac {1}{3}, \frac {2}{3} \right].$

Are there positive real numbers $a$ and $b$ such that $[an+b]$ is prime for all natural values of $n$ ? $[x]$ denotes the integer part of the number $x$, the largest integer that does not exceed $x$.

Let $r_1,r_2,\ldots,r_m$ be positive rational numbers with a sum of $1$. Find the maximum values of the function $f:\mathbb N\to\mathbb Z$ defined by $$f(n)=n-\lfloor r_1n\rfloor-\lfloor r_2n\rfloor-\ldots-\lfloor r_mn\rfloor$$

Let $N$ be an integer greater than $1$ and let $T_n$ be the number of non empty subsets $S$ of $\{1,2,.....,n\}$ with the property that the average of the elements of $S$ is an integer.Prove that $T_n - n$ is always even.

Find all real numbers $ x$ such that: $ [x^2\plus{}2x]\equal{}{[x]}^2\plus{}2[x]$ (Here $ [x]$ denotes the largest integer not exceeding $ x$.)

Find all positive numbers $x$ such that:$$\frac{1}{[x]}-\frac{1}{[2x]}=\frac{1}{6\{x\}}$$ where $[x]$ represents the integer part of $x$ and $\{x\}=x-[x]$.

a) Prove that $\lfloor x\rfloor$ is odd iff $\Big\lfloor 2\{\frac{x}{2}\}\Big\rfloor=1$ ($\lfloor x\rfloor$ denotes the largest integer less than or equal to $x$ and $\{x\}=x-\lfloor x\rfloor$). b) Let $n$ be a natural number. Find the number of [i]square free[/i] numbers $a$, such that $\Big\lfloor\frac{n}{\sqrt{a}}\Big\rfloor$ is odd. (A natural number is [i]square free[/i] if it's not divisible by any square of a prime number).

Let $ m$ and $ n$ be positive integers with $ m > n \geq 2.$ Set $ S \equal{} \{1, 2, \ldots, m\},$ and $ T \equal{} \{a_l, a_2, \ldots, a_n\}$ is a subset of S such that every number in $ S$ is not divisible by any two distinct numbers in $ T.$ Prove that \[ \sum^n_{i \equal{} 1} \frac {1}{a_i} < \frac {m \plus{} n}{m}. \]

Find the real numbers $x$ such that $$3^x + 3^{\lfloor x\rfloor} + 3^{\{x\}}=4.$$

Given triangle $ABC$. Let $A_1B_1$, $A_2B_2$,$ ...$, $A_{2008}B_{2008}$ be $2008$ lines parallel to $AB$ which divide triangle $ABC$ into $2009$ equal areas. Calculate the value of $$ \left\lfloor \frac{A_1B_1}{2A_2B_2} + \frac{A_1B_1}{2A_3B_3} + ... + \frac{A_1B_1}{2A_{2008}B_{2008}} \right\rfloor$$

Show that a segment of length $ h$ can go through or be tangent to at most $ 2\lfloor h/\sqrt{2}\rfloor\plus{}2$ nonoverlapping unit spheres. [i]L.Fejes-Toth, A. Heppes[/i]

A word is a sequence of n letters of the alphabet {a, b, c, d}. A word is said to be complicated if it contains two consecutive groups of identic letters. The words caab, baba and cababdc, for example, are complicated words, while bacba and dcbdc are not. A word that is not complicated is a simple word. Prove that the numbers of simple words with n letters is greater than $2^n$, if n is a positive integer.

Let $ m$ be a positive integer and define $ f(m)$ to be the number of factors of $ 2$ in $ m!$ (that is, the greatest positive integer $ k$ such that $ 2^k|m!$). Prove that there are infinitely many positive integers $ m$ such that $ m \minus{} f(m) \equal{} 1989.$

Thin and Fat eat a pizza of $2n$ pieces. Each piece contains a distinct amount of olives between $1$ and $2n$. Thin eats the first piece, and the two players alternately eat a piece neighbor of an eaten piece. However, neither Thin nor Fat like olives, so they will choose pieces that minimizes the total amount of olives they eat. For each arrangement $\sigma$ of the olives, let $s(\sigma)$ the minimal amount of olives that Thin can eat, considering that both play in the best way possible. Let $S(n)$ the maximum of $s(\sigma)$, considering all arrangements. $a)$ Prove that $n^2-1+\lfloor \frac{n}{2} \rfloor \le S(n) \le n^2+\lfloor \frac{n}{2} \rfloor$ $b)$ Prove that $S(n)=n^2-1+\frac{n}{2}$ for each even n.

Let $t(n)$ be the sum of the digits in the binary representation of a positive integer $n,$ and let $k \geq 2$ be an integer. [b]a.[/b] Show that there exists a sequence $(a_i)_{i=1}^{\infty}$ of integers such that $a_m \geq 3$ is an odd integer and $t(a_1a_2 \cdots a_m)=k$ for all $m \geq 1.$ [b]b.[/b] Show that there is an integer $N$ such that $t(3 \cdot 5 \cdots (2m+1))>k$ for all integers $m \geq N.$

[color=darkblue]Weightlifter Ruslan has just finished the exercise with a weight, which has $ n$ small weights on one side and $ n$ on the another. At each stage he takes some weights from one of the sides, such that at any moment the difference of the numbers of weights on the sides does not exceed $ k$. What is the minimal number of stages (in function if $ n$ and $ k$), which Ruslan need to take off all weights..[/color]

Find all positive integers $n$ such that there exist a permutation $\sigma$ on the set $\{1,2,3, \ldots, n\}$ for which \[\sqrt{\sigma(1)+\sqrt{\sigma(2)+\sqrt{\ldots+\sqrt{\sigma(n-1)+\sqrt{\sigma(n)}}}}}\] is a rational number.

The sequence $a_i$ is defined as $a_1 = 1$ and \[a_n = a_{\left\lfloor \dfrac{n}{2} \right\rfloor} + a_{\left\lfloor \dfrac{n}{3} \right\rfloor} + a_{\left\lfloor \dfrac{n}{4} \right\rfloor} + \cdots + a_{\left\lfloor \dfrac{n}{n} \right\rfloor} + 1\] for every positive integer $n > 1$. Prove that there are infinitely many values of $n$ such that $a_n \equiv n \mod 2012$.

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)?

Consider rows of the form: $[x], [2x], [3x], ...$ Proof that, if $N \in N$ does not occur in the sequence $([n x])$, then there is an $n \in N$ with $n - 1 < \frac{N}{x}< n -\frac{1}{x}$ Prove that, for $x, y \notin Q$: $\frac{1}{x}+\frac{1}{y} = 1$, then each $N \in N$ term is either of $([nx])$ or of $([ny])$.

Find all primes $p \geq 3$ with the following property: for any prime $q<p$, the number \[ p - \Big\lfloor \frac{p}{q} \Big\rfloor q \] is squarefree (i.e. is not divisible by the square of a prime).

Let $S$ be the set of ordered pairs $(a, b)$ of positive integers such that $\gcd(a, b) = 1$. Compute \[ \sum_{(a, b) \in S} \left\lfloor \frac{300}{2a+3b} \right\rfloor. \]

The remainder can be defined for all real numbers $x$ and $y$ with $y \neq 0$ by $$\text{rem} (x ,y)=x-y\left \lfloor \frac{x}{y} \right \rfloor$$ where $\left \lfloor \tfrac{x}{y} \right \rfloor$ denotes the greatest integer less than or equal to $\tfrac{x}{y}$. What is the value of $\text{rem} (\tfrac{3}{8}, -\tfrac{2}{5} )$? $\textbf{(A) } -\frac{3}{8} \qquad \textbf{(B) } -\frac{1}{40} \qquad \textbf{(C) } 0 \qquad \textbf{(D) } \frac{3}{8} \qquad \textbf{(E) } \frac{31}{40}$

Determine all integers $x$ satisfying \[ \left[\frac{x}{2}\right] \left[\frac{x}{3}\right] \left[\frac{x}{4}\right] = x^2. \] ($[y]$ is the largest integer which is not larger than $y.$)