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: 1340

Find the largest integer $n$ such that $n$ is divisible by all positive integers less than $\sqrt[3]{n}$.
Let $n \ge 0$ be an integer. A sequence $a_0,a_1,a_2,...$ of integers is de fined 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$.
$3m$ balls numbered $1, 1, 1, 2, 2, 2, 3, 3, 3, \ldots, m, m, m$ are distributed into $8$ boxes so that any two boxes contain identical balls. Find the minimal possible value of $m$.
Let $M$ be a nonempty subset of $\mathbb Z^+$ such that for every element $x$ in $M,$ the numbers $4x$ and $\lfloor \sqrt x \rfloor$ also belong to $M.$ Prove that $M = \mathbb Z^+.$
Let $ a,b,c $ be real numbers satisfying $ \left\lfloor a^2+b^2+c^2 \right\rfloor \le\lfloor ab+bc+ca \rfloor . $ Show that: $$ 2 >\max\left\{ \left| -2a+b+c \right| ,\left| a-2b+c \right| ,\left| a+b-2c \right| \right\} $$ [i]Merticaru[/i]
Each one of 2009 distinct points in the plane is coloured in blue or red, so that on every blue-centered unit circle there are exactly two red points. Find the gratest possible number of blue points.
Let $p, q$ and $r$ be positive real numbers such that the equation $$\lfloor pn \rfloor + \lfloor qn \rfloor + \lfloor rn \rfloor = n$$ is satisfied for infinitely many positive integers $n{}$. (a) Prove that $p, q$ and $r$ are rational. (b) Determine the number of positive integers $c$ such that there exist positive integers $a$ and $b$, for which the equation $$\left \lfloor \frac{n}{a} \right \rfloor+\left \lfloor \frac{n}{b} \right \rfloor+\left \lfloor \frac{cn}{202} \right \rfloor=n$$ is satisfied for infinitely many positive integers $n{}$.
Trilandia is a very unusual city. The city has the shape of an equilateral triangle of side lenght 2012. The streets divide the city into several blocks that are shaped like equilateral triangles of side lenght 1. There are streets at the border of Trilandia too. There are 6036 streets in total. The mayor wants to put sentinel sites at some intersections of the city to monitor the streets. A sentinel site can monitor every street on which it is located. What is the smallest number of sentinel sites that are required to monitor every street of Trilandia?
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$ .
Let $p$ and $q$ be distinct odd primes. Show that $$\bigg\lceil \dfrac{p^q+q^p-pq+1}{pq} \bigg\rceil$$ is even.
The integers from $1$ to $999999$ are partitioned into two groups: the first group consists of those integers for which the closest perfect square is odd, whereas the second group consists of those for which the closest perfect square is even. In which group is the sum of the elements greater?
Lines $l$ and $m$ are perpendicular. Line $l$ partitions a convex polygon into two parts of equal area, and partitions the projection of the polygon onto $m$ into two line segments of length $a$ and $b$ respectively. Determine the maximum value of $\left\lfloor \frac{1000a}{b} \right\rfloor$. (The floor notation $\lfloor x \rfloor$ denotes largest integer not exceeding $x$)
Now Wendy wanders over and joins Dr. Lisi and her younger siblings. Thinking she knows everything there is about how to work with arithmetic series, she nearly turns right around to walk back home when Dr. Lisi poses a more challenging problem. "Suppose I select two distinct terms at random from the $2008$ term sequence. What's the probability that their product is positive?" If $a$ and $b$ are relatively prime positive integers such that $a/b$ is the probability that the product of the two terms is positive, find the value of $a+b$.
How many $0$s are there at the end of the decimal representation of $2000!$? $ \textbf{(A)}\ 222 \qquad\textbf{(B)}\ 499 \qquad\textbf{(C)}\ 625 \qquad\textbf{(D)}\ 999 \qquad\textbf{(E)}\ \text{None of the preceding} $
Let $ \alpha,\beta$ be real numbers satisfying $ 1 < \alpha < \beta.$ Find the greatest positive integer $ r$ having the following property: each of positive integers is colored by one of $ r$ colors arbitrarily, there always exist two integers $ x,y$ having the same color such that $ \alpha\le \frac {x}{y}\le\beta.$
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?
Find all numbers $\alpha$ for which the equation \[x^2 - 2x[x] + x -\alpha = 0\] has two nonnegative roots. ($[x]$ denotes the largest integer less than or equal to x.)
A flea moves in the positive direction on the real Ox axis, starting from the origin. He can only jump over distances equal with $\sqrt 2$ or $\sqrt{2005}$. Prove that there exists $n_0$ such that the flea can reach any interval $[n,n+1]$ with $n\geq n_0$.
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} \]
For each positive integer $n$, let $f(n)$ be the maximal natural number such that: $2^{f(n)}$ divides $\sum^{\left\lfloor \frac{n - 1}{2}\right\rfloor}_{i=0} \binom{n}{2 \cdot i + 1} 3^i$. Find all $n$ such that $f(n) = 1996.$ [hide="old version"]For each positive integer $n$, let $f(n)$ be the maximal natural number such that: $2^{f(n)}$ divides $\sum^{n + 1/2}_{i=1} \binom{2 \cdot i + 1}{n}$. Find all $n$ such that $f(n) = 1996.$[/hide]
$ n$ points (no three being collinear) are given in a plane. Some points are connected and they form $ k$ segments. If no three of these segments form triangle ( equiv. there are no three points, such that each two of them are connected) prove that $ k \leq \left \lfloor \frac {n^{2}}{4}\right\rfloor$
Let $p$ be a prime number of the form $4k+1$. Show that \[\sum^{p-1}_{i=1}\left( \left \lfloor \frac{2i^{2}}{p}\right \rfloor-2\left \lfloor \frac{i^{2}}{p}\right \rfloor \right) = \frac{p-1}{2}.\]
Determine all positive integers $n$ such that $\lfloor \sqrt{n} \rfloor - 1$ divides $n + 1$ and $\lfloor \sqrt{n} \rfloor +2$ divides $ n + 4$.
Three speed skaters have a friendly "race" on a skating oval. They all start from the same point and skate in the same direction, but with different speeds that they maintain throughout the race. The slowest skater does $1$ lap per minute, the fastest one does $3.14$ laps per minute, and the middle one does $L$ laps a minute for some $1 < L < 3.14$. The race ends at the moment when all three skaters again come together to the same point on the oval (which may differ from the starting point.) Determine the number of different choices for $L$ such that exactly $117$ passings occur before the end of the race. Note: A passing is defined as when one skater passes another one. The beginning and the end of the race when all three skaters are together are not counted as passings.
Find all possible values of $$ \lfloor \frac{x - p}{p} \rfloor + \lfloor \frac{-x-1}{p} \rfloor $$ where $x$ is a real number and $p$ is a nonzero integer. Here $\lfloor z \rfloor$ denotes the greatest integer less than or equal to $z$.