Found problems: 1187
Find all reals $x$ satisfying $0 \le x \le 5$ and
$\lfloor x^2-2x \rfloor = \lfloor x \rfloor ^2 - 2 \lfloor x \rfloor$.
Let $x > 1$ be a non-integer number. Prove that
\[\biggl( \frac{x+\{x\}}{[x]} - \frac{[x]}{x+\{x\}} \biggr) + \biggl( \frac{x+[x]}{ \{x \} } - \frac{ \{ x \}}{x+[x]} \biggr) > \frac 92 \]
Let be a natural number $ n\ge 2. $ Find the real numbers $ a $ that satisfy the equation
$$ \lfloor nx \rfloor =\sum_{k=1}^{n} \lfloor x+(k-1)a \rfloor , $$
for any real numbers $ x. $
[i]Marius Perianu[/i]
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)$.
Suppose that the set $M=\{1,2,\cdots,n\}$ is split into $t$ disjoint subsets $M_{1}$, $\cdots$, $M_{t}$ where the cardinality of $M_i$ is $m_{i}$, and $m_{i} \ge m_{i+1}$, for $i=1,\cdots,t-1$. Show that if $n>t!\cdot e$ then at least one class $M_z$ contains three elements $x_{i}$, $x_{j}$, $x_{k}$ with the property that $x_{i}-x_{j}=x_{k}$.
The Ultimate Question is a 10-part problem in which each question after the first depends on the answer to the previous problem. As in the Short Answer section, the answer to each (of the 10) problems is a nonnegative integer. You should submit an answer for each of the 10 problems you solve (unlike in previous years). In order to receive credit for the correct answer to a problem, you must also correctly answer $\textit{every one}$ $\textit{of the previous parts}$ $\textit{of the Ultimate Question}$.
Find all real numbers $x$ satisfying the equation
\[\left\lfloor \frac{20}{x+18}\right\rfloor+\left\lfloor \frac{x+18}{20}\right\rfloor=1.\]
Let $ p$ be a prime number with $ p>5$. Consider the set $ X \equal{} \left\{p \minus{} n^2 \mid n\in \mathbb{N} ,\ n^2 < p\right\}$.
Prove that the set $ X$ has two distinct elements $ x$ and $ y$ such that $ x\neq 1$ and $ x\mid y$.
[i]Albania[/i]
Given an integer $n\geq 2$ and a closed unit disc, evaluate the maximum of the product of the lengths of all $\frac{n(n-1)}{2}$ segments determined by $n$ points in that disc.
Let $S$ be a set of 100 integers. Suppose that for all positive integers $x$ and $y$ (possibly equal) such that $x + y$ is in $S$, either $x$ or $y$ (or both) is in $S$. Prove that the sum of the numbers in $S$ is at most 10,000.
Let $A_0$, $A_1$, $A_2$, ..., $A_n$ be nonnegative numbers such that
\[
A_0 \le A_1 \le A_2 \le \dots \le A_n.
\]
Prove that
\[
\left| \sum_{i = 0}^{\lfloor n/2 \rfloor} A_{2i}
- \frac{1}{2} \sum_{i = 0}^n A_i \right| \le \frac{A_n}{2} \, .
\]
(Note: $\lfloor x \rfloor$ means the greatest integer that is less than or equal to $x$.)
The following sequence lists all the positive rational numbers that do not exceed $\frac12$ by first listing the fraction with denominator 2, followed by the one with denominator 3, followed by the two fractions with denominator 4 in increasing order, and so forth so that the sequence is
\[
\frac12,\frac13,\frac14,\frac24,\frac15,\frac25,\frac16,\frac26,\frac36,\frac17,\frac27,\frac37,\cdots.
\]
Let $m$ and $n$ be relatively prime positive integers so that the $2012^{\text{th}}$ fraction in the list is equal to $\frac{m}{n}$. Find $m+n$.
Determine the sixth number after the decimal point in the number $(\sqrt{1978} +\lfloor\sqrt{1978}\rfloor)^{20}$
Find the total number of different integer values the function \[f(x) = \lfloor x\rfloor+\lfloor 2x\rfloor+\left\lfloor \frac{5x}{3}\right\rfloor+\lfloor 3x\rfloor+\lfloor 4x\rfloor\] takes for real numbers $x$ with $0 \leq x \leq 100$.
Prove that in each year , the $13^{th}$ day of some month occurs on a Friday .
Prove that $[\sqrt{n}+\sqrt{n+1}]=[\sqrt{4n+1}]$ for all $n \in N$.
$f(x)=\sum\limits_{i=1}^{2013}\left[\dfrac{x}{i!}\right]$. A integer $n$ is called [i]good[/i] if $f(x)=n$ has real root. How many good numbers are in $\{1,3,5,\dotsc,2013\}$?
The infinite sequence of 2's and 3's \[\begin{array}{l}2,3,3,2,3,3,3,2,3,3,3,2,3,3,2,3,3, \\ 3,2,3,3,3,2,3,3,3,2,3,3,2,3,3,3,2,\cdots \end{array}\] has the property that, if one forms a second sequence that records the number of 3's between successive 2's, the result is identical to the given sequence. Show that there exists a real number $r$ such that, for any $n$, the $n$th term of the sequence is 2 if and only if $n = 1+\lfloor rm \rfloor$ for some nonnegative integer $m$.
Let $a_1,a_2,\ldots,a_n,\ldots$ be any permutation of all positive integers. Prove that there exist infinitely many positive integers $i$ such that $\gcd(a_i,a_{i+1})\leq \frac{3}{4} i$.
Do there exist integers $a$ and $b$ such that :
(a) the equation $x^2 + ax + b = 0$ has no real roots, and the equation $\lfloor x^2 \rfloor + ax + b = 0$ has at
least one real root?
[i](2 points)[/i]
(b) the equation $x^2 + 2ax + b$ = 0 has no real roots, and the equation $\lfloor x^2 \rfloor + 2ax + b = 0$ has at
least one real root?
[i]3 points[/i]
(By $\lfloor k \rfloor$ we denote the integer part of $k$, that is, the greatest integer not exceeding $k$.)
[i]Alexandr Khrabrov[/i]
Let $m$ and $n$ be odd positive integers. Each square of an $m$ by $n$ board is coloured red or blue. A row is said to be red-dominated if there are more red squares than blue squares in the row. A column is said to be blue-dominated if there are more blue squares than red squares in the column. Determine the maximum possible value of the number of red-dominated rows plus the number of blue-dominated columns. Express your answer in terms of $m$ and $n$.
The sum of $\lfloor x \rfloor$ for all real numbers $x$ satisfying the equation $16 + 15x + 15x^2 = \lfloor x \rfloor ^3$ is:
Determine all real numbers $a$ such that \[4\lfloor an\rfloor =n+\lfloor a\lfloor an\rfloor \rfloor \; \text{for all}\; n \in \mathbb{N}.\]
How many positive integers less than $1998$ are relatively prime to $1547$? (Two integers are relatively prime if they have no common factors besides 1.)
Let $k\geqslant 2$ be an integer, and $a,b$ be real numbers. prove that $a-b$ is an integer divisible by $k$ if and only if for every positive integer $n$
$$\lfloor an \rfloor \equiv \lfloor bn \rfloor \ (mod \ k)$$
Proposed by Navid Safaei