This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 387

Prove that for every positive integer $n$, the number $$A_n = 5^n + 2 \cdot 3^{n-1} + 1$$ is a multiple of $8$.
Determine all triples $(x, y, z)$ of positive integers satisfying $x | (y + 1)$, $y | (z + 1)$ and $z | (x + 1)$. (Walther Janous)
Find the largest integer that divides $p^4 - 1$ for all primes $p > 4$
Find the smallest multiple of $81$ that only contains the digit $1$. How many $ 1$’s does it contain?
Show that the number $122^n - 102^n - 21^n$ is always one less than a multiple of $2020$, for any positive integer $n$.
Consider the sequence $a_1 = 3$ and $a_{n + 1} =\frac{3a_n^2+1}{2}-a_n$ for $n = 1 ,2 ,...$. Prove that if $n$ is a power of $3$ then $n$ divides $a_n$ .
Determine which of the prime numbers $2,3,5,7,11,13,109,151,491$ divide $z =1963^{1965} -1963$.
Find all natural numbers $n$ for which $7^n -1$ is divisible by $6^n -1$
The numbers $1, 2, 3, . . . , 624$ are paired in such a way that the sum of the two numbers in each pair is $625$. For example $1$ and $624$ form a pair, and $30$ and $595$ form a pair. In how many of the $312$ pairs does the smaller number evenly divide the larger?
Prove that if $k$ is an even positive integer then it is possible to write the integers from $1$ to $k-1$ in such an order that the sum of no set of successive numbers is divisible by $k$ .
Let $a,b,c,d$ be integers. Prove that $ 12$ divides $ (a-b) (a-c) (a-d) (b- c) (b-d) (c-d)$.
Given integers $a$ and $b$ such that $a^2+b^2$ is divisible by $11$. Prove that $a$ and $b$ are both divisible by $11$.
The sequence $x_1, x_2, x_3, . . .$ is defined by $x_1 = 2022$ and $x_{n+1}= 7x_n + 5$ for all positive integers $n$. Determine the maximum positive integer $m$ such that $$\frac{x_n(x_n - 1)(x_n - 2) . . . (x_n - m + 1)}{m!}$$ is never a multiple of $7$ for any positive integer $n$.
a) Find all integers that can divide both the numerator and denominator of the ratio $\frac{5m + 6}{8m + 7}$ for an integer $m$. b) Let $a, b, c, d, m$ be integers. Prove that if the numerator and denominator of the ratio $\frac{am + b}{cm+ d}$ are both divisible by $k$, then so is $ad - bc$.
Let $k$ and $n$ be integers with $0 < k < n^2/4$ such that k has no prime divisor greater than $n$. Prove that $k$ divides $n!$.
A number $N_k$ is defined as [i]periodic[/i] if it is composed in number base $N$ of a repeated $k$ times . Prove that $7$ divides to infinite periodic numbers of the set $N_1, N_2, N_3,...$
Let $S$ be the sum of all products $ab$ where $a$ and $b$ are distinct elements of the set $\{1,2,...,46\}$. Prove that $47$ divides $S$.
Let $x, y, z$ be positive integers and $p$ a prime such that $x <y <z <p$. Also $x^3, y^3, z^3$ leave the same remainder when divided by $p$. Prove that $x + y + z$ divides $x^2 + y^2 + z^2$.
Prove that there are infinitely many natural numbers $ n $ such that $ 2 ^ n + 3 ^ n $ is divisible by $ n $.
If $a,b,c$ are positive integers such that $b | a^3, c | b^3$ and $a | c^3$ , prove that $abc | (a+b+c)^{13}$
Prove that $S_1 = (n + 1)^2 + (n + 2)^2 +...+ (n + 5)^2$ is divisible by $5$ for every $n$. Prove that for no $n$: $\sum_{\ell=1}^5 (n+\ell)^2$ is a perfect square. Let $S_2=(n + 6)^2 + (n + 7)^2 + ... + (n + 10)^2$. Prove that $S_1 \cdot S_2$ is divisible by $150$.
Let $n$ be a natural number and $p, q$ be prime numbers such that the following statements hold: $$pq | n^p + 2$$ $$n + 2 | n^p + q^p.$$ Show that there is a natural number $m$ such that $q|4^mn + 2$ holds.
The least common multiple of positive integers $a, b, c$ and $d$ is equal to $a + b + c + d$. Prove that $abcd$ is divisible by at least one of $3$ and $5$. ( V Senderov)
Six dice are strung on a rigid wire so that the wire passes through two opposite faces of each die. Each die can be rotated independently of the others. Prove that it is always possible to rotate the dice and then place the wire horizontally on a table so that the six-digit number formed by their top faces is divisible by $7$. (The faces of a die are numbered from $1$ to $6$, the sum of the numbers on opposite faces is always equal to $7$.) (G Galperin)
What digits should be placed instead of zeros in the third and fifth places in the number $3000003$ to obtain a number divisible by $13$?