Found problems: 283
How many positive integers $n$ are there such that $n$ is a multiple of $5$, and the least common multiple of $5!$ and $n$ equals $5$ times the greatest common divisor of $10!$ and $n?$
$\textbf{(A) } 12 \qquad \textbf{(B) } 24 \qquad \textbf{(C) } 36 \qquad \textbf{(D) } 48 \qquad \textbf{(E) } 72$
Define $L_n$ as the least common multiple of all the integers from $1$ to $n$ inclusive. There is a unique integer $h$ such that $\frac{1}{1}+\frac{1}{2}+\frac{1}{3} \ldots +\frac{1}{17}=\frac{h}{L_{17}}$. What is the remainder when $h$ is divided by $17?$
$\textbf{(A) } 1 \qquad \textbf{(B) } 3 \qquad \textbf{(C) } 5 \qquad \textbf{(D) } 7 \qquad \textbf{(E) } 9$
A farmer divides his herd of $n$ cows among his four sons so that one son gets one-half the herd, a second son, one-fourth, a third son, one-fifth, and the fourth son, 7 cows. Then $n$ is:
$ \textbf{(A)}\ 80 \qquad\textbf{(B)}\ 100\qquad\textbf{(C)}\ 140\qquad\textbf{(D)}\ 180\qquad\textbf{(E)}\ 240 $
Let $c$ be the least common multiple of positive integers $a$ and $b$, and $d$ be the greatest common divisor of $a$ and $b$. How many pairs of positive integers $(a,b)$ are there such that
\[
\dfrac {1}{a} + \dfrac {1}{b} + \dfrac {1}{c} + \dfrac {1}{d} = 1?
\]
$
\textbf{(A)}\ 6
\qquad\textbf{(B)}\ 5
\qquad\textbf{(C)}\ 4
\qquad\textbf{(D)}\ 3
\qquad\textbf{(E)}\ 2
$
Determine the maximum integer $ n $ such that for each positive integer $ k \le \frac{n}{2} $ there are two positive divisors of $ n $ with difference $ k $.
Let $N$ be a natural number and $x_1, \ldots , x_n$ further natural numbers less than $N$ and such that the least common multiple of any two of these $n$ numbers is greater than $N$. Prove that the sum of the reciprocals of these $n$ numbers is always less than $2$: $\sum^n_{i=1} \frac{1}{x_i} < 2.$
Do there exist $100$ positive integers such that their sum is equal to their least common multiple?
(S Tokarev)
Given distinct positive integers $a_1,\,a_2,\,\dots,a_n$. Let $b_i = (a_i - a_1) (a_i-a_2) \dots (a_i-a_{i-1}) (a_i-a_{i+1})\dots(a_i-a_n)$. Prove that the least common multiple $[b_1,b_2,\dots,b_n]$ is divisible by $(n-1)!.$
Define the sequence $(a_n)_{n=1}^\infty$ of positive integers by $a_1=1$ and the condition that $a_{n+1}$ is the least integer such that \[\mathrm{lcm}(a_1, a_2, \ldots, a_{n+1})>\mathrm{lcm}(a_1, a_2, \ldots, a_n)\mbox{.}\]
Determine the set of elements of $(a_n)$.
Let $ 1\le a_1<a_2<\cdots<a_m\le N$ be a sequence of integers such that the least common multiple of any two of its elements is not greater than $ N$. Show that $ m\le 2\left[\sqrt{N}\right]$, where $ \left[\sqrt{N}\right]$ denotes the greatest integer $ \le \sqrt{N}$
Find all ordered pairs of positive integers $(r, s)$ for which there are exactly $35$ ordered pairs of positive integers $(a, b)$ such that the least common multiple of $a$ and $b$ is $2^r \cdot 3^s$.
Find the smallest positive integer $n$ such that [list][*] $n$ has exactly $144$ distinct positive divisors, [*] there are ten consecutive integers among the positive divisors of $n$. [/list]
A positive integer is called [i]monotone[/i] if has at least two digits and all its digits are nonzero and appear in a strictly increasing or strictly decreasing order.
(a) Compute the sum of all monotone five-digit numbers.
(b) Find the number of final zeros in the least common multiple of all monotone numbers (with any number of digits).
A sequence $a_1,a_2,a_3,\ldots $ of non-negative integers is such that $a_{n+1}$ is the last digit of $a_n^n+a_{n-1}$ for all $n>2$. Is it always true that for some $n_0$ the sequence $a_{n_0},a_{n_0+1},a_{n_0+2},\ldots$ is periodic?
For every natural number $ n $, define $ s(n) $ as the smallest natural number so that for every natural number $ a $ relatively prime to $n$, this equation holds: \[ a^{s(n)} \equiv 1 (mod n) \]
Find all natural numbers $ n $ such that $ s(n) = 2010 $
Let $n \ge 2$ be a positive integer. Suppose $a_1, a_2, \dots, a_n$ are distinct integers. For $k = 1, 2, \dots, n$, let
\[ s_k := \prod_{\substack{i \not= k, \\ 1 \le i \le n}} |a_k - a_i|, \]
i.e. $s_k$ is the product of all terms of the form $|a_k - a_i|$, where $i \in \{ 1, 2, \dots, n \}$ and $i \not= k$.
Find the largest positive integer $M$ such that $M$ divides the least common multiple of $s_1, s_2, \dots, s_n$ for any choices of $a_1, a_2, \dots, a_n$.
Find all positive integers $x, y, z$ that satisfy the conditions: $$[x,y,z] =(x,y)+(y,z) + (z,x), x\le y\le z, (x,y,z) = 1$$
The symbols $[m,n]$ and $(m,n)$ respectively represent positive integers, the least common multiple and the greatest common divisor of $m$ and $n$.
With $ \$1000$ a rancher is to buy steers at $ \$25$ each and cows at $ \$26$ each. If the number of steers $ s$ and the number of cows $ c$ are both positive integers, then:
$ \textbf{(A)}\ \text{this problem has no solution}\qquad\\
\textbf{(B)}\ \text{there are two solutions with }{s}\text{ exceeding }{c}\qquad \\
\textbf{(C)}\ \text{there are two solutions with }{c}\text{ exceeding }{s}\qquad \\
\textbf{(D)}\ \text{there is one solution with }{s}\text{ exceeding }{c}\qquad \\
\textbf{(E)}\ \text{there is one solution with }{c}\text{ exceeding }{s}$
Let $N$ be a natural number and $x_1, \ldots , x_n$ further natural numbers less than $N$ and such that the least common multiple of any two of these $n$ numbers is greater than $N$. Prove that the sum of the reciprocals of these $n$ numbers is always less than $2$: $\sum^n_{i=1} \frac{1}{x_i} < 2.$
Let $L(n)$ denote the least common multiple of $\{1, 2 . . . , n\}$.
(i) Prove that there exists a positive integer $k$ such that $L(k) = L(k + 1) = ... = L(k + 2000)$.
(ii) Find all $m$ such that $L(m + i) \ne L(m + i + 1)$ for all $i = 0, 1, 2$.
Find the smallest positive integer $k$ such that
\[\binom{x+kb}{12} \equiv \binom{x}{12} \pmod{b}\]
for all positive integers $b$ and $x$. ([i]Note:[/i] For integers $a,b,c$ we say $a \equiv b \pmod c$ if and only if $a-b$ is divisible by $c$.)
[i]Alex Zhu.[/i]
[hide="Clarifications"][list=1][*]${{y}\choose{12}} = \frac{y(y-1)\cdots(y-11)}{12!}$ for all integers $y$. In particular, ${{y}\choose{12}} = 0$ for $y=1,2,\ldots,11$.[/list][/hide]
The function $f$, defined on the set of ordered pairs of positive integers, satisfies the following properties:
\begin{eqnarray*} f(x,x) &=& x, \\ f(x,y) &=& f(y,x), \quad \text{and} \\ (x + y) f(x,y) &=& yf(x,x + y). \end{eqnarray*}
Calculate $f(14,52)$.
What is the smallest positive integer than can be expressed as the sum of nine consecutive integers, the sum of ten consecutive integers, and the sum of eleven consecutive integers?
For every natural number $a$ and $b$, define the notation $[a,b]$ as the least common multiple of $a $ and $b$ and the notation $(a,b)$ as the greatest common divisor of $a$ and $b$. Find all $n \in \mathbb{N}$ that satisfies
\[
4 \sum_{k=1}^{n} [n,k] = 1 + \sum_{k=1}^{n} (n,k) + 2n^2 \sum_{k=1}^{n} \frac{1}{(n,k)}
\]
Denote by $[a, b]$ the least common multiple of $a$ and $b$.
Let $n$ be a positive integer such that $[n, n + 1] > [n, n + 2] >...> [n, n + 35]$. Prove that $[n, n + 35] > [n,n + 36]$.