This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 1187

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$

2007 Hong kong National Olympiad, 4
Tags: floor function , number theory
find all positive integer pairs $(m,n)$,satisfies: (1)$gcd(m,n)=1$,and $m\le\ 2007$ (2)for any $k=1,2,...2007$,we have $[\frac{nk}{m}]=[\sqrt{2}k]$

2006 District Olympiad, 3
Tags: floor function , function
A set $M$ of positive integers is called [i]connected[/i] if for any element $x\in M$ at least one of the numbers $x-1,x+1$ is in $M$. Let $U_n$ be the number of the connected subsets of $\{1,2,\ldots,n\}$. a) Compute $U_7$; b) Find the smallest number $n$ such that $U_n \geq 2006$.

2014 Math Hour Olympiad, 8-10.7
Tags: floor function , modular arithmetic
If $a$ is any number, $\lfloor a \rfloor$ is $a$ rounded down to the nearest integer. For example, $\lfloor \pi \rfloor =$ $3$. Show that the sequence $\lfloor \frac{2^{1}}{17} \rfloor$, $\lfloor \frac{2^{2}}{17} \rfloor$, $\lfloor \frac{2^{3}}{17} \rfloor$, $\dots$ contains infinitely many odd numbers.

2016 Germany Team Selection Test, 1
Tags: floor function , number theory , sequence
Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.

2007 AIME Problems, 5
Tags: function , geometry , rectangle , floor function , 3d geometry
The graph of the equation $9x+223y=2007$ is drawn on graph paper with each square representing one unit in each direction. How many of the $1$ by $1$ graph paper squares have interiors lying entirely below the graph and entirely in the first quadrant?

1975 Czech and Slovak Olympiad III A, 2
Tags: floor function , square , algebra , inequalities , system of equations , bounded , function
Show that the system of equations \begin{align*} \lfloor x\rfloor^2+\lfloor y\rfloor &=0, \\ 3x+y &=2, \end{align*} has infinitely many solutions and all these solutions satisfy bounds \begin{align*} 0<\ &x <4, \\ -9\le\ &y\le 1. \end{align*}

2019 Ramnicean Hope, 3
Tags: floor function , algebra , logarithm
Calculate $ \lfloor \log_3 5 +\log_5 7 +\log_7 3 \rfloor .$ [i]Petre Rău[/i]

2017 Pan-African Shortlist, N1
Tags: function , algebra , number theory , greatest common divisor , floor function , 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$.

2014 Purple Comet Problems, 19
Tags: floor function
Let $n$ be a positive integer such that $\lfloor\sqrt n\rfloor-2$ divides $n-4$ and $\lfloor\sqrt n\rfloor+2$ divides $n+4$. Find the greatest such $n$ less than $1000$. (Note: $\lfloor x\rfloor$ refers to the greatest integer less than or equal to $x$.)

1948 Putnam, B3
Tags: function , floor function , algebra
Prove that $[\sqrt{n}+\sqrt{n+1}]=[\sqrt{4n+1}]$ for all $n \in N$.

2021 Brazil National Olympiad, 3
Tags: number theory , perfect square , floor function , irrational number , power
Find all positive integers \(k\) for which there is an irrational \(\alpha>1\) and a positive integer \(N\) such that \(\left\lfloor\alpha^{n}\right\rfloor\) is a perfect square minus \(k\) for every integer \(n\) with \(n>N\).

2016 AMC 10, 4
Tags: floor function
The remainder can be defined for all real numbers $x$ and $y$ with $y \neq 0$ by $$\text{rem} (x ,y)=x-y\left \lfloor \frac{x}{y} \right \rfloor$$ where $\left \lfloor \tfrac{x}{y} \right \rfloor$ denotes the greatest integer less than or equal to $\tfrac{x}{y}$. What is the value of $\text{rem} (\tfrac{3}{8}, -\tfrac{2}{5} )$? $\textbf{(A) } -\frac{3}{8} \qquad \textbf{(B) } -\frac{1}{40} \qquad \textbf{(C) } 0 \qquad \textbf{(D) } \frac{3}{8} \qquad \textbf{(E) } \frac{31}{40}$

