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$.

Find all positive integers $k$ for which the equation: $$ \text{lcm}(m,n)-\text{gcd}(m,n)=k(m-n)$$ has no solution in integers positive $(m,n)$ with $m\neq n$.

Alice had picked positive integers $a, b, c$ and then tried to find positive integers $x, y, z$ such that $a = lcm (x, y)$, $b = lcm(x, z)$, $c = lcm(y, z)$. It so happened that such $x, y, z$ existed and were unique. Alice told this fact to Bob and also told him the numbers $a$ and $b$. Prove that Bob can find $c$. (Note: lcm = least common multiple.) Boris Frenkin

In the $3\times5$ grid shown, fill in each empty box with a two-digit positive integer such that: [list][*]no number appears in more than one box, and [*] for each of the $9$ lines in the grid consisting of three boxes connected by line segments, the box in the middle of the line contains the least common multiple of the numbers in the two boxes on the line.[/list] You do not need to prove that your answer is the only one possible; you merely need to find an answer that satisfies the constraints above. (Note: In any other USAMTS problem, you need to provide a full proof. Only in this problem is an answer without justification acceptable.) [asy] import graph; size(7cm); real labelscalefactor = 0.5; pen dps = linewidth(0.8) + fontsize(14); defaultpen(dps); draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); draw((2,0)--(3,0)--(3,1)--(2,1)--cycle); draw((4,0)--(5,0)--(5,1)--(4,1)--cycle); draw((6,0)--(7,0)--(7,1)--(6,1)--cycle); draw((8,0)--(9,0)--(9,1)--(8,1)--cycle); draw((0,2)--(1,2)--(1,3)--(0,3)--cycle); draw((0,4)--(1,4)--(1,5)--(0,5)--cycle); draw((2,2)--(3,2)--(3,3)--(2,3)--cycle); draw((2,4)--(3,4)--(3,5)--(2,5)--cycle); draw((4,4)--(5,4)--(5,5)--(4,5)--cycle); draw((4,2)--(5,2)--(5,3)--(4,3)--cycle); draw((6,2)--(7,2)--(7,3)--(6,3)--cycle); draw((6,4)--(7,4)--(7,5)--(6,5)--cycle); draw((8,4)--(9,4)--(9,5)--(8,5)--cycle); draw((8,2)--(9,2)--(9,3)--(8,3)--cycle); draw((0.5,1)--(0.5,2)); draw((0.5,3)--(0.5,4)); draw((1,4)--(2,3)); draw((2.5,1)--(2.5,2)); draw((2.5,3)--(2.5,4)); draw((3,4)--(4,3)); draw((3,2)--(4,1)); draw((4.5,1)--(4.5,2)); draw((4.5,3)--(4.5,4)); draw((5,4.5)--(6,4.5)); draw((7,4.5)--(8,4.5)); draw((5,4)--(6,3)); draw((7,2)--(8,1)); draw((5,2)--(6,1)); draw((5,0.5)--(6,0.5)); draw((7,0.5)--(8,0.5)); draw((8.5,1)--(8.5,2)); draw((8.5,3)--(8.5,4)); label("$4$",(4.5, 0.5)); label("$9$",(8.5, 4.5)); [/asy]

Find the largest integer $n$ such that $n$ is divisible by all positive integers less than $\sqrt[3]{n}$.

Mr. Jones has eight children of different ages. On a family trip his oldest child, who is 9, spots a license plate with a 4-digit number in which each of two digits appears two times. "Look, daddy!" she exclaims. "That number is evenly divisible by the age of each of us kids!" "That's right," replies Mr. Jones, "and the last two digits just happen to be my age." Which of the following is not the age of one of Mr. Jones's children? $ \textbf{(A) } 4 \qquad \textbf{(B) } 5 \qquad \textbf{(C) } 6 \qquad \textbf{(D) } 7 \qquad \textbf{(E) } 8$

$[x,y]-[x,z]=y-z$ and $x \neq y \neq z \neq x$ Prove, that $x|y,x|z$

How many positive integers $k$ are there such that \[\dfrac k{2013}(a+b)=lcm(a,b)\] has a solution in positive integers $(a,b)$?

