The first of an infinite triangular spreadsheet the line contains one number, the second line contains two numbers, the third line contains three numbers, and so on. In doing so is in any $k$-th row ($k = 1, 2, 3,...$) in the first and last place the number $k$, each other the number in the table is found, however, than in the previous row the least common of the two numbers above it multiple (the adjacent figure shows the first five rows of this table). We choose any two numbers from the table that are not in their row in the first or last place. Prove that one of the selected numbers is divisible by another. [img]https://cdn.artofproblemsolving.com/attachments/3/7/107d8999d9f04777719a0f1b1df418dbe00023.png[/img]

Somebody wrote $1953$ digits on a circle. The $1953$-digit number obtained by reading these figures clockwise, beginning at a certain point, is divisible by $27$. Prove that if one begins reading the figures at any other place, one gets another $1953$-digit number also divisible by $27$.

Prove that there exist infinitely many non prime positive integers $n$ such that $7^{n-1} - 3^{n-1}$ is divisible by $n$. Lê Anh Vinh

A positive integer $n$ is "[i]olympic[/i]" if there are $n$ non-negative integers $x_1, x_2, ..., x_n$ that satisfy that: $\bullet$ There is at least one positive integer $j$: $1 \le j \le n$ such that $x_j \ne 0$. $\bullet$ For any way of choosing $n$ numbers $c_1, c_2, ..., c_n$ from the set $\{-1, 0, 1\}$, where not all $c_i$ are equal to zero, it is true that the sum $c_1x_1 + c_2x_2 +... + c_nx_n$ is not divisible by $n^3$. Find the largest positive "olympic" integer.

Let $n$ be a positive integer. Prove that if the number overbrace $\underbrace{\hbox{99...9}}_{\hbox{n}}$ is divisible by $n$, then the number $\underbrace{\hbox{11...1}}_{\hbox{n}}$ is also divisible by $n$. (H. Nestra)

Let $P (x)$ be a polynomial with integer coefficients and $P (n) =m$ for some integers $n, m$ ($m \ne 10$). Prove that $P (n + km)$ is divisible by $m$ for any integer $k$.

Given $m,n \in N$ such that $M>n^{n-1}$ and the numbers $m+1, m+2, ..., m+n$ are composite. Prove that exist distinct primes $p_1,p_2,...,p_n$ such that $M+k$ is divisible by $p_k$ for any $k=1,2,...,n$. Tuymaada Olympiad 2004, C.A.Grimm. USA

What is the greatest number of integers that can be selected from a set of $2015$ consecutive numbers so that no sum of any two selected numbers is divisible by their difference?

Let $a, b, c$ be three integers such that $a + b + c$ is divisible by $13$. Prove that $$a^{2007}+b^{2007}+c^{2007}+2 \cdot 2007abc$$ is divisible by $13$.

Let $p$ be a given prime. For each prime $r$, we defind the function as following $F(r) =\frac{(p^{rp} - 1) (p - 1)}{(p^r - 1) (p^p - 1)}$. 1. Show that $F(r)$ is a positive integer for any prime $r \ne p$. 2. Show that $F(r)$ and $F(s)$ are coprime for any primes $r$ and $s$ such that $r \ne p, s \ne p$ and $r \ne s$. 3. Fix a prime $r \ne p$. Show that there is a prime divisor $q$ of $F(r)$ such that $p| q - 1$ but $p^2 \nmid q - 1$.

For each positive integer $k$, denote by $P (k)$ the number of all positive integers $4k$-digit numbers which can be composed of the digits $2, 0$ and which are divisible by the number $2 020$. Prove the inequality $$P (k) \ge \binom{2k - 1}{k}^2$$ and determine all $k$ for which equality occurs. (Note: A positive integer cannot begin with a digit of $0$.) (Jaromir Simsa)

Given integers $a> 0$, $n> 0$, suppose that $a^1 + a^2 +...+ a^n \equiv 1 \mod 10$. Prove that $a \equiv n \equiv 1 \mod 10$ .

a) $101$ numbers are selected from the set $1, 2, . . . , 200$. Prove that among the numbers selected there is a pair in which one number is divisible by the other. b) One number less than $16$, and $99$ other numbers are selected from the set $1, 2, . . . , 200$. Prove that among the selected numbers there are two such that one divides the other.

A positive integer is called a repunit, if it is written only by ones. The repunit with $n$ digits will be denoted as $\underbrace{{11\cdots1}}_{n}$ . Prove that: α) the repunit $\underbrace{{11\cdots1}}_{n}$is divisible by $37$ if and only if $n$ is divisible by $3$ b) there exists a positive integer $k$ such that the repunit $\underbrace{{11\cdots1}}_{n}$ is divisible by $41$ if $n$ is divisible by $k$

A sequence of positive integers $g_1$, $g_2$, $g_3$, $. . . $ is defined as follows: $g_1 = 1$ and for every positive integer $n$, $$g_{n + 1} = g^2_n + g_n + 1.$$ Show that $g^2_{n} + 1$ divides $g^2_{n + 1}+1$ for every positive integer $n$.

Given a positive integer $k$. Find the condition of positive integer $m$ over $k$ such that there exists only one positive integer $n$ satisfying $$n^m | 5^{n^k} + 1,$$