Found problems: 408
Show that if $a$ and $b$ are integer numbers, and $a^2 + b^2 + 9ab$ is divisible by $11$, then $a^2-b^2$ divisible by $11$.
A set $A$ contains $956$ natural numbers between $1$ and $2014$, inclusive. Prove that in the set $A$ there are two numbers $a$ and $b$ such that $a + b$ is divided by $19$.
A prime $p$ and a positive integer $n$ are given. The product $$(1^3+1)(2^3+1)...((n-1)^3+1)(n^3+1)$$ is divisible by $p^3$. Prove that $p \leq n+1$.
[i]Proposed by Z. Luria[/i]
Find a way to write all the digits of $1$ to $9$ in a sequence and without repetition, so that the numbers determined by any two consecutive digits of the sequence are divisible by $7$ or $13$.
We define $N !!$ to be $N(N - 2)(N -4)...5 \cdot 3 \cdot 1$ if $N$ is odd and $N(N -2)(N -4)... 6\cdot 4\cdot 2$ if $N$ is even .
For example, $8 !! = 8 \cdot 6\cdot 4\cdot 2$ , and $9 !! = 9v 7 \cdot 5\cdot 3 \cdot 1$ .
Prove that $1986 !! + 1985 !!$ i s divisible by $1987$.
(V.V . Proizvolov , Moscow)
Given $m, n$ such that $m > n^{n-1}$ and the number $m+1$, $m+2$,$ ...$, $m+n$ are composite. Prove that there exist distinct primes $p_1, p_2, ..., p_n$ such that $m + k$ is divisible by $p_k$ for each $k = 1, 2, ...$
a) Suppose that $n$ is an odd integer. Prove that $k(n-k)$ is divisible by $2$ for all positive integers $k$.
b) Find an integer $k$ such that $k(100-k)$ is not divisible by $11$.
c) Suppose that $p$ is an odd prime, and $n$ is an integer.
Prove that there is an integer $k$ such that $k(n-k)$ is not divisible by $p$.
d) Suppose that $p,q$ are two different odd primes, and $n$ is an integer.
Prove that there is an integer $k$ such that $k(n-k)$ is not divisible by any of $p,q$.
Show that for any integer $n$ the number \[a_n=\frac{\bigl(2+\sqrt3\bigr)^n-\bigl(2-\sqrt3\bigr)^n}{2\sqrt3}\] is also integer. Determine all integers $n$ such that $a_n$ is divisible by 3.
Prove that there is no positive integer $n>1$ such that $n\mid2^{n} -1.$
What is the largest positive integer $n$ such that $10 \times 11 \times 12 \times ... \times 50$ is divisible by $10^n$?
Find the smallest positive integer $n$ that satisfies that for any $n$ different integers, the product of all the positive differences of these numbers is divisible by $2014$.
Find a positive integer $x$, with $x> 1$ such that all numbers in the sequence $$x + 1,x^x + 1,x^{x^x}+1,...$$ are divisible by $2009.$
Prove that if three prime numbers form an arithmetic progression whose difference is not divisible by 6, then the smallest of these numbers is $3 $.
Let $p$ be a prime, and let $a_1, a_2, a_3, . . .$ be a sequence of positive integers so that $a_na_{n+2} = a^2_{n+1} + p$ for all positive integers $n$. Show that $a_{n+1}$ divides $a_n + a_{n+2}$ for all positive integers $n$.
Let $n$ be a positive integer. Prove that there exist integers $a_1, a_2,..., a_n$ such that for any integer $x$, the number $(... (((x^2 + a_1)^2 + a_2)^2 + ...)^2 + a_{n-1})^2 + a_n$ is divisible by $2n - 1$.
Do integers $a, b$ exist such that $a^{2006} + b^{2006} + 1$ is divisible by $2006^2$?
In a sequence of natural numbers $ a_1 $, $ a_2 $, $ \dots $, $ a_ {1999} $, $ a_n-a_ {n-1} -a_ {n-2} $ is divisible by $ 100 (3 \leq n \leq 1999) $. It is known that $ a_1 = 19$ and $ a_2 = 99$. Find the remainder of $ a_1 ^ 2 + a_2 ^ 2 + \dots + a_ {1999} ^ 2 $ by $8$.
Prove that $1^{1987} + 2^{1987} + ... + n^{1987}$ is divisible by $n+2$.
Find all pairs of integers $(x,y)$ satisfying the following condition:
[i]each of the numbers $x^3 + y$ and $x + y^3$ is divisible by $x^2 + y^2$
[/i]
Tournament of Towns
Let $g(n)$ be the number of all $n$-digit natural numbers each consisting only of digits $0,1,2,3$ (but not nessesarily all of them) such that the sum of no two neighbouring digits equals $2$. Determine whether $g(2010)$ and $g(2011)$ are divisible by $11$.
I.Kozlov
Let $a_1, a_2,..., a_9$ be integers. Prove that if $19$ divides $a_1^9+a_2^9+...+a_9^9$ then $19$ divides the product $a_1a_2...a_9$.
Let $m$ and $n$ be positive integers with $m > n \ge 2$. Set $S =\{1,2,...,m\}$, and set $T = \{a_1,a_2,...,a_n\}$ is a subset of $S$ such that every element of $S$ is not divisible by any pair of distinct elements of $T$. Prove that
$$\frac{1}{a_1}+\frac{1}{a_2}+ ...+ \frac{1}{a_n} < \frac{m+n}{m}$$
Let $(F_n )_{n\ge o}$ be the sequence of Fibonacci numbers: $F_0 = 0$, $F_1 = 1$ and $F_{n+2} = F_{n+1}+F_n$ , for every $n \ge 0$.
Prove that for any prime $p \ge 3$, $p$ divides $F_{2p} - F_p$ .
Let $a_0$ be an arbitrary positive integer. Let $(a_n)$ be infinite sequence of positive integers such that for every positive integer $n$, the term $a_n$ is the smallest positive integer such that $a_0 + a_1 +... + a_n$ is divisible by $n$. Prove that there exist $N$ such that $a_{n+1} = a_n$ for all $n \ge N$
Prove that the number $n^n-n$ is divisible by $24$ for any odd integer $n$.