Olympiad problems

2013 Putnam, 4

A finite collection of digits $0$ and $1$ is written around a circle. An [i]arc[/i] of length $L\ge 0$ consists of $L$ consecutive digits around the circle. For each arc $w,$ let $Z(w)$ and $N(w)$ denote the number of $0$'s in $w$ and the number of $1$'s in $w,$ respectively. Assume that $|Z(w)-Z(w')|\le 1$ for any two arcs $w,w'$ of the same length. Suppose that some arcs $w_1,\dots,w_k$ have the property that \[Z=\frac1k\sum_{j=1}^kZ(w_j)\text{ and }N=\frac1k\sum_{j=1}^k N(w_j)\] are both integers. Prove that there exists an arc $w$ with $Z(w)=Z$ and $N(w)=N.$

2017 BMT Spring, 12

Tags: floor function , geometry

Square $S$ is the unit square with vertices at $(0, 0)$, $(0, 1)$, $(1, 0)$ and $(1, 1)$. We choose a random point $(x, y)$ inside $S$ and construct a rectangle with length $x$ and width $y$. What is the average of $\lfloor p \rfloor$ where $p$ is the perimeter of the rectangle? $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.

2014 Saudi Arabia IMO TST, 2

Tags: function , floor function , induction , algebra , logarithm

Determine all functions $f:[0,\infty)\rightarrow\mathbb{R}$ such that $f(0)=0$ and \[f(x)=1+5f\left(\left\lfloor{\frac{x}{2}\right\rfloor}\right)-6f\left(\left\lfloor{\frac{x}{4}\right\rfloor}\right)\] for all $x>0$.

2012 AMC 12/AHSME, 24

Tags: function , floor function , number theory , prime factorization

Define the function $f_1$ on the positive integers by setting $f_1(1)=1$ and if $n=p_1^{e_1}p_2^{e_2}...p_k^{e_k}$ is the prime factorization of $n>1$, then \[f_1(n)=(p_1+1)^{e_1-1}(p_2+1)^{e_2-1}\cdots (p_k+1)^{e_k-1}.\] For every $m \ge 2$, let $f_m(n)=f_1(f_{m-1}(n))$. For how many $N$ in the range $1 \le N \le 400$ is the sequence $(f_1(N), f_2(N), f_3(N),...)$ unbounded? [b]Note:[/b] a sequence of positive numbers is unbounded if for every integer $B$, there is a member of the sequence greater than $B$. $ \textbf{(A)}\ 15 \qquad\textbf{(B)}\ 16 \qquad\textbf{(C)}\ 17 \qquad\textbf{(D)}\ 18\qquad\textbf{(E)}\ 19 $

2013 Saudi Arabia BMO TST, 3

Tags: floor function , algebra

Solve the following equation where $x$ is a real number: $\lfloor x^2 \rfloor -10\lfloor x \rfloor + 24 = 0$

2014 PUMaC Number Theory A, 3

Tags: floor function

Find the number of ending zeros of $2014!$ in base 9. Give your answer in base 9.

2014 Online Math Open Problems, 9

Tags: floor function

Let $N = 2014! + 2015! + 2016! + \dots + 9999!$. How many zeros are at the end of the decimal representation of $N$? [i]Proposed by Evan Chen[/i]

2008 Romanian Master of Mathematics, 3

Tags: floor function , modular arithmetic , function , number theory

Let $ a>1$ be a positive integer. Prove that every non-zero positive integer $ N$ has a multiple in the sequence $ (a_n)_{n\ge1}$, $ a_n\equal{}\left\lfloor\frac{a^n}n\right\rfloor$.

2007 ITest, 38

Tags: geometry , 3d geometry , floor function , inequalities , logarithm

Find the largest positive integer that is equal to the cube of the sum of its digits.

2010 China Team Selection Test, 2

Tags: algebra , polynomial , floor function , triangle inequality , inequalities

Given positive integer $n$, find the largest real number $\lambda=\lambda(n)$, such that for any degree $n$ polynomial with complex coefficients $f(x)=a_n x^n+a_{n-1} x^{n-1}+\cdots+a_0$, and any permutation $x_0,x_1,\cdots,x_n$ of $0,1,\cdots,n$, the following inequality holds $\sum_{k=0}^n|f(x_k)-f(x_{k+1})|\geq \lambda |a_n|$, where $x_{n+1}=x_0$.

2012 Princeton University Math Competition, A8

Tags: floor function , algebra

If $n$ is an integer such that $n \ge 2^k$ and $n < 2^{k+1}$, where $k = 1000$, compute the following: $$n - \left( \lfloor \frac{n -2^0}{2^1} \rfloor + \lfloor \frac{n -2^1}{2^2} \rfloor + ...+ \lfloor \frac{n -2^{k-1}}{2^k} \rfloor \right)$$

2007 Princeton University Math Competition, 2

Tags: floor function

Suppose that $A$ is a set of positive integers less than $N$ and that no two distinct elements of $A$ sum to a perfect square. That is, if $a_1, a_2 \in A$ and $a_1 \neq a_2$ then $|a_1+a_2|$ is not a square of an integer. Prove that the maximum number of elements in $A$ is at least $\left\lfloor\frac{11}{32}N\right\rfloor$ .

2010 Bundeswettbewerb Mathematik, 2

Tags: floor function , recurrence relation , sequence , radical , algebra

The sequence of numbers $a_1, a_2, a_3, ...$ is defined recursively by $a_1 = 1, a_{n + 1} = \lfloor \sqrt{a_1+a_2+...+a_n} \rfloor $ for $n \ge 1$. Find all numbers that appear more than twice at this sequence.

2024/2025 TOURNAMENT OF TOWNS, P1

Tags: number theory , floor function

On the blackboard, there are numbers $1, 2, \dots , 100$. At each move, Bob erases arbitrary two numbers $a$ and $b$, where $a \ge b > 0$, and writes the single number $\lfloor{a/b}\rfloor$. After $99$ such moves the blackboard will contain a single number. What is its maximum possible value? (Reminder that $\lfloor{x}\rfloor$ is the maximum integer not exceeding $x$.)

2011 Hanoi Open Mathematics Competitions, 3

Tags: floor function , algebra , square root

What is the largest integer less than to $\sqrt[3]{(2011)^3 + 3 \times (2011)^2 + 4 \times 2011+ 5}$ ? (A) $2010$, (B) $2011$, (C) $2012$, (D) $2013$, (E) None of the above.

PEN A Problems, 83

Tags: floor function , divisibility theory

Find all $n \in \mathbb{N}$ such that $ \lfloor \sqrt{n}\rfloor$ divides $n$.

2007 Harvard-MIT Mathematics Tournament, 36

Tags: geometry , floor function

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

VI Soros Olympiad 1999 - 2000 (Russia), 9.2

Tags: algebra , number theory , fractional part , floor function

Solve the equation $[x]\{x\} = 1999x$, where $[x]$ denotes the largest integer less than or equal to $x$, and $\{x\} = x -[x] $

2014 Bosnia Herzegovina Team Selection Test, 2

Tags: floor function , combinatorics

It is given regular $n$-sided polygon, $n \geq 6$. How many triangles they are inside the polygon such that all of their sides are formed by diagonals of polygon and their vertices are vertices of polygon?

1989 Poland - Second Round, 5

Tags: algebra , recurrence relation , floor function , number theory

Given a sequence $ (c_n) $ of natural numbers defined recursively: $ c_1 = 2 $, $ c_{n+1} = \left[ \frac{3}{2}c_n\right] $. Prove that there are infinitely many even numbers and infinitely many odd numbers among the terms of this sequence.

2000 Croatia National Olympiad, Problem 4

Tags: number theory , floor function

Let $S$ be the set of all squarefree numbers and $n$ be a natural number. Prove that $$\sum_{k\in S}\left\lfloor\sqrt{\frac nk}\right\rfloor=n.$$

1995 Putnam, 6

Tags: floor function , ceiling function , limit

For any $a>0$,set $\mathcal{S}(a)=\{\lfloor{na}\rfloor|n\in \mathbb{N}\}$. Show that there are no three positive reals $a,b,c$ such that \[ \mathcal{S}(a)\cap \mathcal{S}(b)=\mathcal{S}(b)\cap \mathcal{S}(c)=\mathcal{S}(c)\cap \mathcal{S}(a)=\emptyset \] \[ \mathcal{S}(a)\cup \mathcal{S}(b)\cup \mathcal{S}(c)=\mathbb{N} \]

2021 Brazil National Olympiad, 9

Tags: floor function , algebra

Let $\alpha\geq 1$ be a real number. Define the set $$A(\alpha)=\{\lfloor \alpha\rfloor,\lfloor 2\alpha\rfloor, \lfloor 3\alpha\rfloor,\dots\}$$ Suppose that all the positive integers that [b]does not belong[/b] to the $A(\alpha)$ are exactly the positive integers that have the same remainder $r$ in the division by $2021$ with $0\leq r<2021$. Determine all the possible values of $\alpha$.

2008 Bulgaria Team Selection Test, 3

Tags: floor function , ceiling function , induction , algebra , polynomial , combinatorics

Let $G$ be a directed graph with infinitely many vertices. It is known that for each vertex the outdegree is greater than the indegree. Let $O$ be a fixed vertex of $G$. For an arbitrary positive number $n$, let $V_{n}$ be the number of vertices which can be reached from $O$ passing through at most $n$ edges ( $O$ counts). Find the smallest possible value of $V_{n}$.

2014 IMO Shortlist, N4

Tags: floor function , number theory , sequence , parity

Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.) [i]Proposed by Hong Kong[/i]