Found problems: 1187
2005 Romania Team Selection Test, 3
Let $n\geq 0$ be an integer and let $p \equiv 7 \pmod 8$ be a prime number. Prove that
\[ \sum^{p-1}_{k=1} \left \{ \frac {k^{2^n}}p - \frac 12 \right\} = \frac {p-1}2 . \]
[i]Călin Popescu[/i]
2001 AIME Problems, 2
Each of the 2001 students at a high school studies either Spanish or French, and some study both. The number who study Spanish is between 80 percent and 85 percent of the school population, and the number who study French is between 30 percent and 40 percent. Let $m$ be the smallest number of students who could study both languages, and let $M$ be the largest number of students who could study both languages. Find $M-m$.
2013 USA TSTST, 2
A finite sequence of integers $a_1, a_2, \dots, a_n$ is called [i]regular[/i] if there exists a real number $x$ satisfying \[ \left\lfloor kx \right\rfloor = a_k \quad \text{for } 1 \le k \le n. \] Given a regular sequence $a_1, a_2, \dots, a_n$, for $1 \le k \le n$ we say that the term $a_k$ is [i]forced[/i] if the following condition is satisfied: the sequence \[ a_1, a_2, \dots, a_{k-1}, b \] is regular if and only if $b = a_k$. Find the maximum possible number of forced terms in a regular sequence with $1000$ terms.
2014 Online Math Open Problems, 18
We select a real number $\alpha$ uniformly and at random from the interval $(0,500)$. Define \[ S = \frac{1}{\alpha} \sum_{m=1}^{1000} \sum_{n=m}^{1000} \left\lfloor \frac{m+\alpha}{n} \right\rfloor. \] Let $p$ denote the probability that $S \ge 1200$. Compute $1000p$.
[i]Proposed by Evan Chen[/i]
MathLinks Contest 2nd, 6.1
Determine the parity of the positive integer $N$, where $$N = \lfloor \frac{2002!}{2001 \cdot2003} \rfloor.$$
2004 Turkey Team Selection Test, 1
Find all possible values of $x-\lfloor x\rfloor$ if $\sin \alpha = 3/5$ and $x=5^{2003}\sin {(2004\alpha)}$.
2010 Romania Team Selection Test, 4
Let $X$ and $Y$ be two finite subsets of the half-open interval $[0, 1)$ such that $0 \in X \cap Y$ and $x + y = 1$ for no $x \in X$ and no $y \in Y$. Prove that the set $\{x + y - \lfloor x + y \rfloor : x \in X \textrm{ and } y \in Y\}$ has at least $|X| + |Y| - 1$ elements.
[i]***[/i]
2015 International Zhautykov Olympiad, 1
Determine the maximum integer $ n $ such that for each positive integer $ k \le \frac{n}{2} $ there are two positive divisors of $ n $ with difference $ k $.
2019 EGMO, 5
Let $n\ge 2$ be an integer, and let $a_1, a_2, \cdots , a_n$ be positive integers. Show that there exist positive integers $b_1, b_2, \cdots, b_n$ satisfying the following three conditions:
$\text{(A)} \ a_i\le b_i$ for $i=1, 2, \cdots , n;$
$\text{(B)} \ $ the remainders of $b_1, b_2, \cdots, b_n$ on division by $n$ are pairwise different; and
$\text{(C)} \ $ $b_1+b_2+\cdots b_n \le n\left(\frac{n-1}{2}+\left\lfloor \frac{a_1+a_2+\cdots a_n}{n}\right \rfloor \right)$
(Here, $\lfloor x \rfloor$ denotes the integer part of real number $x$, that is, the largest integer that does not exceed $x$.)
2012 IMC, 4
Let $n \ge 2$ be an integer. Find all real numbers $a$ such that there exist real numbers $x_1,x_2,\dots,x_n$ satisfying
\[x_1(1-x_2)=x_2(1-x_3)=\dots=x_n(1-x_1)=a.\]
[i]Proposed by Walther Janous and Gerhard Kirchner, Innsbruck.[/i]
2005 MOP Homework, 2
Find all real numbers $x$ such that
$\lfloor x^2-2x \rfloor+2\lfloor x \rfloor=\lfloor x \rfloor^2$.
(For a real number $x$, $\lfloor x \rfloor$ denote the greatest integer less than or equal to $x$.)
1996 Abels Math Contest (Norwegian MO), 2
Prove that $[\sqrt{n}+\sqrt{n+1}]=[\sqrt{4n+1}]$ for all $n \in N$.
2007 Iran MO (3rd Round), 8
In this question you must make all numbers of a clock, each with using 2, exactly 3 times and Mathematical symbols. You are not allowed to use English alphabets and words like $ \sin$ or $ \lim$ or $ a,b$ and no other digits.
[img]http://i2.tinypic.com/5x73dza.png[/img]
2020 Lusophon Mathematical Olympiad, 6
Prove that $\lfloor{\sqrt{9n+7}}\rfloor=\lfloor{\sqrt{n}+\sqrt{n+1}+\sqrt{n+2}}\rfloor$ for all postive integer $n$.
1998 USAMO, 6
Let $n \geq 5$ be an integer. Find the largest integer $k$ (as a function of $n$) such that there exists a convex $n$-gon $A_{1}A_{2}\dots A_{n}$ for which exactly $k$ of the quadrilaterals $A_{i}A_{i+1}A_{i+2}A_{i+3}$ have an inscribed circle. (Here $A_{n+j} = A_{j}$.)
2018 Mathematical Talent Reward Programme, MCQ: P 2
$\lim _{x \rightarrow 0^{+}} \frac{[x]}{\tan x}$ where $[x]$ is the greatest integer function
[list=1]
[*] -1
[*] 0
[*] 1
[*] Does not exists
[/list]
2012 Postal Coaching, 3
Given an integer $n\ge 2$, prove that
\[\lfloor \sqrt n \rfloor + \lfloor \sqrt[3]n\rfloor + \cdots +\lfloor \sqrt[n]n\rfloor = \lfloor \log_2n\rfloor + \lfloor \log_3n\rfloor + \cdots +\lfloor \log_nn\rfloor\].
[hide="Edit"] Thanks to shivangjindal for pointing out the mistake (and sorry for the late edit)[/hide]
2014 Olympic Revenge, 2
$a)$ Let $n$ a positive integer. Prove that $gcd(n, \lfloor n\sqrt{2} \rfloor)<\sqrt[4]{8}\sqrt{n}$.
$b)$ Prove that there are infinitely many positive integers $n$ such that $gcd(n, \lfloor n\sqrt{2} \rfloor)>\sqrt[4]{7.99}\sqrt{n}$.
2011 Germany Team Selection Test, 2
Let $n$ be a positive integer prove that $$6\nmid \lfloor (\sqrt[3]{28}-3)^{-n} \rfloor.$$
2007 ITest, 40
Let $S$ be the sum of all $x$ such that $1\leq x\leq 99$ and \[\{x^2\}=\{x\}^2.\] Compute $\lfloor S\rfloor$.
2011 Math Prize for Girls Olympiad, 1
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$.)
1985 ITAMO, 10
How many of the first 1000 positive integers can be expressed in the form
\[ \lfloor 2x \rfloor + \lfloor 4x \rfloor + \lfloor 6x \rfloor + \lfloor 8x \rfloor, \]
where $x$ is a real number, and $\lfloor z \rfloor$ denotes the greatest integer less than or equal to $z$?
1948 Putnam, B3
Prove that $[\sqrt{n}+\sqrt{n+1}]=[\sqrt{4n+1}]$ for all $n \in N$.
PEN A Problems, 28
Prove that the expression \[\frac{\gcd(m, n)}{n}{n \choose m}\] is an integer for all pairs of positive integers $(m, n)$ with $n \ge m \ge 1$.
2012 BMT Spring, 5
Let $p > 1$ be relatively prime to $10$. Let $n$ be any positive number and$ d$ be the last digit of $n$. Define $f(n) = \lfloor \frac{n}{10} \rfloor + d \cdot m$. Then, we can call $m$ a [i]divisibility multiplier[/i] for $p$, if $f(n)$ is divisible by $p$ if and only if $n$ is divisible by $p$. Find a divisibility multiplier for $2013$.