Olympiad problems

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.

2007 Germany Team Selection Test, 1

Tags: sequence , summation , floor function , number theory , calculus

We define a sequence $ \left(a_{1},a_{2},a_{3},\ldots \right)$ by \[ a_{n} \equal{} \frac {1}{n}\left(\left\lfloor\frac {n}{1}\right\rfloor \plus{} \left\lfloor\frac {n}{2}\right\rfloor \plus{} \cdots \plus{} \left\lfloor\frac {n}{n}\right\rfloor\right), \] where $\lfloor x\rfloor$ denotes the integer part of $x$. [b]a)[/b] Prove that $a_{n+1}>a_n$ infinitely often. [b]b)[/b] Prove that $a_{n+1}<a_n$ infinitely often. [i]Proposed by Johan Meyer, South Africa[/i]

2010 Iran MO (3rd Round), 3

Tags: floor function , combinatorics

suppose that $\mathcal F\subseteq p(X)$ and $|X|=n$. we know that for every $A_i,A_j\in \mathcal F$ that $A_i\supseteq A_j$ we have $3\le |A_i|-|A_j|$. prove that: $|\mathcal F|\le \lfloor\frac{2^n}{3}+\frac{1}{2}\dbinom{n}{\lfloor\frac{n}{2}\rfloor}\rfloor$ (20 points)

1994 AIME Problems, 4

Tags: derivative , logarithm , geometric series , floor function , calculus

Find the positive integer $n$ for which \[ \lfloor \log_2{1}\rfloor+\lfloor\log_2{2}\rfloor+\lfloor\log_2{3}\rfloor+\cdots+\lfloor\log_2{n}\rfloor=1994. \] (For real $x$, $\lfloor x\rfloor$ is the greatest integer $\le x.$)

2005 USAMO, 6

Tags: inequalities , ceiling function , floor function , pigeonhole principle , logarithm , induction , modular arithmetic

For $m$ a positive integer, let $s(m)$ be the sum of the digits of $m$. For $n\ge 2$, let $f(n)$ be the minimal $k$ for which there exists a set $S$ of $n$ positive integers such that $s\left(\sum_{x\in X} x\right)=k$ for any nonempty subset $X\subset S$. Prove that there are constants $0<C_1<C_2$ with \[C_1 \log_{10} n \le f(n) \le C_2 \log_{10} n.\]

2018 Middle European Mathematical Olympiad, 4

Tags: floor function , algebra , number theory

(a) Prove that for every positive integer $m$ there exists an integer $n\ge m$ such that $$\left \lfloor \frac{n}{1} \right \rfloor \cdot \left \lfloor \frac{n}{2} \right \rfloor \cdots \left \lfloor \frac{n}{m} \right \rfloor =\binom{n}{m} \\\\\\\\\\\\\\\ (*)$$ (b) Denote by $p(m)$ the smallest integer $n \geq m$ such that the equation $ (*)$ holds. Prove that $p(2018) = p(2019).$ Remark: For a real number $x,$ we denote by $\left \lfloor x \right \rfloor$ the largest integer not larger than $x.$

2009 Princeton University Math Competition, 3

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

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?

2013 China Team Selection Test, 1

Tags: analytic geometry , induction , floor function , combinatorics

For a positive integer $k\ge 2$ define $\mathcal{T}_k=\{(x,y)\mid x,y=0,1,\ldots, k-1\}$ to be a collection of $k^2$ lattice points on the cartesian coordinate plane. Let $d_1(k)>d_2(k)>\cdots$ be the decreasing sequence of the distinct distances between any two points in $T_k$. Suppose $S_i(k)$ be the number of distances equal to $d_i(k)$. Prove that for any three positive integers $m>n>i$ we have $S_i(m)=S_i(n)$.

1997 Putnam, 2

Tags: floor function

Players $1,2,\ldots n$ are seated around a table, and each has a single penny. Player $1$ passes a penny to Player $2$, who then passes two pennies to Player $3$, who then passes one penny to player $4$, who then passes two pennies to Player $5$ and so on, players alternately pass one or two pennies to the next player who still has some pennies. The player who runs out of pennies drops out of the game and leaves the table. Find an infinite set of numbers $n$ for which some player ends up with all the $n$ pennies.

1968 IMO, 6

Tags: summation , equation , floor function , number theory

Let $n$ be a natural number. Prove that \[ \left\lfloor \frac{n+2^0}{2^1} \right\rfloor + \left\lfloor \frac{n+2^1}{2^2} \right\rfloor +\cdots +\left\lfloor \frac{n+2^{n-1}}{2^n}\right\rfloor =n. \] [hide="Remark"]For any real number $x$, the number $\lfloor x \rfloor$ represents the largest integer smaller or equal with $x$.[/hide]