2020 Hong Kong TST, 4
Tags: floor function , prime number , number theory
Find the total number of primes $p<100$ such that $\lfloor (2+\sqrt{5})^p \rfloor-2^{p+1}$ is divisible by $p$. Here $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$.

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

2017 India PRMO, 14
Tags: algebra , geometric progression , floor function , integer part , geometric sequence
Suppose $x$ is a positive real number such that $\{x\}, [x]$ and $x$ are in a geometric progression. Find the least positive integer $n$ such that $x^n > 100$. (Here $[x]$ denotes the integer part of $x$ and $\{x\} = x - [x]$.)

2007 Gheorghe Vranceanu, 2
Tags: function , floor function , algebra , monotone
Let be a function $ f:(0,\infty )\longrightarrow\mathbb{R} $ satisfying the following two properties: $ \text{(i) } 2\lfloor x \rfloor \le f(x) \le 2 \lfloor x \rfloor +2,\quad\forall x\in (0,\infty ) $ $ \text{(ii) } f\circ f $ is monotone Can $ f $ be non-monotone? Justify.

1996 Bosnia and Herzegovina Team Selection Test, 6
Tags: probability , number theory , floor function
Let $a$ and $b$ be two integers which are coprime and let $n$ be one variable integer. Determine probability that number of solutions $(x,y)$, where $x$ and $y$ are nonnegative integers, of equation $ax+by=n$ is $\left\lfloor \frac{n}{ab} \right\rfloor + 1$

2011 Math Prize for Girls Olympiad, 1
Tags: floor function , induction
Let $A_0$, $A_1$, $A_2$, ..., $A_n$ be nonnegative numbers such that \[ A_0 \le A_1 \le A_2 \le \dots \le A_n. \] Prove that \[ \left| \sum_{i = 0}^{\lfloor n/2 \rfloor} A_{2i} - \frac{1}{2} \sum_{i = 0}^n A_i \right| \le \frac{A_n}{2} \, . \] (Note: $\lfloor x \rfloor$ means the greatest integer that is less than or equal to $x$.)

2004 Alexandru Myller, 4
Tags: number theory , floor function , n-th root , integer part , fractional part
Find the real numbers $ x>1 $ having the property that $ \sqrt[n]{\lfloor x^n \rfloor } $ is an integer for any natural number $ n\ge 2. $ [i]Mihai Piticari[/i] and [i]Dan Popescu[/i]

2006 Austrian-Polish Competition, 7
Tags: algebra , floor function
Find all nonnegative integers $m,n$ so that \[\sum_{k=1}^{2^{m}}\lfloor \frac{kn}{2^{m}}\rfloor\in \{28,29,30\}\]

2015 India IMO Training Camp, 3
Tags: number theory , floor function , 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]

2003 China Second Round Olympiad, 2
Tags: integration , calculus , floor function , perimeter , modular arithmetic , algebra , geometry
Let the three sides of a triangle be $\ell, m, n$, respectively, satisfying $\ell>m>n$ and $\left\{\frac{3^\ell}{10^4}\right\}=\left\{\frac{3^m}{10^4}\right\}=\left\{\frac{3^n}{10^4}\right\}$, where $\{x\}=x-\lfloor{x}\rfloor$ and $\lfloor{x}\rfloor$ denotes the integral part of the number $x$. Find the minimum perimeter of such a triangle.

2013 Romanian Master of Mathematics, 1
Tags: floor function , number theory , modular arithmetic , quadratic
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.

2014 EGMO, 5
Tags: floor function , combinatorics , reachability
Let $n$ be a positive integer. We have $n$ boxes where each box contains a non-negative number of pebbles. In each move we are allowed to take two pebbles from a box we choose, throw away one of the pebbles and put the other pebble in another box we choose. An initial configuration of pebbles is called [i]solvable[/i] if it is possible to reach a configuration with no empty box, in a finite (possibly zero) number of moves. Determine all initial configurations of pebbles which are not solvable, but become solvable when an additional pebble is added to a box, no matter which box is chosen.