Olympiad problems

1999 Romania Team Selection Test, 3

Tags: modular arithmetic , algebra , binomial coefficient , quadratic , special factorizations , floor function , induction

Prove that for any positive integer $n$, the number \[ S_n = {2n+1\choose 0}\cdot 2^{2n}+{2n+1\choose 2}\cdot 2^{2n-2}\cdot 3 +\cdots + {2n+1 \choose 2n}\cdot 3^n \] is the sum of two consecutive perfect squares. [i]Dorin Andrica[/i]

2009 China Western Mathematical Olympiad, 3

Tags: pigeonhole principle , combinatorics , floor function

A total of $n$ people compete in a mathematical match which contains $15$ problems where $n>12$. For each problem, $1$ point is given for a right answer and $0$ is given for a wrong answer. Analysing each possible situation, we find that if the sum of points every group of $12$ people get is no less than $36$, then there are at least $3$ people that got the right answer of a certain problem, among the $n$ people. Find the least possible $n$.

2001 Federal Competition For Advanced Students, Part 2, 1

Tags: floor function , modular arithmetic , algebra

Prove that $\frac{1}{25} \sum_{k=0}^{2001} \left[ \frac{2^k}{25}\right]$ is a positive integer.

2012 Benelux, 1

Tags: arithmetic sequence , number theory , floor function

A sequence $a_1,a_2,\ldots ,a_n,\ldots$ of natural numbers is defined by the rule \[a_{n+1}=a_n+b_n\ (n=1,2,\ldots)\] where $b_n$ is the last digit of $a_n$. Prove that such a sequence contains infinitely many powers of $2$ if and only if $a_1$ is not divisible by $5$.

2013 NIMO Problems, 5

Tags: binomial coefficient , function , induction , floor function

For every integer $n \ge 1$, the function $f_n : \left\{ 0, 1, \cdots, n \right\} \to \mathbb R$ is defined recursively by $f_n(0) = 0$, $f_n(1) = 1$ and \[ (n-k) f_n(k-1) + kf_n(k+1) = nf_n(k) \] for each $1 \le k < n$. Let $S_N = f_{N+1}(1) + f_{N+2}(2) + \cdots + f_{2N} (N)$. Find the remainder when $\left\lfloor S_{2013} \right\rfloor$ is divided by $2011$. (Here $\left\lfloor x \right\rfloor$ is the greatest integer not exceeding $x$.) [i]Proposed by Lewis Chen[/i]

2014 Iran MO (2nd Round), 3

Tags: combinatorics , function , floor function

Members of "Professionous Riddlous" society have been divided into some groups, and groups are changed in a special way each weekend: In each group, one of the members is specified as the best member, and the best members of all groups separate from their previous group and form a new group. If a group has only one member, that member joins the new group and the previous group will be removed. Suppose that the society has $n$ members at first, and all the members are in one group. Prove that a week will come, after which number of members of each group will be at most $1+\sqrt{2n}$.

PEN S Problems, 20

Tags: floor function

Let $n$ be a positive integer that is not a perfect cube. Define real numbers $a$, $b$, $c$ by \[a=\sqrt[3]{n}, \; b=\frac{1}{a-\lfloor a\rfloor}, \; c=\frac{1}{b-\lfloor b\rfloor}.\] Prove that there are infinitely many such integers $n$ with the property that there exist integers $r$, $s$, $t$, not all zero, such that $ra+sb+tc=0$.

2010 Contests, 1

Tags: ceiling function , floor function

Let $S$ be a set of 100 integers. Suppose that for all positive integers $x$ and $y$ (possibly equal) such that $x + y$ is in $S$, either $x$ or $y$ (or both) is in $S$. Prove that the sum of the numbers in $S$ is at most 10,000.

2007 Germany Team Selection Test, 1

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

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]

1994 Kurschak Competition, 3

Tags: combinatorics , floor function

Consider the sets $A_1,A_2,\dots,A_n$. Set $A_k$ is composed of $k$ disjoint intervals on the real axis ($k=1,2,\dots,n$). Prove that from the intervals contained by these sets, one can choose $\left\lfloor\frac{n+1}2\right\rfloor$ intervals such that they belong to pairwise different sets $A_k$, and no two of these intervals have a common point.

2010 ELMO Shortlist, 4

Tags: trigonometry , algebra , floor function

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 BMT, 4

Tags: floor function , algebra

Let f$(x)$ be a continuous function over the real numbers such that for every integer $n$, $f(n) = n^2$ and $f(x) $ is linear over the interval $[n, n + 1]$. There exists a unique two-variable polynomial $g$ such that $g(x, \lfloor x \rfloor) = f(x)$ for all $x$. Compute $g(20, 23)$. (Here, $\lfloor x \rfloor$ is defined as the greatest integer less than or equal to $x$. For example, $\lfloor 2\rfloor = 2$ and $\lfloor -3.5 \rfloor = -4$.)

1990 Romania Team Selection Test, 1

Tags: floor function , number theory

Let a,b,n be positive integers such that $(a,b) = 1$. Prove that if $(x,y)$ is a solution of the equation $ax+by = a^n + b^n$ then $$\left[\frac{x}{b}\right]+\left[\frac{y}{a}\right]=\left[\frac{a^{n-1}}{b}\right]+\left[\frac{b^{n-1}}{a}\right]$$