(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

Prove that for any integer $k > 2$, there exist infinitely many positive integers $n$ such that the least common multiple of $n$, $n + 1$,$...$, $n + k - 1$ is greater than the least common multiple of $n + 1$,$n + 2$,$...$, $n + k$.

Let $\mathbb{N}_{\geqslant 1}$ be the set of positive integers. Find all functions $f \colon \mathbb{N}_{\geqslant 1} \to \mathbb{N}_{\geqslant 1}$ such that, for all positive integers $m$ and $n$: \[\mathrm{GCD}\left(f(m),n\right) + \mathrm{LCM}\left(m,f(n)\right) = \mathrm{GCD}\left(m,f(n)\right) + \mathrm{LCM}\left(f(m),n\right).\] Note: if $a$ and $b$ are positive integers, $\mathrm{GCD}(a,b)$ is the largest positive integer that divides both $a$ and $b$, and $\mathrm{LCM}(a,b)$ is the smallest positive integer that is a multiple of both $a$ and $b$.

Hey, This problem is from the VTRMC 2006. 3. Recall that the Fibonacci numbers $ F(n)$ are defined by $ F(0) \equal{} 0$, $ F(1) \equal{} 1$ and $ F(n) \equal{} F(n \minus{} 1) \plus{} F(n \minus{} 2)$ for $ n \geq 2$. Determine the last digit of $ F(2006)$ (e.g. the last digit of 2006 is 6). As, I and a friend were working on this we noticed an interesting relationship when writing the Fibonacci numbers in "mod" notation. Consider the following, 01 = 1 mod 10 01 = 1 mod 10 02 = 2 mod 10 03 = 3 mod 10 05 = 5 mod 10 08 = 6 mod 10 13 = 3 mod 10 21 = 1 mod 10 34 = 4 mod 10 55 = 5 mod 10 89 = 9 mod 10 Now, consider that between the first appearance and second apperance of $ 5 mod 10$, there is a difference of five terms. Following from this we see that the third appearance of $ 5 mod 10$ occurs at a difference 10 terms from the second appearance. Following this pattern we can create the following relationships. $ F(55) \equal{} F(05) \plus{} 5({2}^{2})$ This is pretty much as far as we got, any ideas?

Two distinct positive integers $a,b$ are written on the board. The smaller of them is erased and replaced with the number $\frac{ab}{|a-b|}$. This process is repeated as long as the two numbers are not equal. Prove that eventually the two numbers on the board will be equal.

Find all triples $(a, b, c)$ of natural numbers such that the sets $$\{ gcd (a, b), gcd(b, c), gcd(c, a), lcm (a, b), lcm (b, c), lcm (c, a)\}$$ and $$\{2, 3, 5, 30, 60\}$$ are the same. Remark: For example, the sets $\{1, 2013\}$ and $\{1, 1, 2013\}$ are equal.

There is more than one integer greater than $1$ which, when divided by any integer $k$ such that $2 \le k \le 11$, has a remainder of $1$. What is the difference between the two smallest such integers? $\textbf{(A) }2310\qquad\textbf{(B) }2311\qquad\textbf{(C) }27,720\qquad\textbf{(D) }27,721\qquad \textbf{(E) }\text{none of these}$

The alphabet in its natural order $\text{ABCDEFGHIJKLMNOPQRSTUVWXYZ}$ is $T_0$. We apply a permutation to $T_0$ to get $T_1$ which is $\text{JQOWIPANTZRCVMYEGSHUFDKBLX}$. If we apply the same permutation to $T_1$, we get $T_2$ which is $\text{ZGYKTEJMUXSODVLIAHNFPWRQCB}$. We continually apply this permutation to each $T_m$ to get $T_{m+1}$. Find the smallest positive integer $n$ so that $T_n=T_0$.

For every positive integer $x$, let $k(x)$ denote the number of composite numbers that do not exceed $x$. Find all positive integers $n$ for which $(k (n))! $ lcm $(1, 2,..., n)> (n - 1) !$ .

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.

How many ordered pairs $(a, b)$ of positive integers satisfy the equation $$a\cdot b + 63 = 20\cdot \text{lcm}(a, b) + 12\cdot\text{gcd}(a,b),$$ where $\text{gcd}(a,b)$ denotes the greatest common divisor of $a$ and $b$, and $\text{lcm}(a,b)$ denotes their least common multiple? $\textbf{(A)}\ 0\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 6\qquad\textbf{(E)}\ 8$

A box contains gold coins. If the coins are equally divided among six people, four coins are left over. If the coins are equally divided among five people, three coins are left over. If the box holds the smallest number of coins that meets these two conditions, how many coins are left when equally divided among seven people? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 5$

Determine if there exist five consecutive positive integers such that their LCM is a perfect square.

Let $ a>0$, and let $ P(x)$ be a polynomial with integer coefficients such that \[ P(1)\equal{}P(3)\equal{}P(5)\equal{}P(7)\equal{}a\text{, and}\] \[ P(2)\equal{}P(4)\equal{}P(6)\equal{}P(8)\equal{}\minus{}a\text{.}\] What is the smallest possible value of $ a$? $ \textbf{(A)}\ 105 \qquad \textbf{(B)}\ 315 \qquad \textbf{(C)}\ 945 \qquad \textbf{(D)}\ 7! \qquad \textbf{(E)}\ 8!$

In a room, $2/5$ of the people are wearing gloves, and $3/4$ of the people are wearing hats. What is the minimum number of people in the room wearing both a hat and a glove? $ \textbf{(A)}\ 3 \qquad\textbf{(B)}\ 5\qquad\textbf{(C)}\ 8\qquad\textbf{(D)}\ 15\qquad\textbf{(E)}\ 20 $

Let $n$ be a positive integer. (a) Prove that there exists a set $S$ of $6n$ pairwise different positive integers, such that the least common multiple of any two elements of $S$ is no larger than $32n^2$. (b) Prove that every set $T$ of $6n$ pairwise different positive integers contains two elements the least common multiple of which is larger than $9n^2$.

* 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$.