Found problems: 1187
2018 Dutch IMO TST, 3
Let $n \ge 0$ be an integer. A sequence $a_0,a_1,a_2,...$ of integers is de fined as follows:
we have $a_0 = n$ and for $k \ge 1, a_k$ is the smallest integer greater than $a_{k-1}$ for which $a_k +a_{k-1}$ is the square of an integer.
Prove that there are exactly $\lfloor \sqrt{2n}\rfloor$ positive integers that cannot be written in the form $a_k - a_{\ell}$ with $k > \ell\ge 0$.
1981 Canada National Olympiad, 5
$11$ theatrical groups participated in a festival. Each day, some of the groups were scheduled to perform while the remaining groups joined the general audience. At the conclusion of the festival, each group had seen, during its days off, at least $1$ performance of every other group. At least how many days did the festival last?
2004 Gheorghe Vranceanu, 3
Let $ a,b,c $ be real numbers satisfying $ \left\lfloor a^2+b^2+c^2 \right\rfloor \le\lfloor ab+bc+ca \rfloor . $ Show that:
$$ 2 >\max\left\{ \left| -2a+b+c \right| ,\left| a-2b+c \right| ,\left| a+b-2c \right| \right\} $$
[i]Merticaru[/i]
2008 ITest, 44
Now Wendy wanders over and joins Dr. Lisi and her younger siblings. Thinking she knows everything there is about how to work with arithmetic series, she nearly turns right around to walk back home when Dr. Lisi poses a more challenging problem. "Suppose I select two distinct terms at random from the $2008$ term sequence. What's the probability that their product is positive?" If $a$ and $b$ are relatively prime positive integers such that $a/b$ is the probability that the product of the two terms is positive, find the value of $a+b$.
2006 AMC 12/AHSME, 20
Let $ x$ be chosen at random from the interval $ (0,1)$. What is the probability that
\[ \lfloor\log_{10}4x\rfloor \minus{} \lfloor\log_{10}x\rfloor \equal{} 0?
\]Here $ \lfloor x\rfloor$ denotes the greatest integer that is less than or equal to $ x$.
$ \textbf{(A) } \frac 18 \qquad \textbf{(B) } \frac 3{20} \qquad \textbf{(C) } \frac 16 \qquad \textbf{(D) } \frac 15 \qquad \textbf{(E) } \frac 14$
2014 China Girls Math Olympiad, 2
Let $x_1,x_2,\ldots,x_n $ be real numbers, where $n\ge 2$ is a given integer, and let $\lfloor{x_1}\rfloor,\lfloor{x_2}\rfloor,\ldots,\lfloor{x_n}\rfloor $ be a permutation of $1,2,\ldots,n$.
Find the maximum and minimum of $\sum\limits_{i=1}^{n-1}\lfloor{x_{i+1}-x_i}\rfloor$ (here $\lfloor x\rfloor $ is the largest integer not greater than $x$).
2013 Hanoi Open Mathematics Competitions, 3
What is the largest integer not exceeding $8x^3 +6x - 1$, where $x =\frac12 \left(\sqrt[3]{2+\sqrt5} + \sqrt[3]{2-\sqrt5}\right)$ ?
(A): $1$, (B): $2$, (C): $3$, (D): $4$, (E) None of the above.
1997 South africa National Olympiad, 6
Six points are connected in pairs by lines, each of which is either red or blue. Every pair of points is joined. Determine whether there must be a closed path having four sides all of the same colour. (A path is closed if it begins and ends at the same point.)
2012 ELMO Shortlist, 6
Prove that if $a$ and $b$ are positive integers and $ab>1$, then
\[\left\lfloor\frac{(a-b)^2-1}{ab}\right\rfloor=\left\lfloor\frac{(a-b)^2-1}{ab-1}\right\rfloor.\]Here $\lfloor x\rfloor$ denotes the greatest integer not exceeding $x$.
[i]Calvin Deng.[/i]
2001 AIME Problems, 10
How many positive integer multiples of 1001 can be expressed in the form $10^{j}-10^{i}$, where $i$ and $j$ are integers and $0\leq i < j \leq 99$?
2017 Taiwan TST Round 3, 1
Let $\{a_n\}_{n\geq 0}$ be an arithmetic sequence with difference $d$ and $1\leq a_0\leq d$. Denote the sequence as $S_0$, and define $S_n$ recursively by two operations below:
Step $1$: Denote the first number of $S_n$ as $b_n$, and remove $b_n$.
Step $2$: Add $1$ to the first $b_n$ numbers to get $S_{n+1}$.
Prove that there exists a constant $c$ such that $b_n=[ca_n]$ for all $n\geq 0$, where $[]$ is the floor function.
2019 PUMaC Algebra A, 8
For real numbers $a$ and $b$, define the sequence $\{x_{a,b}(n)\}$ as follows: $x_{a,b}(1)=a$, $x_{a,b}(2)=b$, and for $n>1$, $x_{a,b}(n+1)=(x_{a+b}(n-1))^2+(x_{a,b}(n))^2$. For real numbers $c$ and $d$, define the sequence $\{y_{c,d}(n)\}$ as follows: $y_{c,d}(1)=c$, $y_{c,d}(2)=d$, and for $n>1$, $y_{c,d}(n+1)=(y_{c,d}(n-1)+y_{c,d}(n))^2$. Call $(a,b,c)$ a good triple if there exists $d$ such that for all $n$ sufficiently large, $y_{c,d}(n)=(x_{a,b}(n))^2$. For some $(a,b)$ there are exactly three values of $c$ that make $(a,b,c)$ a good triple. Among these pairs $(a,b)$, compute the maximum value of $\lfloor 100(a+b)\rfloor$.
2019 PUMaC Team Round, 5
Let $f(x) = x^3 + 3x^2 + 1$. There is a unique line of the form $y = mx + b$ such that $m > 0$ and this line intersects $f(x)$ at three points, $A, B, C$ such that $AB = BC = 2$. Find $\lfloor 100m \rfloor$.
1992 IMO Longlists, 43
Find the number of positive integers $n$ satisfying $\phi(n) | n$ such that
\[\sum_{m=1}^{\infty} \left( \left[ \frac nm \right] - \left[\frac{n-1}{m} \right] \right) = 1992\]
What is the largest number among them? As usual, $\phi(n)$ is the number of positive integers less than or equal to $n$ and relatively prime to $n.$
1985 IMO Longlists, 23
Let $\mathbb N = {1, 2, 3, . . .}$. For real $x, y$, set $S(x, y) = \{s | s = [nx+y], n \in \mathbb N\}$. Prove that if $r > 1$ is a rational number, there exist real numbers $u$ and $v$ such that
\[S(r, 0) \cap S(u, v) = \emptyset, S(r, 0) \cup S(u, v) = \mathbb N.\]
2007 India IMO Training Camp, 1
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]
2003 Gheorghe Vranceanu, 1
Solve in $ \mathbb{R}^2 $ the equation $ \lfloor x/y-y/x \rfloor =x^2/y+y/x^2. $
1992 AIME Problems, 15
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?
2006 Brazil National Olympiad, 6
Professor Piraldo takes part in soccer matches with a lot of goals and judges a match in his own peculiar way. A match with score of $m$ goals to $n$ goals, $m\geq n$, is [i]tough[/i] when $m\leq f(n)$, where $f(n)$ is defined by $f(0) = 0$ and, for $n \geq 1$, $f(n) = 2n-f(r)+r$, where $r$ is the largest integer such that $r < n$ and $f(r) \leq n$.
Let $\phi ={1+\sqrt 5\over 2}$. Prove that a match with score of $m$ goals to $n$, $m\geq n$, is tough if $m\leq \phi n$ and is not tough if $m \geq \phi n+1$.
2013 APMO, 3
For $2k$ real numbers $a_1, a_2, ..., a_k$, $b_1, b_2, ..., b_k$ define a sequence of numbers $X_n$ by \[
X_n = \sum_{i=1}^k [a_in + b_i] \quad (n=1,2,...).
\] If the sequence $X_N$ forms an arithmetic progression, show that $\textstyle\sum_{i=1}^k a_i$ must be an integer. Here $[r]$ denotes the greatest integer less than or equal to $r$.
2003 Romania Team Selection Test, 4
Prove that among the elements of the sequence $\left\{ \left\lfloor n\sqrt{2003} \right\rfloor \right\}_{n\geq 1}$ one can find a geometric progression having any number of terms, and having the ratio bigger than $k$, where $k$ can be any positive integer.
[i]Radu Gologan[/i]
2023 4th Memorial "Aleksandar Blazhevski-Cane", P1
Let $a, b, c, d$ be integers. Prove that for any positive integer $n$, there are at least $\left \lfloor{\frac{n}{4}}\right \rfloor $ positive integers $m \leq n$ such that $m^5 + dm^4 + cm^3 + bm^2 + 2023m + a$ is not a perfect square.
[i]Proposed by Ilir Snopce[/i]
2008 Thailand Mathematical Olympiad, 3
Find all positive real solutions to the equation
$x+\left\lfloor\frac x3\right\rfloor=\left\lfloor\frac{2x}3\right\rfloor+\left\lfloor\frac{3x}5\right\rfloor$
1976 IMO Longlists, 13
A sequence $(u_{n})$ is defined by \[ u_{0}=2 \quad u_{1}=\frac{5}{2}, u_{n+1}=u_{n}(u_{n-1}^{2}-2)-u_{1} \quad \textnormal{for } n=1,\ldots \] Prove that for any positive integer $n$ we have \[ [u_{n}]=2^{\frac{(2^{n}-(-1)^{n})}{3}} \](where $[x]$ denotes the smallest integer $\leq x)$
2009 Federal Competition For Advanced Students, P2, 2
(i) For positive integers $a<b$, let $M(a,b)=\frac{\Sigma^{b}_{k=a}\sqrt{k^2+3k+3}}{b-a+1}$.
Calculate $[M(a,b)]$
(ii) Calculate $N(a,b)=\frac{\Sigma^{b}_{k=a}[\sqrt{k^2+3k+3}]}{b-a+1}$.