Found problems: 283
Determine the number of pairs of positive integers $(a, b)$, with $a \le b$, for which lcm $(a, b) = 2004$.
lcm ($a, b$) means the least common multiple of $a$ and $b$. Example: lcm $(18, 24) = 72$.
Consider a directed graph $G$ with $n$ vertices, where $1$-cycles and $2$-cycles are permitted. For any set $S$ of vertices, let $N^{+}(S)$ denote the out-neighborhood of $S$ (i.e. set of successors of $S$), and define $(N^{+})^k(S)=N^{+}((N^{+})^{k-1}(S))$ for $k\ge2$.
For fixed $n$, let $f(n)$ denote the maximum possible number of distinct sets of vertices in $\{(N^{+})^k(X)\}_{k=1}^{\infty}$, where $X$ is some subset of $V(G)$. Show that there exists $n>2012$ such that $f(n)<1.0001^n$.
[i]Linus Hamilton.[/i]
The sizes of the freshmen class and the sophomore class are in the ratio $5:4$. The sizes of the sophomore class and the junior class are in the ratio $7:8$. The sizes of the junior class and the senior class are in the ratio $9:7$. If these four classes together have a total of $2158$ students, how many of the students are freshmen?
Four consecutive three-digit numbers are divided respectively by four consecutive two-digit numbers. What minimum number of different remainders can be obtained?
[i](A. Golovanov)[/i]
Find all positive reals $x,y,z $ such that \[2x-2y+\dfrac1z = \dfrac1{2014},\hspace{0.5em} 2y-2z +\dfrac1x = \dfrac1{2014},\hspace{0.5em}\text{and}\hspace{0.5em} 2z-2x+ \dfrac1y = \dfrac1{2014}.\]
It is known that $m$ and $n$ are positive integers, $m > n^{n-1}$, and all the numbers $m+1$, $m+2$, \dots, $m+n$ are composite. Prove that there exist such different primes $p_1$, $p_2$, \dots, $p_n$ that $p_k$ divides $m+k$ for $k = 1$, 2, \dots, $n$.
[i]Proposed by C. A. Grimm [/i]
For positive integers $n, k$ with $1 \le k \le n$, define $$L(n, k) = Lcm \,(n, n - 1, n -2, ..., n - k + 1)$$
Let $f(n)$ be the largest value of $k$ such that $L(n, 1) < L(n, 2) < ... < L(n, k)$.
Prove that $f(n) < 3\sqrt{n}$ and $f(n) > k$ if $n > k! + k$.
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)}
\]
Let $ n$ be a positive integer, let $ A$ be a subset of $ \{1, 2, \cdots, n\}$, satisfying for any two numbers $ x, y\in A$, the least common multiple of $ x$, $ y$ not more than $ n$. Show that $ |A|\leq 1.9\sqrt {n} \plus{} 5$.
Find all triples $(a,b,c)$ of natural numbers, such that $LCM(a,b,c)=a+b+c$
For $ a_i \in \mathbb{Z}^ \plus{}$, $ i \equal{} 1, \ldots, k$, and $ n \equal{} \sum^k_{i \equal{} 1} a_i$, let $ d \equal{} \gcd(a_1, \ldots, a_k)$ denote the greatest common divisor of $ a_1, \ldots, a_k$.
Prove that $ \frac {d} {n} \cdot \frac {n!}{\prod\limits^k_{i \equal{} 1} (a_i!)}$ is an integer.
[i]Dan Schwarz, Romania[/i]
(a) Prove that for any two positive integers a and b the equation $lcm (a, a + 5) = lcm (b, b + 5)$ implies $a = b$.
(b) Is it possible that $lcm (a, b) = lcm (a + c, b + c)$ for positive integers $a, b$ and $c$?
(A Shapovalov)
PS. part (a) for Juniors, both part for Seniors
Let $a_1,a_2,\cdots,a_{2000}$ be distinct positive integers such that $1 \leq a_1 < a_2 < \cdots < a_{2000} < 4000$ such that the LCM (least common multiple) of any two of them is $\geq 4000$. Show that $a_1 \geq 1334$
A positive integer is [b]superb[/b] if it is the least common multiple of $1,2,\ldots, n$ for some positive integer $n$.
Find all superb $x,y,z$ such that $x+y=z$.
[i]
Proposed by usjl[/i]
* Given several numbers each of which is less than $1951$ and the least common multiple of any two of which is greater than $1951$. Prove that the sum of their reciprocals is less than $2$.
For each positive integer $ n$, let $ c(n)$ be the largest real number such that
\[ c(n) \le \left| \frac {f(a) \minus{} f(b)}{a \minus{} b}\right|\]
for all triples $ (f, a, b)$ such that
--$ f$ is a polynomial of degree $ n$ taking integers to integers, and
--$ a, b$ are integers with $ f(a) \neq f(b)$.
Find $ c(n)$.
[i]Shaunak Kishore.[/i]
Define $f\left(n\right)=\textrm{LCM}\left(1,2,\ldots,n\right)$. Determine the smallest positive integer $a$ such that $f\left(a\right)=f\left(a+2\right)$.
[i]2017 CCA Math Bonanza Lightning Round #2.4[/i]
Show that the number of ordered pairs $(a, b)$ of positive integers with lowest common multiple $n$ is the same as the number of positive divisors of $n^2$.
$[x,y]-[x,z]=y-z$ and $x \neq y \neq z \neq x$
Prove, that $x|y,x|z$
Let $d$ be a real number such that $d^2=r^2+s^2$, where $r$ and $s$ are rational numbers. Prove that we can color all points of the plane with rational coordinates with two different colors such that the points with distance $d$ have different colors.
Let $ T$ be a finite set of positive integers, satisfying the following conditions:
1. For any two elements of $ T$, their greatest common divisor and their least common multiple are also elements of $ T$.
2. For any element $ x$ of $ T$, there exists an element $ x'$ of $ T$ such that $ x$ and $ x'$ are relatively prime, and their least common multiple is the largest number in $ T$.
For each such set $ T$, denote by $ s(T)$ its number of elements. It is known that $ s(T) < 1990$; find the largest value $ s(T)$ may take.
(a) Find all triples $(x,y,z)$ of positive integers such that $xy \equiv 2 (\bmod{z})$ , $yz \equiv 2 (\bmod{x})$ and $zx \equiv 2 (\bmod{y} )$
(b) Let $n \geq 1$ be an integer. Give an algoritm to determine all triples $(x,y,z)$ such that '2' in part (a) is replaced by 'n' in all three congruences.
For how many values of $k$ is $12^{12}$ the least common multiple of the positive integers $6^6, 8^8,$ and $k$?
Determine all triples of positive integers $a, b, c$ that satisfy
a) $[a, b] + [a, c] + [b, c] = [a, b, c]$.
b) $[a, b] + [a, c] + [b, c] = [a, b, c] + (a, b, c)$.
Remark: Here $[x, y$] denotes the least common multiple of positive integers $x$ and $y$, and $(x, y)$ denotes their greatest common divisor.
Numbers $1$ through $2014$ are written on a board. A valid operation is to erase two numbers $a$ and $b$ on the board and replace them with the greatest common divisor and the least common multiple of $a$ and $b$.
Prove that, no matter how many operations are made, the sum of all the numbers that remain on the board is always larger than $2014$ $\times$ $\sqrt[2014]{2014!}$