A positive proper divisor is a positive divisor of a number, excluding itself. For positive integers $n \ge 2$, let $f(n)$ denote the number that is one more than the largest proper divisor of $n$. Determine all positive integers $n$ such that $f(f(n)) = 2$.

Find all functions $f : Z \to Z$ satisfying $\bullet$ $ f(p) > 0$ for all prime numbers $p$, $\bullet$ $p| (f(x) + f(p))^{f(p)}- x$ for all $x \in Z$ and all prime numbers $p$.

Among the positive integers less than $100$, each of whose digits is a prime number, one is selected at random. What is the probablility that the selected number is prime? $\textbf{(A) } \dfrac{8}{99} \qquad\textbf{(B) } \dfrac{2}{5} \qquad\textbf{(C) } \dfrac{9}{20} \qquad\textbf{(D) } \dfrac{1}{2} \qquad\textbf{(E) } \dfrac{9}{16} $

Let $p_1$, $p_2$ be two odd prime numbers and $\alpha $, $n$ be positive integers with $\alpha >1$, $n>1$. Prove that if the equation $\left (\frac{p_2 -1}{2} \right )^{p_1} + \left (\frac{p_2 +1}{2} \right )^{p_1} = \alpha^n$ does not have integer solutions for both $p_1 =p_2$ and $p_1 \neq p_2$.

Positive integer numbers $k$ and $n$ satisfy the inequality $k > n!$. Prove that there exist pairwisely different prime numbers $p_1, p_2, \ldots, p_n$ which are divisors of the numbers $k+1, k+2, \ldots, k+n$ respectively (i.e. $p_i|k+i$).

Determine whether there exists a prime $q$ so that for any prime $p$ the number $$\sqrt[3]{p^2+q}$$ is never an integer.

Let $p$ be a prime number and $k,r$ are positive integers such that $p>r$. If $pk+r$ divides $p^p+1$ then prove that $r$ divides $k$.

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 $.

For how many three-element sets of positive integers $\{a,b,c\}$ is it true that $a \times b \times c = 2310$? $\textbf{(A)}\ 32 \qquad \textbf{(B)}\ 36 \qquad \textbf{(C)}\ 40 \qquad \textbf{(D)}\ 43 \qquad \textbf{(E)}\ 45$

Let $p$ and $q$ be prime numbers such that $p^2+pq+q^2$ is perfect square. Prove that $p^2-pq+q^2$ is prime

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 $.

Show that there exists a set $ A$ of positive integers with the following property: for any infinite set $ S$ of primes, there exist [i]two[/i] positive integers $ m$ in $ A$ and $ n$ not in $ A$, each of which is a product of $ k$ distinct elements of $ S$ for some $ k \geq 2$.

Determine all functions $ f$ defined on the natural numbers that take values among the natural numbers for which \[ (f(n))^p \equiv n\quad {\rm mod}\; f(p) \] for all $ n \in {\bf N}$ and all prime numbers $ p$.

Let $n$ be a given number greater than 2. We consider the set $V_n$ of all the integers of the form $1 + kn$ with $k = 1, 2, \ldots$ A number $m$ from $V_n$ is called indecomposable in $V_n$ if there are not two numbers $p$ and $q$ from $V_n$ so that $m = pq.$ Prove that there exist a number $r \in V_n$ that can be expressed as the product of elements indecomposable in $V_n$ in more than one way. (Expressions which differ only in order of the elements of $V_n$ will be considered the same.)

$ a_1, a_2, \ldots, a_n$ are integers, not all equal. Prove that there exist infinitely many prime numbers $ p$ such that for some $ k$ \[ p\mid a_1^k \plus{} \dots \plus{} a_n^k.\]

Find all prime numbers $p$ such that $(x + y)^{19} - x^{19} - y^{19}$ is a multiple of $p$ for any positive integers $x$, $y$.

Let $ p,q,r$ be 3 prime numbers such that $ 5\leq p <q<r$. Knowing that $ 2p^2\minus{}r^2 \geq 49$ and $ 2q^2\minus{}r^2\leq 193$, find $ p,q,r$.

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]

Let \(p\) a prime number, and \(N\) the number of matrices \(p \times p\) \[\begin{array}{cccc} a_{11} & a_{12} & \ldots & a_{1p}\\ a_{21} & a_{22} & \ldots & a_{2p}\\ \vdots & \vdots & \ddots & \vdots \\ a_{p1} & a_{p2} & \ldots & a_{pp} \end{array}\] such that \(a_{ij} \in \{0,1,2,\ldots,p\} \) and if \(i \leq i^\prime\) and \(j \leq j^\prime\), then \(a_{ij} \leq a_{i^\prime j^\prime}\). Find \(N \pmod{p}\).

