Found problems: 1187
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.
1995 Poland - Second Round, 3
Let $a,b,c,d$ be positive irrational numbers with $a+b = 1$.
Show that $c+d = 1$ if and only if $[na]+[nb] = [nc]+[nd]$ for all positive integers $n$.
2018 Chile National Olympiad, 4
Find all postitive integers n such that
$$\left\lfloor \frac{n}{2} \right\rfloor \cdot \left\lfloor \frac{n}{3} \right\rfloor \cdot \left\lfloor \frac{n}{4} \right\rfloor=n^2$$
where $\lfloor x \rfloor$ represents the largest integer less than the real number $x$.
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]
2014 JBMO Shortlist, 3
For a positive integer $n$, two payers $A$ and $B$ play the following game: Given a pile of $s$ stones, the players take turn alternatively with $A$ going first. On each turn the player is allowed to take either one stone, or a prime number of stones, or a positive multiple of $n$ stones. The winner is the one who takes the last stone. Assuming both $A$ and $B$ play perfectly, for how many values of $s$ the player $A$ cannot win?
2012 ELMO Shortlist, 2
Determine whether it's possible to cover a $K_{2012}$ with
a) 1000 $K_{1006}$'s;
b) 1000 $K_{1006,1006}$'s.
[i]David Yang.[/i]
2015 AMC 10, 23
Let $n$ be a positive integer greater than 4 such that the decimal representation of $n!$ ends in $k$ zeros and the decimal representation of $(2n)!$ ends in $3k$ zeros. Let $s$ denote the sum of the four least possible values of $n$. What is the sum of the digits of $s$?
$ \textbf{(A) }7\qquad\textbf{(B) }8\qquad\textbf{(C) }9\qquad\textbf{(D) }10\qquad\textbf{(E) }11 $
2012 Iran MO (3rd Round), 2
Prove that there exists infinitely many pairs of rational numbers $(\frac{p_1}{q},\frac{p_2}{q})$ with $p_1,p_2,q\in \mathbb N$ with the following condition:
\[|\sqrt{3}-\frac{p_1}{q}|<q^{-\frac{3}{2}}, |\sqrt{2}-\frac{p_2}{q}|< q^{-\frac{3}{2}}.\]
[i]Proposed by Mohammad Gharakhani[/i]
2010 ELMO Shortlist, 4
Let $-2 < x_1 < 2$ be a real number and define $x_2, x_3, \ldots$ by $x_{n+1} = x_n^2-2$ for $n \geq 1$. Assume that no $x_n$ is $0$ and define a number $A$, $0 \leq A \leq 1$ in the following way: The $n^{\text{th}}$ digit after the decimal point in the binary representation of $A$ is a $0$ if $x_1x_2\cdots x_n$ is positive and $1$ otherwise. Prove that $A = \frac{1}{\pi}\cos^{-1}\left(\frac{x_1}{2}\right)$.
[i]Evan O' Dorney.[/i]
2023 OlimphÃada, 1
Let $n \geq 2023$ be an integer. For each real $x$, we say that $\lfloor x \rceil$ is the closest integer to $x$, and if there are two closest integers then it is the greater of the two. Suppose there is a positive real $a$ such that $$\lfloor an \rceil = n + \bigg\lfloor\frac{n}{a} \bigg\rceil.$$
Show that $|a^2 - a - 1| < \frac{n\varphi+1}{n^2}$.
VI Soros Olympiad 1999 - 2000 (Russia), 9.2
Solve the equation $[x]\{x\} = 1999x$, where $[x]$ denotes the largest integer less than or equal to $x$, and $\{x\} = x -[x] $
2016 Germany Team Selection Test, 1
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.
2012 Online Math Open Problems, 33
You are playing a game in which you have $3$ envelopes, each containing a uniformly random amount of money between $0$ and $1000$ dollars. (That is, for any real $0 \leq a < b \leq 1000$, the probability that the amount of money in a given envelope is between $a$ and $b$ is $\frac{b-a}{1000}$.) At any step, you take an envelope and look at its contents. You may choose either to keep the envelope, at which point you finish, or discard it and repeat the process with one less envelope. If you play to optimize your expected winnings, your expected winnings will be $E$. What is $\lfloor E\rfloor,$ the greatest integer less than or equal to $E$?
[i]Author: Alex Zhu[/i]
2002 Czech-Polish-Slovak Match, 1
Let $a, b$ be distinct real numbers and $k,m$ be positive integers $k + m = n \ge 3, k \le 2m, m \le 2k$. Consider sequences $x_1,\dots , x_n$ with the following properties:
(i) $k$ terms $x_i$, including $x_1$, are equal to $a$;
(ii) $m$ terms $x_i$, including $x_n$, are equal to $b$;
(iii) no three consecutive terms are equal.
Find all possible values of $x_nx_1x_2 + x_1x_2x_3 + \cdots + x_{n-1}x_nx_1$.
1978 IMO Longlists, 27
Determine the sixth number after the decimal point in the number $(\sqrt{1978} +\lfloor\sqrt{1978}\rfloor)^{20}$
1988 China Team Selection Test, 4
Let $k \in \mathbb{N},$ $S_k = \{(a, b) | a, b = 1, 2, \ldots, k \}.$ Any two elements $(a, b)$, $(c, d)$ $\in S_k$ are called "undistinguishing" in $S_k$ if $a - c \equiv 0$ or $\pm 1 \pmod{k}$ and $b - d \equiv 0$ or $\pm 1 \pmod{k}$; otherwise, we call them "distinguishing". For example, $(1, 1)$ and $(2, 5)$ are undistinguishing in $S_5$. Considering the subset $A$ of $S_k$ such that the elements of $A$ are pairwise distinguishing. Let $r_k$ be the maximum possible number of elements of $A$.
(i) Find $r_5$.
(ii) Find $r_7$.
(iii) Find $r_k$ for $k \in \mathbb{N}$.
2007 Gheorghe Vranceanu, 2
Let be a function $ f:(0,\infty )\longrightarrow\mathbb{R} $ satisfying the following two properties:
$ \text{(i) } 2\lfloor x \rfloor \le f(x) \le 2 \lfloor x \rfloor +2,\quad\forall x\in (0,\infty ) $
$ \text{(ii) } f\circ f $ is monotone
Can $ f $ be non-monotone? Justify.
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.
2001 Pan African, 2
Let $n$ be a positive integer. A child builds a wall along a line with $n$ identical cubes. He lays the first cube on the line and at each subsequent step, he lays the next cube either on the ground or on the top of another cube, so that it has a common face with the previous one. How many such distinct walls exist?
2000 Taiwan National Olympiad, 2
Let $n$ be a positive integer and $A=\{ 1,2,\ldots ,n\}$. A subset of $A$ is said to be connected if it consists of one element or several consecutive elements. Determine the maximum $k$ for which there exist $k$ distinct subsets of $A$ such that the intersection of any two of them is connected.
PEN M Problems, 9
An integer sequence $\{a_{n}\}_{n \ge 1}$ is defined by \[a_{1}=2, \; a_{n+1}=\left\lfloor \frac{3}{2}a_{n}\right\rfloor.\] Show that it has infinitely many even and infinitely many odd integers.
PEN G Problems, 20
You are given three lists A, B, and C. List A contains the numbers of the form $10^{k}$ in base 10, with $k$ any integer greater than or equal to 1. Lists B and C contain the same numbers translated into base 2 and 5 respectively: \[\begin{array}{lll}A & B & C \\ 10 & 1010 & 20 \\ 100 & 1100100 & 400 \\ 1000 & 1111101000 & 13000 \\ \vdots & \vdots & \vdots \end{array}.\] Prove that for every integer $n > 1$, there is exactly one number in exactly one of the lists B or C that has exactly $n$ digits.
2009 Kyrgyzstan National Olympiad, 5
Prove for all natural $n$ that $\left. {{{40}^n} \cdot n!} \right|(5n)!$
2008 Germany Team Selection Test, 1
Show that there is a digit unequal to 2 in the decimal represesentation of $ \sqrt [3]{3}$ between the $ 1000000$-th und $ 3141592$-th position after decimal point.
2001 JBMO ShortLists, 13
At a conference there are $n$ mathematicians. Each of them knows exactly $k$ fellow mathematicians. Find the smallest value of $k$ such that there are at least three mathematicians that are acquainted each with the other two.
[color=#BF0000]Rewording of the last line for clarification:[/color]
Find the smallest value of $k$ such that there (always) exists $3$ mathematicians $X,Y,Z$ such that $X$ and $Y$ know each other, $X$ and $Z$ know each other and $Y$ and $Z$ know each other.