Find all natural numbers $n$ for which both $n^n + 1$ and $(2n)^{2n} + 1$ are prime numbers.

Find all triples $(x,n,p)$ of positive integers $x$ and $n$ and primes $p$ for which the following holds $x^3 + 3x + 14 = 2 p^n$

Professor Moriarty has designed a “prime-testing trail.” The trail has $2002$ stations, labeled $1,... , 2002$. Each station is colored either red or green, and contains a table which indicates, for each of the digits $0, ..., 9$, another station number. A student is given a positive integer $n$, and then walks along the trail, starting at station $1$. The student reads the first (leftmost) digit of $n,$ and looks this digit up in station $1$’s table to get a new station location. The student then walks to this new station, reads the second digit of $n$ and looks it up in this station’s table to get yet another station location, and so on, until the last (rightmost) digit of $n$ has been read and looked up, sending the student to his or her final station. Here is an example that shows possible values for some of the tables. Suppose that $n = 19$: [img]https://cdn.artofproblemsolving.com/attachments/f/3/db47f6761ca1f350e39d53407a1250c92c4b05.png[/img] Using these tables, station $1$, digit $1$ leads to station $29$m station $29$, digit $9$ leads to station $1429$, and station $1429$ is green. Professor Moriarty claims that for any positive integer $n$, the final station (in the example, $1429$) will be green if and only if $n$ is prime. Is this possible?

Alice and Bob are playing "factoring game." On the paper, $270000(=2^43^35^4)$ is written and each person picks one number from the paper(call it $N$) and erase $N$ and writes integer $X,Y$ such that $N=XY$ and $\text{gcd}(X,Y)\ne1.$ Alice goes first and the person who can no longer make this factoring loses. If two people use optimal strategy, prove that Alice always win.

Consider the prime numbers $n_1< n_2 <...< n_{31}$. Prove that if $30$ divides $n_1^4 + n_2^4+...+n_{31}^4$, then among these numbers one can find three consecutive primes.

Find all pairs $(p,q)$ of positive primes such that the equation $3x^2 - px + q = 0$ has two distinct rational roots.

How many integers $n$ are there such that $n^4 + 2n^3 + 2n^2 + 2n + 1$ is a prime number?

Determine all pairs of integers $(x, y)$ such that $2xy$ is a perfect square and $x^2 + y^2$ is a prime number.

Find some four different natural numbers with the following property: if you add to the product of any two of them the product of the two remaining numbers. you get a prime number.

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

Find all natural numbers $n$, $n < 10^7$, for which: If natural number $m$, $1 < m < n$, is not divisible by $n$, then $m$ is prime.

Given the following list of numbers: $$1990, 1991, 1992, ..., 2002, 2003, 2003, 2003, ..., 2003$$ where the number $2003$ appears $12$ times. Is it possible to write these numbers in some order so that the $100$-digit number that we get is prime?

Determine all three primes $(a, b, c)$ that satisfied the equality $a^2+ab+b^2=c^2+3$.

Does there exist a sequence of $2017$ consecutive integers which contains exactly $17$ primes?

Let $p>3$ be a prime number. The natural numbers $a,b,c, d$ are such that $a+b+c+d$ and $a^3+b^3+c^3+d^3$ are divisible by $p$. Prove that for all odd $n$, $a^n+b^n+c^n+d^n$ is divisible by $p$.

Prove that if $n$ is a natural number such that $1 + 2^n + 4^n$ is prime then $n = 3^k$ for some $k \in N_0$.

The natural numbers $a_1,a_2,...,a_n, n \ge 12$, are smaller than $9n^2$ and pairwise coprime. Show that at least one of these numbers is prime.

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

Find all the pairs of positive integers $(x,p)$ such that p is a prime, $x \leq 2p$ and $x^{p-1}$ is a divisor of $ (p-1)^{x}+1$.

Let $p_1,p_2,p_3,p_4$ be four distinct primes. Prove that there is no polynomial $Q(x) = ax^3 + bx^2 + cx + d$ with integer coefficients such that $|Q(p_1)| =|Q(p_2)| = |Q(p_3)|= |Q(p_4 )| = 3$.

Find all primes $p$, such that there exist positive integers $x$, $y$ which satisfy $$\begin{cases} p + 49 = 2x^2\\ p^2 + 49 = 2y^2\\ \end{cases}$$

Let $C(n)$ be the number of prime divisors of a positive integer n. (For example, $C(10) = 2,C(11) = 1, C(12) = 2$). Consider set S of all pairs of positive integers $(a, b)$ such that $a\ne b$ and $C(a + b) = C(a) + C(b)$. Is set $S$ finite or infinite?

Let $p$ be an odd prime number. a) Show that $p$ divides $n2^n + 1$ for infinitely many positive integers n. b) Find all $n$ satisfy condition above when $p = 3$

Find all pairs of natural numbers $(p, n)$ with $p$ prime such that $p^6+p^5+n^3+n=n^5+n^2$.

Prove that if a triangle has integral side lengths and its circumradius is a prime number then the triangle is right-angled.