2011 Uzbekistan National Olympiad, 2

Tags: limit , floor function , algebra , inequalities

Prove that $ \forall n\in\mathbb{N}$,$ \exists a,b,c\in$$\bigcup_{k\in\mathbb{N}}(k^{2},k^{2}+k+3\sqrt 3) $ such that $n=\frac{ab}{c}$.

2012 AIME Problems, 10

Tags: floor function

Find the number of positive integers $n$ less than $1000$ for which there exists a positive real number $x$ such that $n = x \lfloor x \rfloor$. [b]Note[/b]: $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.

2000 AIME Problems, 11

Tags: floor function , relatively prime , number theory

Let $S$ be the sum of all numbers of the form $a/b,$ where $a$ and $b$ are relatively prime positive divisors of $1000.$ What is the greatest integer that does not exceed $S/10?$

2018 Dutch IMO TST, 3

Tags: floor function , sum , perfect square , number theory

Let $n \ge 0$ be an integer. A sequence $a_0,a_1,a_2,...$ of integers is defined 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$.

2009 AIME Problems, 7

Tags: floor function , factorial , function

Define $ n!!$ to be $ n(n\minus{}2)(n\minus{}4)\ldots3\cdot1$ for $ n$ odd and $ n(n\minus{}2)(n\minus{}4)\ldots4\cdot2$ for $ n$ even. When $ \displaystyle \sum_{i\equal{}1}^{2009} \frac{(2i\minus{}1)!!}{(2i)!!}$ is expressed as a fraction in lowest terms, its denominator is $ 2^ab$ with $ b$ odd. Find $ \displaystyle \frac{ab}{10}$.

2020 Jozsef Wildt International Math Competition, W47

Tags: floor function , algebra

Let $x,y,z>0$ such that $$(x+y+z)\left(\frac1x+\frac1y+\frac1z\right)=\frac{91}{10}$$ Compute $$\left[(x^3+y^3+z^3)\left(\frac1{x^3}+\frac1{y^3}+\frac1{z^3}\right)\right]$$ where $[.]$ represents the integer part. [i]Proposed by Marian Cucoanoeş and Marius Drăgan[/i]

2003 Brazil National Olympiad, 2

Tags: combinatorics , logarithm , floor function

Let $S$ be a set with $n$ elements. Take a positive integer $k$. Let $A_1, A_2, \ldots, A_k$ be any distinct subsets of $S$. For each $i$ take $B_i = A_i$ or $B_i = S - A_i$. Find the smallest $k$ such that we can always choose $B_i$ so that $\bigcup_{i=1}^k B_i = S$, no matter what the subsets $A_i$ are.

2009 USAMO, 4

Tags: induction , quadratic , floor function , inequalities

For $ n\geq2$ let $ a_1, a_2, \ldots a_n$ be positive real numbers such that \[ (a_1 \plus{} a_2 \plus{} \cdots \plus{} a_n)\left(\frac {1}{a_1} \plus{} \frac {1}{a_2} \plus{} \cdots \plus{} \frac {1}{a_n}\right) \leq \left(n \plus{} \frac {1}{2}\right)^2. \] Prove that $ \max(a_1, a_2, \ldots, a_n)\leq 4\min(a_1, a_2, \ldots, a_n)$.

PEN A Problems, 84

Tags: floor function , divisibility theory

Determine all $n \in \mathbb{N}$ for which [list][*] $n$ is not the square of any integer, [*] $\lfloor \sqrt{n}\rfloor ^3$ divides $n^2$. [/list]

2022 Saudi Arabia IMO TST, 1

Tags: floor function , algebra , summation , number theory

Which positive integers $n$ make the equation \[\sum_{i=1}^n \sum_{j=1}^n \left\lfloor \frac{ij}{n+1} \right\rfloor=\frac{n^2(n-1)}{4}\] true?

2013 Bogdan Stan, 2

Tags: floor function , function , injectivity , surjectivity , bijectivity , integer part , algebra

Consider the parametric function $ f_k:\mathbb{R}\longrightarrow\mathbb{R}, f(x)=x+k\lfloor x \rfloor . $ [b]a)[/b] For which integer values of $ k $ the above function is injective? [b]b)[/b] For which integer values of $ k $ the above function is surjective? [b]c)[/b] Given two natural numbers $ n,m, $ create two bijective functions: $$ \phi : f_m (\mathbb{R} )\cap [0,\infty )\longrightarrow f_n(\mathbb{R})\cap [0,\infty ) $$ $$ \psi : \left(\mathbb{R}\setminus f_m (\mathbb{R})\right)\cap [0,\infty )\longrightarrow\left(\mathbb{R}\setminus f_n (\mathbb{R})\right)\cap [0,\infty ) $$ [i]Cristinel Mortici[/i]

1977 IMO Longlists, 28

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

Let $n$ be an integer greater than $1$. Define \[x_1 = n, y_1 = 1, x_{i+1} =\left[ \frac{x_i+y_i}{2}\right] , y_{i+1} = \left[ \frac{n}{x_{i+1}}\right], \qquad \text{for }i = 1, 2, \ldots\ ,\] where $[z]$ denotes the largest integer less than or equal to $z$. Prove that \[ \min \{x_1, x_2, \ldots, x_n \} =[ \sqrt n ]\]