Found problems: 1048
$\mathbb{N}$ is the set of positive integers. Determine all functions $f:\mathbb{N}\to\mathbb{N}$ such that for every pair $(m,n)\in\mathbb{N}^2$ we have that:
\[f(m)+f(n) \ | \ m+n .\]
In Wonderland, the government of each country consists of exactly $a$ men and $b$ women, where $a$ and $b$ are fixed natural numbers and $b > 1$. For improving of relationships between countries, all possible working groups consisting of exactly one government member from each country, at least $n$ among whom are women, are formed (where $n$ is a fixed non-negative integer). The same person may belong to many working groups. Find all possibilities how many countries can be in Wonderland, given that the number of all working groups is prime.
Prove that if for a positive integer $n$ is $5^n + 3^n + 1$ is prime number, then $n$ is divided by $12$.
Let $m, n$ be odd prime numbers.
Find all pairs of integers numbers $a, b$ for which the system of equations:
$x^m+y^m+z^m=a$,
$x^n+y^n+z^n=b$
has many solutions in integers $x, y, z$.
A positive integer $ n$ is called $ good$ if it can be uniquely written simultaneously as $ a_1\plus{}a_2\plus{}...\plus{}a_k$ and as $ a_1 a_2...a_k$, where $ a_i$ are positive integers and $ k \ge 2$. (For example, $ 10$ is good because $ 10\equal{}5\plus{}2\plus{}1\plus{}1\plus{}1\equal{}5 \cdot 2 \cdot 1 \cdot 1 \cdot 1$ is a unique expression of this form). Find, in terms of prime numbers, all good natural numbers.
Find all prime numbers $p$ and all positive integers $n$, such that
$n^8 - n^2 = p^5 + p^2$
Find all prime numbers $p_1,…,p_n$ (not necessarily different) such that :
$$ \prod_{i=1}^n p_i=10 \sum_{i=1}^n p_i$$
Determine the least possible value of $f(1998),$ where $f:\Bbb{N}\to \Bbb{N}$ is a function such that for all $m,n\in {\Bbb N}$,
\[f\left( n^{2}f(m)\right) =m\left( f(n)\right) ^{2}. \]
Consider the infinite, strictly increasing sequence of positive integer $(a_n)$ such that
i. All terms of sequences are pairwise coprime.
ii. The sum $\frac{1}{\sqrt{a_1a_2}} +\frac{1}{\sqrt{a_2a_3}}+ \frac{1}{\sqrt{a_3a_4}} + ..$ is unbounded.
Prove that this sequence contains infinitely many primes.
If $p$ and $q$ are natural numbers so that \[ \frac{p}{q}=1-\frac{1}{2}+\frac{1}{3}-\frac{1}{4}+ \ldots -\frac{1}{1318}+\frac{1}{1319}, \] prove that $p$ is divisible with $1979$.
Let $p$ be a prime number and the decimal notation of $\frac{1}{p}$ is periodical with a length of the period $4k$, $\frac{1}{p}=0,a_1 a_2…a_{4k} a_1 a_2…a_{4k}…$ .Prove that
$a_1+a_3+...+a_{4k-1}=a_2+a_4+...+a_{4k}$.
Let $p$ be an odd prime. Determine the number of nonempty subsets from $\{1, 2, \dots, p - 1\}$ for which the sum of its elements is divisible by $p$.
Let $p$ be a prime and suppose $2^{2p} \equiv 1 (\text{mod}$ $ 2p+1)$ is prime. Prove that $2p+1$ is prime$^{1}$
[size=75]$^{1}$This is a special case of Pocklington's theorem. A proof of this special case is required.[/size]
Show that an integer $p > 3$ is a prime if and only if for every two nonzero integers $a,b$ exactly one of the numbers
$N_1 = a+b-6ab+\frac{p-1}{6}$ , $N_2 = a+b+6ab+\frac{p-1}{6}$ is a nonzero integer.
Positive integers $a_0<a_1<\dots<a_n$, are to be chosen so that $a_j-a_i$ is not a prime for any $i,j$ with $0 \le i <j \le n$. For each $n \ge 1$, determine the smallest possible value of $a_n$.
Take any 26 distinct numbers from {1, 2, ... , 100}. Show that there must be a non-empty subset of the $ 26$ whose product is a square.
[hide]
I think that the upper limit for such subset is 37.[/hide]
Suppose $a_1,a_2, \dots$ is an infinite strictly increasing sequence of positive integers and $p_1, p_2, \dots$ is a sequence of distinct primes such that $p_n \mid a_n$ for all $n \ge 1$. It turned out that $a_n-a_k=p_n-p_k$ for all $n,k \ge 1$. Prove that the sequence $(a_n)_n$ consists only of prime numbers.
Two positive integers $n,m\ge 2$ are called [i]allies[/i] if when written as a product of primes (not necessarily different): $n=p_1p_2...p_s$ and $m=q_1q_2...q_t$, turns out that: $$p_1 + p_2 + ... + p_s = q_1 + q_2 + ... + q_t$$
(a) Show that the biggest ally of any positive integer has to have only $2$ and $3$ in its prime factorization.
(b) Find the biggest number which is allied of $2021$ .
Prove that $2005^2$ can be written in at least $4$ ways as the sum of 2 perfect (non-zero) squares.
Starting from 37, adding 5 before each previous term, forms the following sequence:
\[37,537,5537,55537,555537,...\]
How many prime numbers are there in this sequence?
Let $n\ge2$ be an integer. Prove that if $k^2+k+n$ is prime for all integers $k$ such that $0\le k\le\sqrt{n\over3}$, then $k^2+k+n$ is prime for all integers $k$ such that $0\le k\le n-2$.
The sequence $(a_n)_{n\in\mathbb{N}}$ is defined by $a_1=3$ and $$a_n=a_1a_2\cdots a_{n-1}-1$$ Show that there exist infinitely many prime number that divide at least one number in this sequences
(a) Let $k$ be an natural number so that the equation $ab + (a + 1) (b + 1) = 2^k$ does not have a positive integer solution $(a, b)$. Show that $k + 1$ is a prime number.
(b) Show that there are natural numbers $k$ so that $k + 1$ is prime numbers and equation $ab + (a + 1) (b + 1) = 2^k$ has a positive integer solution $(a, b)$.
Find all prime numbers $a,b,c$ and positive integers $k$ satisfying the equation \[a^2+b^2+16c^2 = 9k^2 + 1.\]
Proposed by Moldova
A positive integer is called [i]superprime[/i] if the difference between any two of its consecutive positive divisors is a prime number. Determine all superprime integers.
[i]Authored by Nikola Velov[/i]