Olympiad problems

2006 Pre-Preparation Course Examination, 5

Powers of $2$ in base $10$ start with $3$ or $4$ more frequently? What is their state in base $3$? First write down an exact form of the question.

2013 Romanian Master of Mathematics, 1

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

For a positive integer $a$, define a sequence of integers $x_1,x_2,\ldots$ by letting $x_1=a$ and $x_{n+1}=2x_n+1$ for $n\geq 1$. Let $y_n=2^{x_n}-1$. Determine the largest possible $k$ such that, for some positive integer $a$, the numbers $y_1,\ldots,y_k$ are all prime.

1990 AMC 12/AHSME, 19

Tags: floor function

For how many integers $N$ between $1$ and $1990$ is the improper fraction $\frac{N^2+7}{N+4}$ not in lowest terms? $\text{(A)} \ 0 \qquad \text{(B)} \ 86 \qquad \text{(C)} \ 90 \qquad \text{(D)} \ 104 \qquad \text{(E)} \ 105$

2009 Kazakhstan National Olympiad, 3

Tags: floor function , graph theory , combinatorics

In chess tournament participates $n$ participants ($n >1$). In tournament each of participants plays with each other exactly $1$ game. For each game participant have $1$ point if he wins game, $0,5$ point if game is drow and $0$ points if he lose game. If after ending of tournament participant have at least $ 75 % $ of maximum possible points he called $winner$ $of$ $tournament$. Find maximum possible numbers of $winners$ $of$ $tournament$.

2014 Danube Mathematical Competition, 2

Tags: floor function , set , algebra , product

Let $S$ be a set of positive integers such that $\lfloor \sqrt{x}\rfloor =\lfloor \sqrt{y}\rfloor $ for all $x, y \in S$. Show that the products $xy$, where $x, y \in S$, are pairwise distinct.

2004 National Olympiad First Round, 20

Tags: floor function , inequalities

What is the largest real number $C$ that satisfies the inequality $x^2 \geq C \lfloor x \rfloor (x-\lfloor x \rfloor)$ for every real $x$? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 9 \qquad\textbf{(E)}\ 25 $

2024 ELMO Shortlist, A2

Tags: combinatorics , floor function

Let $n$ be a positive integer. Find the number of sequences $a_0,a_1,a_2,\dots,a_{2n}$ of integers in the range $[0,n]$ such that for all integers $0\leq k\leq n$ and all nonnegative integers $m$, there exists an integer $k\leq i\leq 2k$ such that $\lfloor k/2^m\rfloor=a_i.$ [i]Andrew Carratu[/i]

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

2007 Germany Team Selection Test, 1

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

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]

2008 Bulgaria Team Selection Test, 3

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

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

2007 Croatia Team Selection Test, 2

Tags: floor function , irrational number , number theory

Prove that the sequence $a_{n}=\lfloor n\sqrt 2 \rfloor+\lfloor n\sqrt 3 \rfloor$ contains infintely many even and infinitely many odd numbers.

1962 Dutch Mathematical Olympiad, 2

Tags: sequence , floor function

The $n^{th}$ term of a sequence is $t_n$. For $n \ge 1$, $t_n$ is given by the relation: $$t_n= n^3+\frac12 n^2+ \frac13 n + \frac14$$ The $n^{th}$ term of a second sequence $T_n$, where $T_n$ represents the smallest integer greater than $t_n$. Calculate: $$(T_1+T_2+...+T_{1014}) -(t_1+t_2+...+t_{1014}) $$

2013 Brazil Team Selection Test, 2

Tags: modular arithmetic , inequalities , quadratic , function , algebra , floor function

Determine all positive integers $n$ for which $\dfrac{n^2+1}{[\sqrt{n}]^2+2}$ is an integer. Here $[r]$ denotes the greatest integer less than or equal to $r$.

2014 AMC 10, 25

Tags: inequalities , function , floor function , logarithm

The number $5^{867}$ is between $2^{2013}$ and $2^{2014}$. How many pairs of integers $(m,n)$ are there such that $1\leq m\leq 2012$ and \[5^n<2^m<2^{m+2}<5^{n+1}?\] $\textbf{(A) }278\qquad \textbf{(B) }279\qquad \textbf{(C) }280\qquad \textbf{(D) }281\qquad \textbf{(E) }282\qquad$

