Found problems: 1187
Find all real solutions $x$ to the equation $\lfloor x^2 - 2x \rfloor + 2\lfloor x \rfloor = \lfloor x \rfloor^2$.
Let $n$ be an integer greater than $1$. Define
\[x_1 = n, y_1 = 1, x_{i+1} =\left[ \frac{x_i+y_i}{2}\right] , y_{i+1} = \left[ \frac{n}{x_{i+1}}\right], \qquad \text{for }i = 1, 2, \ldots\ ,\]
where $[z]$ denotes the largest integer less than or equal to $z$. Prove that
\[ \min \{x_1, x_2, \ldots, x_n \} =[ \sqrt n ]\]
Find the integer represented by $\left[ \sum_{n=1}^{10^9} n^{-2/3} \right] $. Here $[x]$ denotes the greatest integer less than or equal to $x.$
Consider the numbers $a,b, \alpha, \beta \in \mathbb{R}$ and the sets $$A=\left \{x \in \mathbb{R} : x^2+a|x|+b=0 \right \},$$ $$B=\left \{ x \in \mathbb{R} : \lfloor x \rfloor^2 + \alpha \lfloor x \rfloor + \beta = 0\right \}.$$
If $A \cap B$ has exactly three elements, prove that $a$ cannot be an integer.
If $p$ is an odd prime, prove that \[{k \choose p}\equiv \left\lfloor \frac{k}{p}\right\rfloor \pmod{p}.\]
Let $p$ be a prime with $p>5$, and let $S=\{p-n^2 \vert n \in \mathbb{N}, {n}^{2}<p \}$. Prove that $S$ contains two elements $a$ and $b$ such that $a \vert b$ and $1<a<b$.
Determine all real-coefficient polynomials $P(x)$ such that
\[ P(\lfloor x \rfloor) = \lfloor P(x) \rfloor \]for every real numbers $x$.
If $\lfloor x\rfloor$ is the greatest integer less than or equal to $x$, then \[\displaystyle\sum_{N=1}^{1024} \lfloor \log_{2}N\rfloor = \]
$ \textbf{(A)}\ 8192\qquad\textbf{(B)}\ 8204\qquad\textbf{(C)}\ 9218\qquad\textbf{(D)}\ \lfloor \log_{2}(1024!)\rfloor\qquad\textbf{(E)}\ \text{none of these} $
Solve the system of equations
$$\begin{cases} x^2+ [y]=10
\\ y^2+[x]=13
\end{cases}$$
($[x]$ is the integer part of $x$, $[x]$ is equal to the largest integer not exceeding $x$. For example, $[3,33] = 3$, $[2] = 2$, $[- 3.01] = -4$).
Find the number of integers $n$ for which $n^2+10n<2008$.
Find all real $x > 0$ and integer $n > 0$ so that $$ \lfloor x \rfloor+\left\{ \frac{1}{x}\right\}= 1.005 \cdot n.$$
Define a positive integer $ n$ to be a factorial tail if there is some positive integer $ m$ such that the decimal representation of $ m!$ ends with exactly $ n$ zeroes. How many positive integers less than $ 1992$ are not factorial tails?
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}$
Given a sequence $ (c_n) $ of natural numbers defined recursively: $ c_1 = 2 $, $ c_{n+1} = \left[ \frac{3}{2}c_n\right] $. Prove that there are infinitely many even numbers and infinitely many odd numbers among the terms of this sequence.
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]
Prove that $\lfloor \sqrt[3]{n}+\sqrt[3]{n+1}+\sqrt[3]{n+2}\rfloor =\lfloor \sqrt[3]{27n+26}\rfloor$ for all positive integers $n$.
Find the highest power of 3 dividing $\dbinom{666}{333}$.
Let \[S=\sqrt{1+\dfrac1{1^2}+\dfrac1{2^2}}+\sqrt{1+\dfrac1{2^2}+\dfrac1{3^2}}+\cdots+\sqrt{1+\dfrac1{2007^2}+\dfrac1{2008^2}}.\] Compute $\lfloor S^2\rfloor$.
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).
How many positive integers are there such that $\left \lfloor \frac m{11} \right \rfloor = \left \lfloor \frac m{10} \right \rfloor$? ($\left \lfloor x \right \rfloor$ denotes the greatest integer not exceeding $x$.)
$
\textbf{(A)}\ 44
\qquad\textbf{(B)}\ 48
\qquad\textbf{(C)}\ 52
\qquad\textbf{(D)}\ 54
\qquad\textbf{(E)}\ 56
$
Let $R$ be the region in the Cartesian plane of points $(x,y)$ satisfying $x\geq 0$, $y\geq 0$, and $x+y+\lfloor x\rfloor+\lfloor y\rfloor\leq 5$. Determine the area of $R$.
The number of postive integers less than $1000$ divisible by neither $5$ nor $7$ is:
$\text{(A)}\ 688 \qquad
\text{(B)}\ 686\qquad
\text{(C)}\ 684 \qquad
\text{(D)}\ 658\qquad
\text{(E)}\ 630$
Let $ a$ and $ b$ be natural numbers such that
\[ \frac{a}{b}=1-\frac{1}{2}+\frac{1}{3}-\frac{1}{4}+\cdots-\frac{1}{1318}+\frac{1}{1319}. \]
Prove that $ a$ is divisible by $ 1979$.
Find all positive integer number $n$ such that $[\sqrt{n}]-2$ divides $n-4$ and $[\sqrt{n}]+2$ divides $n+4$. Note: $[r]$ denotes the integer part of $r$.
Let $AXYZB$ be a convex pentagon inscribed in a semicircle with diameter $AB$. Suppose that $AZ-AX=6$, $BX-BZ=9$, $AY=12$, and $BY=5$. Find the greatest integer not exceeding the perimeter of quadrilateral $OXYZ$, where $O$ is the midpoint of $AB$.
[i]Proposed by Evan Chen[/i]