Found problems: 721
Prove that there exists a positive $ c$ such that for every positive integer $ N$ among any $ N$ positive integers not exceeding $ 2N$ there are two numbers whose greatest common divisor is greater than $ cN$.
Write the numbers from $1$ to $16$ in the cells of a of a $4 \times 4$ square so that:
1. Each cell contains exactly one number;
2. Each number is written exactly once;
3. For any two cells that are symmetrical with respect to any of the perpendicular bisectors of sides of the
original $4 \times 4$ square, the sum of numbers in them is a prime number
The figure below shows examples of such pairs of cells, sums of numbers in which have to be prime.
[img]https://i.ibb.co/fqX05dY/Kyiv-MO-2024-Round-1-8-2.png[/img]
[i]Proposed by Mykhailo Shtandenko[/i]
For a positive integer $n$, $a_1, a_2, \cdots a_k$ are all positive integers without repetition that are not greater than $n$ and relatively prime to $n$. If $k>8$, prove the following. $$\sum_{i=1}^k |a_i-\frac{n}{2}|<\frac{n(k-4)}{2}$$
Are there any sequences of positive integers $ 1 \leq a_{1} < a_{2} < a_{3} < \ldots$ such that for each integer $ n$, the set $ \left\{a_{k} \plus{} n\ |\ k \equal{} 1, 2, 3, \ldots\right\}$ contains finitely many prime numbers?
$15.$ Let $n$ be the largest integer that is the product of exactly $3$ distinct prime numbers, $x,y,$ and $10x+y,$ where $x$ and $y$ are digits. What is the sum of digits of $n ?$
Find all pairs of prime numbers $p$ and $q$ such that:
\[
p(p + q) = q^p+ 1.
\]
An infinite sequence $a_1, a_2,\ldots$ of positive integers is such that $a_n \geq 2$ and $a_{n+2}$ divides $a_{n+1} + a_n$ for all $n \geq 1$. Prove that there exists a prime which divides infinitely many terms of the sequence.
a) Prove that there doesn't exist sequence $a_1,a_2,a_3,... \in \mathbb{N}$ such that: $\forall i<j: gcd(a_i+j,a_j+i)=1$
b) Let $p$ be an odd prime number. Prove that there exist sequence $a_1,a_2,a_3,... \in \mathbb{N}$ such that: $\forall i<j: p \not | gcd(a_i+j,a_j+i)$
Using only prime numbers, a set is formed with the following conditions:
Any one-digit prime number can be in the set.
For a prime number with more than one digit to be in the set, the number that results from deleting only the first digit and also the number that results from deleting only the last digit must be in the set.
Write, of the sets that meet these conditions, the one with the greatest number of elements.
Justify why there cannot be one with more elements.
Remember that the number $1$ is not prime.
$p$ is an odd prime number. Find all $\frac{p-1}2$-tuples $\left(x_1,x_2,\dots,x_{\frac{p-1}2}\right)\in \mathbb{Z}_p^{\frac{p-1}2}$ such that
$$\sum_{i = 1}^{\frac{p-1}{2}} x_{i} \equiv \sum_{i = 1}^{\frac{p-1}{2}} x_{i}^{2} \equiv \cdots \equiv \sum_{i = 1}^{\frac{p-1}{2}} x_{i}^{\frac{p - 1}{2}} \pmod p.$$
[i]Proposed by Ali Partofard[/i]
Let $q$ be an odd prime number. Prove that it is impossible for all $(q-1)$ numbers
\[1^2+1+q, 2^2+2+q, \dots, (q-1)^2+(q-1)+q\]
to be products of two primes (not necessarily distinct).
Let $p$ be a prime number, $p\neq 3$ and let $a$ and $b$ be positive integers such that $p \mid a+b$ and $p^2\mid a^3+b^3$. Show that $p^2 \mid a+b$ or $p^3 \mid a^3+b^3$
Given $n \geq 3$ pairwise different prime numbers $p_1, p_2, ....,p_n$. Given, that for any $k \in \{ 1,2,....,n \}$ residue by division of $ \prod_{i \neq k} p_i$ by $p_k$ equals one number $r$. Prove, that $r \leq n-2 $.
Let $p_{1}$, $p_{2}$, ..., $p_{k}$ be different prime numbers. Determine the number of positive integers of the form $p_{1}^{\alpha_{1}}p_{2}^{\alpha_{2}}...p_{k}^{\alpha_{k}}$, $\alpha_{i}$ $\in$ $\mathbb{N}$ for which $\alpha_{1} \alpha_{2}...\alpha_{k}=p_{1}p_{2}...p_{k}$.
A numerical sequence is called lusophone if it satisfies the following three conditions:
i) The first term of the sequence is number $1$.
ii) To obtain the next term of the sequence we can multiply the previous term by a positive prime number ($2,3,5,7,11, ...$) or add $1$.
(iii) The last term of the sequence is the number $2016$.
For example: $1\overset{{\times 11}}{\to}11 \overset{{\times 61}}{\to} 671 \overset{{+1}}{\to}672 \overset{{\times 3}}{\to}2016$
How many Lusophone sequences exist in which (as in the example above) the add $1$ operation was used exactly once and not multiplied twice by the same prime number?
The sum of two prime numbers is $85$. What is the product of these two prime numbers?
$\textbf{(A) }85\qquad\textbf{(B) }91\qquad\textbf{(C) }115\qquad\textbf{(D) }133\qquad \textbf{(E) }166$
Several sets of prime numbers, such as $ \{ 7, 83, 421, 659\}$ use each of the nine nonzero digits exactly once. What is the smallest possible sum such a set of primes could have?
$ \textbf{(A)}\ 193\qquad\textbf{(B)}\ 207\qquad\textbf{(C)}\ 225\qquad\textbf{(D)}\ 252\qquad\textbf{(E)}\ 447$
The sequence $ \{ a_n \} _ { n \ge 0 } $ is defined by $ a_0 = 2 , a_1 = 4 $ and
\[ a_{n+1} = \frac{a_n a_{n-1}}{2} + a_n + a_{n-1} \]
for all positive integers $ n $. Determine all prime numbers $ p $ for which there exists a positive integer $ m $ such that $ p $ divides the number $ a_m - 1 $.
Determine all pairs $(p,q)$ of prime numbers for which $p^2+5pq+4q^2$ is a perfect square.
[b]1.[/b] Let $p_n$ be the $n$th prime number. Prove that
$\sum_{n=2}^{\infty} \frac{1}{np_n-(n-1)p_{n-1}}= \infty$
[b](N.17)[/b]
Given distinct prime numbers $p$ and $q$ and a natural number $n \geq 3$, find all $a \in \mathbb{Z}$ such that the polynomial $f(x) = x^n + ax^{n-1} + pq$ can be factored into 2 integral polynomials of degree at least 1.
Three prime numbers $p,q,r$ and a positive integer $n$ are given such that the numbers
\[ \frac{p+n}{qr}, \frac{q+n}{rp}, \frac{r+n}{pq} \]
are integers. Prove that $p=q=r $.
[i]Nazar Agakhanov[/i]
[b]a)[/b] Find all prime numbers $p, q, r$ satisfying $3 \nmid p+q+r$ and $p+q+r$ and $pq+qr+rp+3$ are both perfect squares.
[b]b)[/b] Do there exist prime numbers $p, q, r$ such that $3 \mid p+q+r$ and $p+q+r$ and $pq+qr+rp+3$ are both perfect squares?
There are two prime numbers $p$ so that $5p$ can be expressed in the form $\left\lfloor \dfrac{n^2}{5}\right\rfloor$ for some positive integer $n.$ What is the sum of these two prime numbers?
The prime numbers $a,b$ and $c$ are such that $a+b^2=4c^2$. Determine the sum of all possible values of $a+b+c$.