1989 India National Olympiad, 4

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]

PEN G Problems, 22

Tags: floor function , irrational number

For a positive real number $\alpha$, define \[S(\alpha)=\{ \lfloor n\alpha\rfloor \; \vert \; n=1,2,3,\cdots \}.\] Prove that $\mathbb{N}$ cannot be expressed as the disjoint union of three sets $S(\alpha)$, $S(\beta)$, and $S(\gamma)$.

PEN I Problems, 9

Tags: floor function

Show that for all positive integers $m$ and $n$, \[\gcd(m, n) = m+n-mn+2\sum^{m-1}_{k=0}\left \lfloor \frac{kn}{m}\right \rfloor.\]

2013 South East Mathematical Olympiad, 5

Tags: floor function , calculus , algebra

$f(x)=\sum\limits_{i=1}^{2013}\left[\dfrac{x}{i!}\right]$. A integer $n$ is called [i]good[/i] if $f(x)=n$ has real root. How many good numbers are in $\{1,3,5,\dotsc,2013\}$?

2014 Belarus Team Selection Test, 3

Tags: floor function , combinatorics

Find the maximum possible number of edges of a simple graph with $8$ vertices and without any quadrilateral. (a simple graph is an undirected graph that has no loops (edges connected at both ends to the same vertex) and no more than one edge between any two different vertices.)

2006 Putnam, B3

Tags: rotation , induction , floor function , ceiling function

Let $S$ be a finite set of points in the plane. A linear partition of $S$ is an unordered pair $\{A,B\}$ of subsets of $S$ such that $A\cup B=S,\ A\cap B=\emptyset,$ and $A$ and $B$ lie on opposite sides of some straight line disjoint from $S$ ($A$ or $B$ may be empty). Let $L_{S}$ be the number of linear partitions of $S.$ For each positive integer $n,$ find the maximum of $L_{S}$ over all sets $S$ of $n$ points.

PEN I Problems, 8

Tags: floor function , calculus , derivative , inequalities

Prove that $\lfloor \sqrt[3]{n}+\sqrt[3]{n+1}+\sqrt[3]{n+2}\rfloor =\lfloor \sqrt[3]{27n+26}\rfloor$ for all positive integers $n$.

2007 China Team Selection Test, 2

Tags: floor function , number theory

A rational number $ x$ is called [i]good[/i] if it satisfies: $ x\equal{}\frac{p}{q}>1$ with $ p$, $ q$ being positive integers, $ \gcd (p,q)\equal{}1$ and there exists constant numbers $ \alpha$, $ N$ such that for any integer $ n\geq N$, \[ |\{x^n\}\minus{}\alpha|\leq\dfrac{1}{2(p\plus{}q)}\] Find all the good numbers.

1981 USAMO, 5

Tags: floor function , inequality , algebra

If $x$ is a positive real number, and $n$ is a positive integer, prove that \[[ nx] > \frac{[ x]}1 + \frac{[ 2x]}2 +\frac{[ 3x]}3 + \cdots + \frac{[ nx]}n,\] where $[t]$ denotes the greatest integer less than or equal to $t$. For example, $[ \pi] = 3$ and $\left[\sqrt2\right] = 1$.

1972 Bundeswettbewerb Mathematik, 4

Tags: function , algebra , floor function

Which natural numbers cannot be presented in that way: $[n+\sqrt{n}+\frac{1}{2}]$, $n\in\mathbb{N}$ $[y]$ is the greatest integer function.

2014 AMC 12/AHSME, 22

Tags: inequalities , function , logarithm , floor function

The number $5^{867}$ is between $2^{2013}$ and $2^{2014}$. How many pairs of integers $(m,n)$ are there such that $1\leq m\leq 2012$ and \[5^n<2^m<2^{m+2}<5^{n+1}?\] $\textbf{(A) }278\qquad \textbf{(B) }279\qquad \textbf{(C) }280\qquad \textbf{(D) }281\qquad \textbf{(E) }282\qquad$