Found problems: 364
Prove that if the product $1\cdot 2\cdot ...\cdot n$ ($n> 3$) is not divisible by $n + 1$, then $n + 1$ is prime.
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$?
Prove that if $ a $ is an integer different from $ 1 $ and $ - 1 $, then $ a^4 + 4 $ is not a prime number.
The following sequence of positive integers $a_1, a_2, ..., a_{400}$ satisfies the relationship $a_{n+1} = \tau (a_n) + \tau (n)$ for all $1 \le n \le 399$, where $\tau (k) $ is the number of positive integer divisors that $k$ has. Prove that in the sequence there are no more than $210$ prime numbers.
Let $S_n$ denote the sum of the first $n$ prime numbers. Prove that for any $n$ there exists the square of an integer between $S_n$ and $S_{n+1}$.
For all positive integers $a$ and $b$, we de ne $a @ b = \frac{a - b}{gcd(a, b)}$ .
Show that for every integer $n > 1$, the following holds:
$n$ is a prime power if and only if for all positive integers $m$ such that $m < n$, it holds that $gcd(n, n @m) = 1$.
Let $x$ be an integer of $n$ digits, all equal to $ 1$. Show that if $x$ is prime, then $n$ is also prime.
Let $d = a^{1999} + b^{1999} + c^{1999}$ , where $a, b$ and $c$ are integers such that $a + b + c = 0$.
(a) May it happen that $d = 2$?
(b) May it happen that $d$ is prime?
(V Senderov)
Given natural number $a>1$ and different odd prime numbers $p_1,p_2,...,p_n$ with
$a^{p_1}\equiv 1$ (mod $p_2$), $a^{p_2}\equiv 1$ (mod $p_3$), ..., $a^{p_n}\equiv 1$(mod $p_1$).
Prove that
a) $(a-1)\vdots p_i$ for some $i=1,..,n$
b) Can $(a-1)$ be divisible by $p_i $for exactly one $i$ of $i=1,...,n$?
I. Bliznets
Prime $p$ is called [i]Prime of the Year[/i] if there exists a positive integer $n$ such that $n^2+ 1 \equiv 0$ ($mod p^{2007}$).
Prove that there are infi nite number of [i]Primes of the Year[/i].
If $p$ is a prime positive integer and $x,y$ are positive integers,
find , in terms of $p$, all pairs $(x,y)$ that are solutions of the equation: $p(x-2)=x(y-1)$. (1)
If it is also given that $x+y=21$, find all triplets $(x,y,p)$ that are solutions to equation (1).
Find all prime numbers $ p $ such that $ 4p^2 + 1 $ and $ 6p^2 + 1 $ are also prime numbers.
Determine all integers $n\ge1$ for which the number $n^8+n^6+n^4+4$ is prime.
(Proposed by Gerhard Woeginger, Austria)
Prove that an integer $n > 1$ is a prime number if and only if, for every integer $k$ with $1\le k \le n-1$, the binomial coefficient $n \choose k$ is divisible by $n$.
We consider an integer $n > 1$ with the following property: for every positive divisor $d$ of $n$ we have that $d + 1$ is a divisor of$ n + 1$. Prove that $n$ is a prime number.
A pair of numbers are [i]twin primes[/i] if they differ by two, and both are prime. Prove that, except for the pair $\{3, 5\}$, the sum of any pair of twin primes is a multiple of $ 12$.
The radius $r$ of a circle with center at the origin is an odd integer.
There is a point ($p^m, q^n$) on the circle, with $p,q$ prime numbers and $m,n$ positive integers.
Determine $r$.
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$
Find all polynomials of degree $3$ with integer coeffcients such that $f(2014) = 2015, f(2015) = 2016$ and $f(2013) - f(2016)$ is a prime number.
Find with all integers $n$ when $|n^3 - 4n^2 + 3n - 35|$ and $|n^2 + 4n + 8|$ are prime numbers.
Show that there are no integers $n$ such that $n^4 + 4^n$ is a prime greater than $5$.
Find all integers for which $n$ is $n^4 -3n^2 + 9$ prime
[b]6.[/b] Let $a$ be a positive integer and $p$ a prime divisor of $a^3-3a+1$, with $p \neq 3$. Prove that $p$ is of the form $9k+1$ or $9k-1$, where $k$ is integer.
Prove that there do not exist distinct prime numbers $p$ and $q$ and a positive integer $n$ satisfying the equation $p^{q-1}- q^{p-1}=4n^3$
Determine the natural number $a =\frac{p+q}{r}+\frac{q+r}{p}+\frac{r+p}{q}$ where $p, q$ and $r$ are prime positive numbers.