2008 Thailand Mathematical Olympiad, 3

Tags: algebra , floor function

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$

2003 Austria Beginners' Competition, 1

Tags: floor function , algebra

For the real numbers $x$ and $y$, $[\sqrt{x}] = 10$ and $[\sqrt{y}] =14$. How large is $\left[\sqrt{[ \sqrt{x+y} ]}\right]$ ? (Note: the square roots are the positive values and $[x]$ is the largest integer less than or equal to x.)

2013 NIMO Problems, 8

Tags: geometry , perimeter , floor function

Let $AXYZB$ be a convex pentagon inscribed in a semicircle with diameter $AB$. Suppose that $AZ-AX=6$, $BX-BZ=9$, $AY=12$, and $BY=5$. Find the greatest integer not exceeding the perimeter of quadrilateral $OXYZ$, where $O$ is the midpoint of $AB$. [i]Proposed by Evan Chen[/i]

PEN E Problems, 37

Tags: induction , floor function

It's known that there is always a prime between $n$ and $2n-7$ for all $n \ge 10$. Prove that, with the exception of $1$, $4$, and $6$, every natural number can be written as the sum of distinct primes.

2012 JBMO TST - Turkey, 4

Tags: ceiling function , floor function , combinatorics

Let $G$ be a connected simple graph. When we add an edge to $G$ (between two unconnected vertices), then using at most $17$ edges we can reach any vertex from any other vertex. Find the maximum number of edges to be used to reach any vertex from any other vertex in the original graph, i.e. in the graph before we add an edge.

2018 Thailand TST, 3

Tags: sequence , floor function , number theory

Let $n$ be a fixed odd positive integer. For each odd prime $p$, define $$a_p=\frac{1}{p-1}\sum_{k=1}^{\frac{p-1}{2}}\bigg\{\frac{k^{2n}}{p}\bigg\}.$$ Prove that there is a real number $c$ such that $a_p = c$ for infinitely many primes $p$. [i]Note: $\left\{x\right\} = x - \left\lfloor x\right\rfloor$ is the fractional part of $x$.[/i]

2007 Harvard-MIT Mathematics Tournament, 36

Tags: floor function , geometry

[i]The Marathon.[/i] Let $\omega$ denote the incircle of triangle $ABC$. The segments $BC$, $CA$, and $AB$ are tangent to $\omega$ at $D$, $E$ and $F$, respectively. Point $P$ lies on $EF$ such that segment $PD$ is perpendicular to $BC$. The line $AP$ intersects $BC$ at $Q$. The circles $\omega_1$ and $\omega_2$ pass through $B$ and $C$, respectively, and are tangent to $AQ$ at $Q$; the former meets $AB$ again at $X$, and the latter meets $AC$ again at $Y$. The line $XY$ intersects $BC$ at $Z$. Given that $AB=15$, $BC=14$, and $CA=13$, find $\lfloor XZ\cdot YZ\rfloor$.

2022 Iran-Taiwan Friendly Math Competition, 1

Tags: floor function , number theory

Let $k\geqslant 2$ be an integer, and $a,b$ be real numbers. prove that $a-b$ is an integer divisible by $k$ if and only if for every positive integer $n$ $$\lfloor an \rfloor \equiv \lfloor bn \rfloor \ (mod \ k)$$ Proposed by Navid Safaei

2012 Vietnam Team Selection Test, 3

Tags: geometry , arithmetic sequence , combinatorial geometry , symmetry , geometric transformation , modular arithmetic , floor function

Let $p\ge 17$ be a prime. Prove that $t=3$ is the largest positive integer which satisfies the following condition: For any integers $a,b,c,d$ such that $abc$ is not divisible by $p$ and $(a+b+c)$ is divisible by $p$, there exists integers $x,y,z$ belonging to the set $\{0,1,2,\ldots , \left\lfloor \frac{p}{t} \right\rfloor - 1\}$ such that $ax+by+cz+d$ is divisible by $p$.

2015 AMC 10, 23

Tags: modular arithmetic , floor function , factorial

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 $

1983 Bulgaria National Olympiad, Problem 6

Tags: function , floor function , algebra

Let $a,b,c>0$ satisfy for all integers $n$, we have $$\lfloor an\rfloor+\lfloor bn\rfloor=\lfloor cn\rfloor$$Prove that at least one of $a,b,c$ is an integer.

2005 China Team Selection Test, 1

Tags: inequalities , function , floor function

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