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 all primes $p \geq 3$ with the following property: for any prime $q<p$, the number \[ p - \Big\lfloor \frac{p}{q} \Big\rfloor q \] is squarefree (i.e. is not divisible by the square of a prime).
How many positive integers are there such that $\left \lfloor \frac m{11} \right \rfloor = \left \lfloor \frac m{10} \right \rfloor$? ($\left \lfloor x \right \rfloor$ denotes the greatest integer not exceeding $x$.) $ \textbf{(A)}\ 44 \qquad\textbf{(B)}\ 48 \qquad\textbf{(C)}\ 52 \qquad\textbf{(D)}\ 54 \qquad\textbf{(E)}\ 56 $
Let $R$ be the region in the Cartesian plane of points $(x,y)$ satisfying $x\geq 0$, $y\geq 0$, and $x+y+\lfloor x\rfloor+\lfloor y\rfloor\leq 5$. Determine the area of $R$.
The number of postive integers less than $1000$ divisible by neither $5$ nor $7$ is: $\text{(A)}\ 688 \qquad \text{(B)}\ 686\qquad \text{(C)}\ 684 \qquad \text{(D)}\ 658\qquad \text{(E)}\ 630$
Let $ a$ and $ b$ be natural numbers such that \[ \frac{a}{b}=1-\frac{1}{2}+\frac{1}{3}-\frac{1}{4}+\cdots-\frac{1}{1318}+\frac{1}{1319}. \] Prove that $ a$ is divisible by $ 1979$.
Find all positive integer number $n$ such that $[\sqrt{n}]-2$ divides $n-4$ and $[\sqrt{n}]+2$ divides $n+4$. Note: $[r]$ denotes the integer part of $r$.
Let $AXYZB$ be a convex pentagon inscribed in a semicircle with diameter $AB$. Suppose that $AZ-AX=6$, $BX-BZ=9$, $AY=12$, and $BY=5$. Find the greatest integer not exceeding the perimeter of quadrilateral $OXYZ$, where $O$ is the midpoint of $AB$. [i]Proposed by Evan Chen[/i]
For every natural number $n$ we define \[f(n)=\left\lfloor n+\sqrt{n}+\frac{1}{2}\right\rfloor\] Show that for every integer $k \geq 1$ the equation \[f(f(n))-f(n)=k\] has exactly $2k-1$ solutions.
Let $S=\{1,2,3,\ldots,2012\}.$ We want to partition $S$ into two disjoint sets such that both sets do not contain two different numbers whose sum is a power of $2.$ Find the number of such partitions.
Let $T=\text{TNFTPP}$. For natural numbers $k,n\geq 2$, we define $S(k,n)$ such that \[S(k,n)=\left\lfloor\dfrac{2^{n+1}+1}{2^{n-1}+1}\right\rfloor+\left\lfloor\dfrac{3^{n+1}+1}{3^{n-1}+1}\right\rfloor+\cdots+\left\lfloor\dfrac{k^{n+1}+1}{k^{n-1}+1}\right\rfloor.\] Compute the value of $S(10,T+55)-S(10,55)+S(10,T-55)$.
Prove that if $a$ and $b$ are positive integers and $ab>1$, then \[\left\lfloor\frac{(a-b)^2-1}{ab}\right\rfloor=\left\lfloor\frac{(a-b)^2-1}{ab-1}\right\rfloor.\]Here $\lfloor x\rfloor$ denotes the greatest integer not exceeding $x$. [i]Calvin Deng.[/i]
Let $n$ be a positive integer prove that $$6\nmid \lfloor (\sqrt[3]{28}-3)^{-n} \rfloor.$$
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 ]\]
We define an operation $\oplus$ on the set $\{0, 1\}$ by \[ 0 \oplus 0 = 0 \,, 0 \oplus 1 = 1 \,, 1 \oplus 0 = 1 \,, 1 \oplus 1 = 0 \,.\] For two natural numbers $a$ and $b$, which are written in base $2$ as $a = (a_1a_2 \ldots a_k)_2$ and $b = (b_1b_2 \ldots b_k)_2$ (possibly with leading 0's), we define $a \oplus b = c$ where $c$ written in base $2$ is $(c_1c_2 \ldots c_k)_2$ with $c_i = a_i \oplus b_i$, for $1 \le i \le k$. For example, we have $7 \oplus 3 = 4$ since $ 7 = (111)_2$ and $3 = (011)_2$. For a natural number $n$, let $f(n) = n \oplus \left[ n/2 \right]$, where $\left[ x \right]$ denotes the largest integer less than or equal to $x$. Prove that $f$ is a bijection on the set of natural numbers.
Consider rows of the form: $[x], [2x], [3x], ...$ Proof that, if $N \in N$ does not occur in the sequence $([n x])$, then there is an $n \in N$ with $n - 1 < \frac{N}{x}< n -\frac{1}{x}$ Prove that, for $x, y \notin Q$: $\frac{1}{x}+\frac{1}{y} = 1$, then each $N \in N$ term is either of $([nx])$ or of $([ny])$.
Given 2005 distinct numbers $a_1,\,a_2,\dots,a_{2005}$. By one question, we may take three different indices $1\le i<j<k\le 2005$ and find out the set of numbers $\{a_i,\,a_j,\,a_k\}$ (unordered, of course). Find the minimal number of questions, which are necessary to find out all numbers $a_i$.
The value of $$\left\lfloor\frac1{3!}+\frac4{4!}+\frac9{5!}+\ldots\right\rfloor$$
a) Prove that there are infinitely many pairs $(m, n)$ of positive integers satisfying the following equality $[(4 + 2\sqrt3)m] = [(4 -2\sqrt3)n]$ b) Prove that if $(m, n)$ satisfies the equality, then the number $(n + m)$ is odd. (I. Voronovich)
Consider the increasing sequence $1,2,4,5,7,9,10,12,14,16,17,19,\dots$ of positive integers, obtained by concatenating alternating blocks $\{1\},\{2,4\},\{5,7,9\},\{10,12,14,16\},\dots$ of odd and even numbers. Each block contains one more element than the previous one and the first element in each block is one more than the last element of the previous one. Prove that the $n$-th element of the sequence is given by \[2n-\Big\lfloor\frac{1+\sqrt{8n-7}}{2}\Big\rfloor.\] (Here $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$.)
There exists some integers $n,a_1,a_2,\ldots,a_{2012}$ such that \[ n^2=\sum_{1 \leq i \leq 2012}{{a_i}^{p_i}} \] where $p_i$ is the i-th prime ($p_1=2,p_2=3,p_3=5,p_4=7,\ldots$) and $a_i>1$ for all $i$?
Assume $x_{1},x_{2},\dots,x_{n}\in\mathbb R^{+}$, $\sum_{i=1}^{n}x_{i}^{2}=n$, $\sum_{i=1}^{n}x_{i}\geq s>0$ and $0\leq\lambda\leq1$. Prove that at least $\left\lceil\frac{s^{2}(1-\lambda)^{2}}n\right\rceil$ of these numbers are larger than $\frac{\lambda s}{n}$.
For how many positive integers $n$ less than or equal to $1000$ is \[(\sin t + i \cos t)^n=\sin nt + i \cos nt\] true for all real $t$?
Let $a_1,a_2,\ldots,a_n,\ldots$ be any permutation of all positive integers. Prove that there exist infinitely many positive integers $i$ such that $\gcd(a_i,a_{i+1})\leq \frac{3}{4} i$.
A function $f(S)$ assigns to each nine-element subset of $S$ of the set $\{1,2,\ldots, 20\}$ a whole number from $1$ to $20$. Prove that regardless of how the function $f$ is chosen, there will be a ten-element subset $T\subset\{1,2,\ldots, 20\}$ such that $f(T - \{k\})\neq k$ for all $k\in T$.
Determine the maximum number $ h$ satisfying the following condition: for every $ a\in [0,h]$ and every polynomial $ P(x)$ of degree 99 such that $ P(0)\equal{}P(1)\equal{}0$, there exist $ x_1,x_2\in [0,1]$ such that $ P(x_1)\equal{}P(x_2)$ and $ x_2\minus{}x_1\equal{}a$. [i]Proposed by F. Petrov, D. Rostovsky, A. Khrabrov[/i]