We say that the prime numbers $p_1,\dots,p_n$ construct the graph $G$ if we can assign to each vertex of $G$ a natural number whose prime divisors are among $p_1,\dots,p_n$ and there is an edge between two vertices in $G$ if and only if the numbers assigned to the two vertices have a common divisor greater than $1$. What is the minimal $n$ such that there exist prime numbers $p_1,\dots,p_n$ which construct any graph $G$ with $N$ vertices?

Fix a sequence $ a_1,a_2,a_3,... $ of integers satisfying the following condition:for all prime numbers $ p $ and all positive integers $ k $, we have $ a_{pk+1}=pa_k-3a_p+13 $.Determine all possible values of $ a_{2013} $.

Let $p\ge 5$ be a prime number. Prove that there exist positive integers $m$ and $n$ with $m+n\le \frac{p+1}{2}$ for which $p$ divides $2^n\cdot 3^m-1.$

The acute angles of a right triangle are $a^{\circ}$ and $b^{\circ}$, where $a>b$ and both $a$ and $b$ are prime numbers. What is the least possible value of $b$? $\textbf{(A) }2\qquad\textbf{(B) }3\qquad\textbf{(C) }5\qquad\textbf{(D) }7\qquad\textbf{(E) }11$

Let be a finite group $ G $ that has an element $ a\neq 1 $ for which exists a prime number $ p $ such that $ x^{1+p}=a^{-1}xa, $ for all $ x\in G. $ [b]a)[/b] Prove that the order of $ G $ is a power of $ p. $ [b]b)[/b] Show that $ H:=\{x\in G|\text{ord} (x)=p\}\le G $ and $ \text{ord}^2(H)>\text{ord}(G). $

Find all triplets $(x,y,p)$ of positive integers such that $p$ be a prime number and $\frac{xy^3}{x+y}=p$

Determine if there exist prime numbers $ p_{1},p_{2},...,p_{2007}$ such that $ p_{2}|p_{1}^{2}\minus{}1,p_{3}|p_{2}^{2}\minus{}1,...,p_{1}|p_{2007}^{2}\minus{}1$.

When finding the sum $\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\frac{1}{5}+\frac{1}{6}+\frac{1}{7}$, the least common denominator used is $\text{(A)}\ 120 \qquad \text{(B)}\ 210 \qquad \text{(C)}\ 420 \qquad \text{(D)}\ 840 \qquad \text{(E)}\ 5040$

Let $a_n$ be a series of positive integers with $a_1=1$ and for any arbitrary prime number $p$, the set $\{a_1,a_2,\cdots,a_p\}$ is a complete remainder system modulo $p$. Prove that $\lim_{n\rightarrow \infty} \cfrac{a_n}{n}=1$.

Let $p$ be an odd prime number. Ana and Ben are playing a game with alternate moves as follows: in each move, the player which has the turn choose a number, which was not choosen before by any of the player, from the set $\{1,2,...,2p-3,2p-2\}$. This process continues until no number is left. After the end of the process, each player create the number by taking the product of the choosen numbers and then add 1. We say a player wins if the number that did create is divisible by $p$, while the number that did create the opponent it is not divisible by $p$, otherwise we say the game end in a draw. Ana start first move. Does it exist a strategy for any of the player to win the game? [i]Proposed by Dorlir Ahmeti, Kosovo[/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.

Prove that no term of the sequence $10001$, $100010001$, $1000100010001$ , $...$ is prime.

Determine all integers $n$ such that both of the numbers: $$|n^3 - 4n^2 + 3n - 35| \text{ and } |n^2 + 4n + 8|$$ are both prime numbers.

Let $p$ be a prime number. Prove that it is possible to choose a permutation $a_1, a_2,...,a_p$ of $1,2,...,p$ such that the numbers $a_1, a_1a_2, a_1a_2a_3,..., a_1a_2a_3...a_p$ all have different remainder upon division by $p$.

Let $a,b,c\in \mathbb N$ be such that $a,b\neq c$. Prove that there are infinitely many prime numbers $p$ for which there exists $n\in\mathbb N$ that $p|a^n+b^n-c^n$.