Olympiad problems

2010 Hong kong National Olympiad, 3

Let $n$ be a positive integer. Let $a$ be an integer such that $\gcd (a,n)=1$. Prove that \[\frac{a^{\phi (n)}-1}{n}=\sum_{i\in R}\frac{1}{ai}\left[\frac{ai}{n}\right]\pmod{n}\] where $R$ is the reduced residue system of $n$ with each element a positive integer at most $n$.

2019 HMNT, 5

Tags: ceiling function , floor function , algebra

Compute the sum of all positive real numbers $x \le 5$ satisfying $$x =\frac{ \lceil x^2 \rceil + \lceil x \rceil \cdot \lfloor x \rfloor}{ \lceil x\rceil + \lfloor x \rfloor}$$

1962 Dutch Mathematical Olympiad, 4

Tags: floor function , number theory , digit , last digit

Write using with the floor function: the last, the second last, and the first digit of the number $n$ written in the decimal system.

2005 AIME Problems, 9

Tags: trigonometry , floor function , modular arithmetic , complex number

For how many positive integers $n$ less than or equal to $1000$ is \[(\sin t + i \cos t)^n=\sin nt + i \cos nt\] true for all real $t$?

2014 JBMO Shortlist, 3

Tags: floor function , modular arithmetic , limit , combinatorics , logarithm

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?

2005 China Team Selection Test, 1

Tags: function , floor function , inequalities

Find all positive integers $m$ and $n$ such that the inequality: \[ [ (m+n) \alpha ] + [ (m+n) \beta ] \geq [ m \alpha ] + [n \beta] + [ n(\alpha+\beta)] \] is true for any real numbers $\alpha$ and $\beta$. Here $[x]$ denote the largest integer no larger than real number $x$.

2002 All-Russian Olympiad, 4

Tags: floor function , pigeonhole principle , inequalities , number theory

From the interval $(2^{2n},2^{3n})$ are selected $2^{2n-1}+1$ odd numbers. Prove that there are two among the selected numbers, none of which divides the square of the other.

2001 Austrian-Polish Competition, 6

Tags: floor function , sequence , integer , algebra , number theory

Let $k$ be a fixed positive integer. Consider the sequence definited by \[a_{0}=1 \;\; , a_{n+1}=a_{n}+\left\lfloor\root k \of{a_{n}}\right\rfloor \;\; , n=0,1,\cdots\] where $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$. For each $k$ find the set $A_{k}$ containing all integer values of the sequence $(\sqrt[k]{a_{n}})_{n\geq 0}$.

1982 All Soviet Union Mathematical Olympiad, 346

Tags: inequalities , algebra , floor function

Prove that the following inequality holds for all real $a$ and natural $n$: $$|a| \cdot |a-1|\cdot |a-2|\cdot ...\cdot |a-n| \ge \frac{n!F(a)}{2n}$$ $F(a)$ is the distance from $a$ to the closest integer.

2003 AIME Problems, 12

Tags: geometry , perimeter , floor function , trigonometry , circumcircle , trig identities , law of cosines

In convex quadrilateral $ABCD$, $\angle A \cong \angle C$, $AB = CD = 180$, and $AD \neq BC$. The perimeter of $ABCD$ is 640. Find $\lfloor 1000 \cos A \rfloor$. (The notation $\lfloor x \rfloor$ means the greatest integer that is less than or equal to $x$.)

2012 Harvard-MIT Mathematics Tournament, 5

Tags: hmmt , floor function

Find all ordered triples $(a,b,c)$ of positive reals that satisfy: $\lfloor a\rfloor bc=3,a\lfloor b\rfloor c=4$, and $ab\lfloor c\rfloor=5$, where $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$.

2013 China Northern MO, 5

Tags: algebra , floor function , solve equation

Find all non-integers $x$ such that $x+\frac{13}{x}=[x]+\frac{13}{[x]} . $where$[x]$ mean the greatest integer $n$ , where $n\leq x.$

1996 IMO Shortlist, 4

Tags: floor function , number theory , equation , algebra

