Decide whether there are infinitely many primes $p$ having a multiple in the form $n^2 + n + 1$ for some natural number $n$

Let the sequence ($a_n$) be defined by $a_n = n^6 +5n^4 -12n^2 -36, n \ge 2$. (a) Prove that any prime number divides some term in this sequence. (b) Prove that there is a positive integer not dividing any term in the sequence. (c) Determine the least $n \ge 2$ for which $1989 | a_n$.

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.

There are 168 primes below 1000. Then sum of all primes below 1000 is [list=1] [*] 11555 [*] 76127 [*] 57298 [*] 81722 [/list]

Find all natural numbers $N$ (in decimal system) with the following properties: (i) $N =\overline{aabb}$, where $\overline{aab}$ and $\overline{abb}$ are primes, (ii) $N = P_1P_2P_3$, where $P_k (k = 1,2,3)$ is a prime consisting of $k$ (decimal) digits.

Let $n = p_1p_2... p_{2017}$ be the positive integer where $p_1, p_2, ..., p_{2017}$ are $2017$ distinct odd primes. A triangle is called [i]nice [/i] if it is a right triangle with integer side lengths and the inradius is $n$. Find the number of nice triangles (two triangles are consider different if their tuples of length of sides are different)

Let $a, d$ be integers such that $a,a + d, a+ 2d$ are all prime numbers larger than $3$. Prove that $d$ is a multiple of $6$.

Determine with proof all triples $(a, b, c)$ of positive integers satisfying $\frac{1}{a}+ \frac{2}{b} +\frac{3}{c} = 1$, where $a$ is a prime number and $a \le b \le c$.

Let $n$ be a positive integer. Prove that for every odd prime $p$ dividing $n^2 + n + 2$, there exist integers $a, b$ such that $p = a^2 + 7b^2$.

Prove that for each prime number distinct from $2$ and $5$ there exist infinitely many multiples of $p$ of the form $1111...1$.

We say that a positive integer is [i]decomposed [/i] if it is prime and also If a line is drawn separating it into two numbers, those two numbers are never composite. For example 1997 is [i]decomposed [/i] since it is prime, it is divided into: $1$, $997$; $19$, $97$; $199$, $7$ and none of those numbers are compound. How many [i]decomposed [/i] numbers are there between $2000$ and $3000$?

Determine all the pairs $ (p , n )$ of a prime number $ p$ and a positive integer $ n$ for which $ \frac{ n^p + 1 }{p^n + 1} $ is an integer.

$p$ is a prime and $m$ is a non-negative integer $< p-1$. Show that $ \sum_{j=1}^p j^m$ is divisible by $p$.

Let $a > 1$ be a positive integer. Prove that for some nonnegative integer $n$, the number $2^{2^n}+a$ is not prime. [i]Proposed by Jack Gurev[/i]

Prove that for any prime number $p$ there are infinitely many fours $(x, y, z, t)$ pairwise distinct natural numbers such that the number $(x^2+p t^2)(y^2+p t^2)(z^2+p t^2)$ is a perfect square.

Determine the smallest prime that does not divide any five-digit number whose digits are in a strictly increasing order.

Suppose $S = \{a_1, a_2,..., a_{15}\}$ is a set of $1 5$ distinct positive integers chosen from $2 , 3, ... , 2012$ such that every two of them are coprime. Prove that $S$ contains a prime number. (Note: Two positive integers $m, n$ are coprime if their only common factor is 1)

A natural number $k$ is such that $k^2 < 2014 < (k +1)^2$. What is the largest prime factor of $k$?

Find all positive integers $n>2$ such that $$ n! \mid \prod_{ p<q\le n, p,q \, \text{primes}} (p+q)$$

We write $\{a,b,c\}$ for the set of three different positive integers $a, b$, and $c$. By choosing some or all of the numbers a, b and c, we can form seven nonempty subsets of $\{a,b,c\}$. We can then calculate the sum of the elements of each subset. For example, for the set $\{4,7,42\}$ we will find sums of $4, 7, 42,11, 46, 49$, and $53$ for its seven subsets. Since $7, 11$, and $53$ are prime, the set $\{4,7,42\}$ has exactly three subsets whose sums are prime. (Recall that prime numbers are numbers with exactly two different factors, $1$ and themselves. In particular, the number $1$ is not prime.) What is the largest possible number of subsets with prime sums that a set of three different positive integers can have? Give an example of a set $\{a,b,c\}$ that has that number of subsets with prime sums, and explain why no other three-element set could have more.

Let $n\geq3$ be an integer. We say that an arrangement of the numbers $1$, $2$, $\dots$, $n^2$ in a $n \times n$ table is [i]row-valid[/i] if the numbers in each row can be permuted to form an arithmetic progression, and [i]column-valid[/i] if the numbers in each column can be permuted to form an arithmetic progression. For what values of $n$ is it possible to transform any row-valid arrangement into a column-valid arrangement by permuting the numbers in each row?

Are there prime $p$ and $q$ larger than $3$, such that $p^2-1$ is divisible by $q$ and $q^2-1$ divided by $p$?

Given $N = 2^ap_1p_2...p_m$, $m \ge 1$, $a \in N$ with $p_1, p_2,..., p_m$ are different primes. It is known that $\sigma (N) = 3N $ where $\sigma (N)$ is the sum of all positive integers which are factors of $N$. Show that there exists a prime number $p$ such that $2^p- 1$ is also a prime, and $2^p - 1|N$.

Find the smallest prime $q$ such that $$q = a_1^2 + b_1^2 = a_2^2 + 2b_2^2 = a_3^2 + 3b_3^2 = ... = a_{10}^ 2 + 10b_{10}^2$$ where $a_i, b_i(i = 1, 2, ...,10)$ are positive integers

Prove that for an arbitrary prime $p \ge 3$ the number of positive integers $n$, for which $p | n! +1$ does not exceed $cp^{2/3}$, where c is a constant that does not depend on $p$.