Found problems: 1187
Show that the sequence $\{a_{n}\}_{n \ge 1}$ defined by $a_{n}=\lfloor n\sqrt{2}\rfloor$ contains an infinite number of integer powers of $2$.
Determine the absolute value of the sum \[ \lfloor 2013\sin{0^\circ} \rfloor + \lfloor 2013\sin{1^\circ} \rfloor + \cdots + \lfloor 2013\sin{359^\circ} \rfloor, \] where $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$.
(You may use the fact that $\sin{n^\circ}$ is irrational for positive integers $n$ not divisible by $30$.)
[i]Ray Li[/i]
Let $T=\text{TNFTPP}$, and let $R=T-914$. Let $x$ be the smallest real solution of \[3x^2+Rx+R=90x\sqrt{x+1}.\] Find the value of $\lfloor x\rfloor$.
Let $f(n)=n+\lfloor \sqrt{n}\rfloor$. Prove that, for every positive integer $m$, the sequence \[m, f(m), f(f(m)), f(f(f(m))), \cdots\] contains at least one square of an integer.
Find the maximum possible number of kings on a $12\times 12$ chess table so that each king attacks exactly one of the other kings (a king attacks only the squares that have a common point with the square he sits on).
Find the smallest positive integer $c$ for which the following statement holds: Let $k$ and $n$ be positive integers. Suppose there exist pairwise distinct subsets $S_1$, $S_2$, $\dots$, $S_{2k}$ of $\{1, 2, \dots, n\}$, such that $S_i \cap S_j \neq \varnothing$ and $S_i \cap S_{j+k} \neq \varnothing$ for all $1 \le i,j \le k$. Then $1000k \le c \cdot 2^n$.
[i]Proposed by Yang Liu[/i]
Compute \[\left\lfloor \dfrac{2007!+2004!}{2006!+2005!}\right\rfloor.\] (Note that $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$.)
For each real number $x$, $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$. For example $\lfloor 2.8 \rfloor = 2$. Let $r \ge 0$ be a real number such that for all integers $m, n, m|n$ implies $\lfloor mr \rfloor| \lfloor nr \rfloor$. Prove that $r$ is an integer.
Prove that there is no positive rational number $x$ such that \[x^{\lfloor x\rfloor }=\frac{9}{2}.\]
Ten women sit in $ 10$ seats in a line. All of the $ 10$ get up and then reseat themselves using all $ 10$ seats, each sitting in the seat she was in before or a seat next to the one she occupied before. In how many ways can the women be reseated?
$ \textbf{(A)}\ 89\qquad
\textbf{(B)}\ 90\qquad
\textbf{(C)}\ 120\qquad
\textbf{(D)}\ 2^{10}\qquad
\textbf{(E)}\ 2^2 3^8$
Let two natural number $n > 1$ and $m$ be given. Find the least positive integer $k$ which has the following property: Among $k$ arbitrary integers $a_1, a_2, \ldots, a_k$ satisfying the condition $a_i - a_j$ ( $1 \leq i < j \leq k$) is not divided by $n$, there exist two numbers $a_p, a_s$ ($p \neq s$) such that $m + a_p - a_s$ is divided by $n$.
Let $r\geq1$ be areal number that holds with the property that for each pair of positive integer numbers $m$ and $n$, with $n$ a multiple of $m$, it is true that $\lfloor{nr}\rfloor$ is multiple of $\lfloor{mr}\rfloor$. Show that $r$ has to be an integer number.
[b]Note: [/b][i]If $x$ is a real number, $\lfloor{x}\rfloor$ is the greatest integer lower than or equal to $x$}.[/i]
At what index the harmonic series has a fractional part of $ 1/12? $
Given an integer $n \geq 2$ determine the integral part of the number
$ \sum_{k=1}^{n-1} \frac {1} {({1+\frac{1} {n}}) \dots ({1+\frac {k} {n})}}$ - $\sum_{k=1}^{n-1} (1-\frac {1} {n}) \dots(1-\frac{k}{n})$
Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.
A total of $n$ people compete in a mathematical match which contains $15$ problems where $n>12$. For each problem, $1$ point is given for a right answer and $0$ is given for a wrong answer. Analysing each possible situation, we find that if the sum of points every group of $12$ people get is no less than $36$, then there are at least $3$ people that got the right answer of a certain problem, among the $n$ people. Find the least possible $n$.
Show that there is a natural number $n$ such that $n!$ when written in decimal notation ends exactly in 1993 zeros.
How many four-digit multiples of $8$ are greater than $2008$?
Find the number of ending zeros of $2014!$ in base 9. Give your answer in base 9.
The sequence of numbers $a_1, a_2, a_3, ...$ is defined recursively by $a_1 = 1, a_{n + 1} = \lfloor \sqrt{a_1+a_2+...+a_n} \rfloor $ for $n \ge 1$. Find all numbers that appear more than twice at this sequence.
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. \]
The sequence $ \{a_n \} $ is defined as follows: $ a_0 = 1 $ and $ {a_n} = \sum \limits_ {k = 1} ^ {[\sqrt n]} {{a_ {n - {k ^ 2 }}}} $ for $ n \ge 1. $
Prove that among $ a_1, a_2, \ldots, a_ {10 ^ 6} $ there are at least $500$ even numbers.
(Here, $ [x] $ is the largest integer not exceeding $ x $.)
In chess tournament participates $n$ participants ($n >1$). In tournament each of participants plays with each other exactly $1$ game. For each game participant have $1$ point if he wins game, $0,5$ point if game is drow and $0$ points if he lose game.
If after ending of tournament participant have at least $ 75 %
$ of maximum possible points he called $winner$ $of$ $tournament$.
Find maximum possible numbers of $winners$ $of$ $tournament$.
Find the number of positive integers $n \le 2014$ such that there exists integer $x$ that satisfies the condition that $\frac{x+n}{x-n}$ is an odd perfect square.
Prove that for all natural numbers $n$, \[ \sum_{k=1}^{n^2} \left\{ \sqrt{k} \right\} \le \frac{n^2-1}{2}. \] Here, $\{x\}$ denotes the fractional part of $x$.