Let $p$ be a prime number. Positive integers numbers $a$ and $b$ are such $\frac{p}{a}+\frac{p}{b}=1$ and $a+b$ is divisible by $p$. What values can an expression $\frac{a+b}{p}$ take? [i]Yu.A.Karpenko[/i]

Is there an infinite sequence of prime numbers $p_1$, $p_2$, $\ldots$, $p_n$, $p_{n+1}$, $\ldots$ such that $|p_{n+1}-2p_n|=1$ for each $n \in \mathbb{N}$?

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]

Let $ \left(a_n \right)_{n \in \mathbb{N}}$ defined by $ a_1 \equal{} 1,$ and $ a_{n \plus{} 1} \equal{} a^4_n \minus{} a^3_n \plus{} 2a^2_n \plus{} 1$ for $ n \geq 1.$ Show that there is an infinite number of primes $ p$ such that none of the $ a_n$ is divisible by $ p.$

Assume $\Omega(n),\omega(n)$ be the biggest and smallest prime factors of $n$ respectively . Alireza and Amin decided to play a game. First Alireza chooses $1400$ polynomials with integer coefficients. Now Amin chooses $700$ of them, the set of polynomials of Alireza and Amin are $B,A$ respectively . Amin wins if for all $n$ we have : $$\max_{P \in A}(\Omega(P(n))) \ge \min_{P \in B}(\omega(P(n)))$$ Who has the winning strategy. Proposed by [i]Alireza Haghi[/i]

In the diagram below, fill the $12$ circles with numbers from the following bank so that each number is used once. Two circles connected by a single line must contain relatively prime numbers. Two circles connected by a double line must contain numbers that are not relatively prime. $$\text{Bank: } 20, 21, 22, 23, 24, 25, 27, 28, 30 ,32, 33 ,35$$ [asy] real HRT3 = sqrt(3) / 2; void drawCircle(real x, real y, real r) { path p = circle((x,y), r); draw(p); fill(p, white); } void drawCell(int gx, int gy) { real x = 0.5 * gx; real y = HRT3 * gy; drawCircle(x, y, 0.35); } void drawEdge(int gx1, int gy1, int gx2, int gy2, bool doubled) { real x1 = 0.5 * gx1; real y1 = HRT3 * gy1; real x2 = 0.5 * gx2; real y2 = HRT3 * gy2; if (doubled) { real dx = x2 - x1; real dy = y2 - y1; real ox = -0.035 * dy / sqrt(dx * dx + dy * dy); real oy = 0.035 * dx / sqrt(dx * dx + dy * dy); draw((x1+ox,y1+oy)--(x2+ox,y2+oy)); draw((x1-ox,y1-oy)--(x2-ox,y2-oy)); } else { draw((x1,y1)--(x2,y2)); } } drawEdge(2, 0, 4, 0, true); drawEdge(2, 0, 1, 1, true); drawEdge(2, 0, 3, 1, true); drawEdge(4, 0, 3, 1, false); drawEdge(4, 0, 5, 1, false); drawEdge(1, 1, 0, 2, false); drawEdge(1, 1, 2, 2, false); drawEdge(1, 1, 3, 1, false); drawEdge(3, 1, 2, 2, true); drawEdge(3, 1, 4, 2, true); drawEdge(3, 1, 5, 1, false); drawEdge(5, 1, 4, 2, true); drawEdge(5, 1, 6, 2, false); drawEdge(0, 2, 1, 3, false); drawEdge(0, 2, 2, 2, false); drawEdge(2, 2, 1, 3, false); drawEdge(2, 2, 3, 3, true); drawEdge(2, 2, 4, 2, false); drawEdge(4, 2, 3, 3, false); drawEdge(4, 2, 5, 3, false); drawEdge(4, 2, 6, 2, false); drawEdge(6, 2, 5, 3, true); drawEdge(1, 3, 3, 3, true); drawEdge(3, 3, 5, 3, false); drawCell(2, 0); drawCell(4, 0); drawCell(1, 1); drawCell(3, 1); drawCell(5, 1); drawCell(0, 2); drawCell(2, 2); drawCell(4, 2); drawCell(6, 2); drawCell(1, 3); drawCell(3, 3); drawCell(5, 3); [/asy]