Found problems: 1340
Let $s(n)$ be the sum of all positive divisors of $n$, so $s(6) = 12$. We say $n$ is almost perfect if $s(n) = 2n - 1$. Let $\mod(n, k)$ denote the residue of $n$ modulo $k$ (in other words, the remainder of dividing $n$ by $k$). Put $t(n) = \mod(n, 1) + \mod(n, 2) + \cdots + \mod(n, n)$.
Show that $n$ is almost perfect if and only if $t(n) = t(n-1)$.
(a) Given a positive integer $k$, prove that there do not exist two distinct integers in the open interval $(k^2, (k + 1)^2)$ whose product is a perfect square.
(b) Given an integer $n > 2$, prove that there exist $n$ distinct integers in the open interval $(k^n, (k + 1)^n)$ whose product is the $n$-th power of an integer, for all but a finite number of positive integers $k$.
[i]AMM Magazine[/i]
A word is a sequence of n letters of the alphabet {a, b, c, d}. A word is said to be complicated if it contains two consecutive groups of identic letters. The words caab, baba and cababdc, for example, are complicated words, while bacba and dcbdc are not. A word that is not complicated is a simple word. Prove that the numbers of simple words with n letters is greater than $2^n$, if n is a positive integer.
Let $I$ be an open interval of length $\frac{1}{n}$, where $n$ is a positive integer. Find the maximum possible number of rational numbers of the form $\frac{a}{b}$ where $1 \le b \le n$ that lie in $I$.
In triangle $ABC,$ it is given that angles $B$ and $C$ are congruent. Points $P$ and $Q$ lie on $\overline{AC}$ and $\overline{AB},$ respectively, so that $AP=PQ=QB=BC.$ Angle $ACB$ is $r$ times as large as angle $APQ,$ where $r$ is a positive real number. Find the greatest integer that does not exceed $1000r.$
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$
Given a positive integer $k$, find the least integer $n_k$ for which there exist five sets $S_1, S_2, S_3, S_4, S_5$ with the following properties:
\[|S_j|=k \text{ for } j=1, \cdots , 5 , \quad |\bigcup_{j=1}^{5} S_j | = n_k ;\]
\[|S_i \cap S_{i+1}| = 0 = |S_5 \cap S_1|, \quad \text{for } i=1,\cdots ,4 \]
For each positive integer $n$ we consider the function $f_{n}:[0,n]\rightarrow{\mathbb{R}}$ defined by $f_{n}(x)=\arctan{\left(\left\lfloor x\right\rfloor \right)} $, where $\left\lfloor x\right\rfloor $ denotes the floor of the real number $x$. Prove that $f_{n}$ is a Riemann Integrable function and find $\underset{n\rightarrow\infty}{\lim}\frac{1}{n}\int_{0}^{n}f_{n}(x)\mathrm{d}x.$
Find all real solutions $x$ of the equation $$\lfloor x^2-2 \rfloor +2 \lfloor x \rfloor = \lfloor x \rfloor ^2. $$
.
Let $\langle a_n\rangle_{n\ge 0}$ be a sequence of integers satisfying $a_0=1, a_1=3$ and $a_{n+2}=1+\left\lfloor \frac{a_{n+1}^2}{a_n}\right\rfloor \ \ \forall n\ge0.$
Prove that
$a_n\cdot a_{n+2}-a_{n+1}^2=2^n$ for every natural number $n.$
Find the largest integer $n$ for which $2^n$ divides \[ \binom 21 \binom 42 \binom 63 \dots \binom {128}{64}. \][i]Proposed by Evan Chen[/i]
Find the maximum number of subsets from $\left \{ 1,...,n \right \}$ such that for any two of them like $A,B$ if $A\subset B$ then $\left | B-A \right |\geq 3$. (Here $\left | X \right |$ is the number of elements of the set $X$.)
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*}
(a) Prove that \[ [5x]\plus{}[5y] \ge [3x\plus{}y] \plus{} [3y\plus{}x],\] where $ x,y \ge 0$ and $ [u]$ denotes the greatest integer $ \le u$ (e.g., $ [\sqrt{2}]\equal{}1$).
(b) Using (a) or otherwise, prove that \[ \frac{(5m)!(5n)!}{m!n!(3m\plus{}n)!(3n\plus{}m)!}\] is integral for all positive integral $ m$ and $ n$.
Let $S$ be a set consisting of $m$ pairs $(a,b)$ of positive integers with the property that $1 \leq a < b \leq n$. Show that there are at least
\[ 4m \cdot \dfrac{(m - \dfrac{n^2}{4})}{3n} \]
triples $(a,b,c)$ such that $(a,b)$, $(a,c)$, and $(b,c)$ belong to $S$.
The equation $x^3-3x^2+1=0$ has three real solutions $x_1<x_2<x_3$. Show that for any positive integer $n$, the number $\left\lceil x_3^n\right\rceil$ is a multiple of $3$.
Determine the integral part of $A$, where $A =\frac{1}{672}+\frac{1}{673}+... +\frac{1}{2014}$
Given real numbers $ x_1 < x_2 < \ldots < x_n$ such that every real number occurs at most two times among the differences $ x_j \minus{} x_i$, $ 1\leq i < j \leq n$, prove that there exists at least $ \lfloor n/2\rfloor$ real numbers that occurs exactly one time among such differences.
For a positive integer $k$, define the $k$-[i]pop[/i] of a positive integer $n$ as the infinite sequence of integers $a_1, a_2, ...$ such that $a_1 = n$ and $$a_{i+1}= \left\lfloor \frac{a_i}{k} \right\rfloor , i = 1, 2, ..$$
where $ \lfloor x\rfloor $ denotes the greatest integer less than or equal to $x$. Furthermore, define a positive integer $m$ to be $k$-[i]pop avoiding[/i] if $k$ does not divide any nonzero term in the $k$-pop of $m$. For example, $14$ is 3-pop avoiding because $3$ does not divide any nonzero term in the $3$-pop of $14$, which is $14, 4, 1, 0, 0, ....$ Suppose that the number of positive integers less than $13^{2018}$ which are $13$-pop avoiding is equal to N. What is the remainder when $N$ is divided by $1000$?
Let $n$ be a positive integer and let $a_1\le a_2 \le \dots \le a_n$ be real numbers such that
\[a_1+2a_2+\dots+na_n=0.\]
Prove that
\[a_1[x]+a_2[2x]+\dots+a_n[nx] \ge 0\]
for every real number $x$. (Here $[t]$ denotes the integer satisfying $[t] \le t<[t]+1$.)
What is the probability that an integer in the set $ \{1,2,3,\ldots,100\}$ is divisible by $ 2$ and not divisible by $ 3$?
$ \textbf{(A)}\ \frac{1}{6} \qquad
\textbf{(B)}\ \frac{33}{100} \qquad
\textbf{(C)}\ \frac{17}{50} \qquad
\textbf{(D)}\ \frac{1}{2} \qquad
\textbf{(E)}\ \frac{18}{25}$
[i]The Marathon.[/i] Let $\omega$ denote the incircle of triangle $ABC$. The segments $BC$, $CA$, and $AB$ are tangent to $\omega$ at $D$, $E$ and $F$, respectively. Point $P$ lies on $EF$ such that segment $PD$ is perpendicular to $BC$. The line $AP$ intersects $BC$ at $Q$. The circles $\omega_1$ and $\omega_2$ pass through $B$ and $C$, respectively, and are tangent to $AQ$ at $Q$; the former meets $AB$ again at $X$, and the latter meets $AC$ again at $Y$. The line $XY$ intersects $BC$ at $Z$. Given that $AB=15$, $BC=14$, and $CA=13$, find $\lfloor XZ\cdot YZ\rfloor$.
Let $n$ be a positive integer. Let $a$ be an integer such that $\gcd (a,n)=1$. Prove that
\[\frac{a^{\phi (n)}-1}{n}=\sum_{i\in R}\frac{1}{ai}\left[\frac{ai}{n}\right]\pmod{n}\]
where $R$ is the reduced residue system of $n$ with each element a positive integer at most $n$.
On a soccer tournament with $n\ge 3$ teams taking part, several matches are played in such a way that among any three teams, some two play a match.
$(a)$ If $n=7$, find the smallest number of matches that must be played.
$(b)$ Find the smallest number of matches in terms of $n$.
Show that for any natural number $n$, the number $A = [\frac{n + 3}{4}] + [ \frac{n + 5}{4} ] + [\frac{n}{2} ] +n^2 + 3n + 3$ is a perfect square. ($[x]$ denotes the integer part of the real number x.)