Found problems: 364
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$.
Given a prime $p \geq 5$ , show that there exist at least two distinct primes $q$ and $r$ in the range $2, 3, \ldots p-2$ such that $q^{p-1} \not\equiv 1 \pmod{p^2}$ and $r^{p-1} \not\equiv 1 \pmod{p^2}$.
Determine all positive integers $a$ and $b$ for which $a^4 + 4b^4$ be a prime number.
An integer $n > 1$ has the following property: for every (positive) divisor $d$ of $n, d + 1$ is a divisor of $n + 1$.
Prove that $n$ is prime.
Let $a, b, c$ be non zero integers,$ a\ne c$ such that $$\frac{a}{c}=\frac{a^2+b^2}{c^2+b^2}$$
Prove that $a^2 +b^2 +c^2$ cannot be a prime number.
Let $p$ be a prime number. Prove that there exists $n \in Z$ such that $p | n^2 -n+3$ if and only if there exists $m \in Z$ such that $p | m^2 -m+25$.
Prove that the number
$$2^{2^k-1}-2^k-1$$is composite (not prime) for all positive integers $k>2$.
Given a positive odd integer $n$, show that the arithmetic mean of fractional parts $\{\frac{k^{2n}}{p}\}, k=1,..., \frac{p-1}{2}$ is the same for infinitely many primes $p$ .
Find the smallest positive integer $n \geq 10$ such that $n + 6$ is a prime and $9n + 7$ is a perfect square.
Prove that for any positive integers $x, y, z$ with $xy-z^2 = 1$ one can find non-negative integers $a, b, c, d$ such that $x = a^2 + b^2, y = c^2 + d^2, z = ac + bd$.
Set $z = (2q)!$ to deduce that for any prime number $p = 4q + 1$, $p$ can be represented as the sum of squares of two integers.
Determine all pairs of prime numbers $(p, q)$ which satisfy the equation
\[
p^3+q^3+1=p^2q^2
\]
Given $m,n \in N$ such that $M>n^{n-1}$ and the numbers $m+1, m+2, ..., m+n$ are composite.
Prove that exist distinct primes $p_1,p_2,...,p_n$ such that $M+k$ is divisible by $p_k$ for any $k=1,2,...,n$.
Tuymaada Olympiad 2004, C.A.Grimm. USA
Let us define $f$ and $g$ by $f(x) = x^5 +5x^4 +5x^3 +5x^2 +1$, $g(x) = x^5 +5x^4 +3x^3 -5x^2 -1$.
Determine all prime numbers $p$ such that, for at least one integer $x, 0 \le x < p-1$, both $f(x)$ and $g(x)$ are divisible by $p$. For each such $p$, find all $x$ with this property.
Find all prime numbers of the form $10101...01$.
Prove that there are no $1999$ primes in an arithmetic progression that are all less than $12345$.
Find all triples $(p, x, y)$ consisting of a prime number $p$ and two positive integers $x$ and $y$ such that $x^{p -1} + y$ and $x + y^ {p -1}$ are both powers of $p$.
[i]Proposed by Belgium[/i]
Decide whether there are infinitely many primes $p$ having a multiple in the form $n^2 + n + 1$ for some natural number $n$
For arbitrary positive integers $a, b$, denote $a @ b =\frac{a-b}{gcd(a,b)}$
Let $n$ be a positive integer. Prove that the following conditions are equivalent:
(i) $gcd(n, n @ m) = 1$ for every positive integer $m < n$,
(ii) $n = p^k$ where $p$ is a prime number and $k$ is a non-negative integer.
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?
Find all pairs $(p,q)$ of prime numbers such that
$$ p(p^2 - p - 1) = q(2q + 3) .$$
Let $P (n)$ and $Q (n)$ be two polynomials (not constant) whose coefficients are integers not negative. For each positive integer $n$, define $x_n = 2016^{P (n)} + Q (n)$. Prove that there exist infinite primes $p$ for which there is a positive integer $m$, squarefree, such that $p | x_m$.
Clarification: A positive integer is squarefree if it is not divisible by the square of any 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$.
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$.
Find all primes $p$ for which the quotient \[ \dfrac{2^{p-1} - 1 }{p} \] is a square.
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$.