Find all positive integers $ a$ and $ b$ for which \[ \left \lfloor \frac{a^2}{b} \right \rfloor \plus{} \left \lfloor \frac{b^2}{a} \right \rfloor \equal{} \left \lfloor \frac{a^2 \plus{} b^2}{ab} \right \rfloor \plus{} ab.\]

2010 Contests, 1

Tags: floor function , modular arithmetic , combinatorics

Let $D$ be the set of all pairs $(i,j)$, $1\le i,j\le n$. Prove there exists a subset $S \subset D$, with $|S|\ge\left \lfloor\frac{3n(n+1)}{5}\right \rfloor$, such that for any $(x_1,y_1), (x_2,y_2) \in S$ we have $(x_1+x_2,y_1+y_2) \not \in S$. (Peter Cameron)

1999 Taiwan National Olympiad, 3

Tags: floor function , combinatorics

There are $1999$ people participating in an exhibition. Among any $50$ people there are two who don't know each other. Prove that there are $41$ people, each of whom knows at most $1958$ people.

2016 Serbia National Math Olympiad, 2

Tags: algebra , combinatorics , function , floor function

Let $n $ be a positive integer. Let $f $ be a function from nonnegative integers to themselves. Let $f (0,i)=f (i,0)=0$, $f (1, 1)=n $, and $ f(i, j)= [\frac {f(i-1,j)}{2}]+ [\frac {f(i, j-1)}{2}] $ for positive integers $i, j$ such that $i*j>1$. Find the number of pairs $(i,j) $ such that $f (i, j) $ is an odd number.( $[x]$ is the floor function).

2014 India National Olympiad, 2

Tags: floor function , number theory

Let $n$ be a natural number. Prove that, \[ \left\lfloor \frac{n}{1} \right\rfloor+ \left\lfloor \frac{n}{2} \right\rfloor + \cdots + \left\lfloor \frac{n}{n} \right\rfloor + \left\lfloor \sqrt{n} \right\rfloor \] is even.

1996 South africa National Olympiad, 1

Tags: floor function , number theory

Find the highest power of $2$ that divides exactly into $1996!=1\times2\times\cdots\times1996$.

2011 Vietnam Team Selection Test, 4

Tags: floor function , induction , number theory

Let $\langle a_n\rangle_{n\ge 0}$ be a sequence of integers satisfying $a_0=1, a_1=3$ and $a_{n+2}=1+\left\lfloor \frac{a_{n+1}^2}{a_n}\right\rfloor \ \ \forall n\ge0.$ Prove that $a_n\cdot a_{n+2}-a_{n+1}^2=2^n$ for every natural number $n.$

2003 Croatia National Olympiad, Problem 2

Tags: algebra , floor function , function

For every integer $n>2$, prove the equality $$\left\lfloor\frac{n(n+1)}{4n-2}\right\rfloor=\left\lfloor\frac{n+1}4\right\rfloor.$$

2007 ITest, 55

Tags: floor function , algebra

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$.

2014 Online Math Open Problems, 22

Tags: floor function

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]

2017 Pan-African Shortlist, N1

Tags: number theory , greatest common divisor , floor function , function , algebra , divisibility theory

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$.

2009 Princeton University Math Competition, 2

Tags: calculus , integration , floor function , induction , ceiling function , logarithm

It is known that a certain mechanical balance can measure any object of integer mass anywhere between 1 and 2009 (both included). This balance has $k$ weights of integral values. What is the minimum $k$ for which there exist weights that satisfy this condition?

2002 Tuymaada Olympiad, 4

Tags: calculus , integration , floor function , pigeonhole principle , number theory

A real number $a$ is given. The sequence $n_{1}< n_{2}< n_{3}< ...$ consists of all the positive integral $n$ such that $\{na\}< \frac{1}{10}$. Prove that there are at most three different numbers among the numbers $n_{2}-n_{1}$, $n_{3}-n_{2}$, $n_{4}-n_{3}$, $\ldots$. [i]A corollary of a theorem from ergodic theory[/i]