Found problems: 1048
Is it possible to place 100 consecutive numbers around a circle in some order such that the product of each pair of adjacent numbers is always a perfect square? (Recall that a number is a perfect square if it is the square of an integer.)
Prove that if a prime is the sum of four perfect squares then the product of two of these is equal to the product of the other two.
[i]Gherghe Stoica[/i]
Let $n$ be a natural number, with the prime factorisation
\[ n = p_1^{e_1} p_2^{e_2} \cdots p_r^{e_r} \] where $p_1, \ldots, p_r$ are distinct primes, and $e_i$ is a natural number. Define
\[ rad(n) = p_1p_2 \cdots p_r \] to be the product of all distinct prime factors of $n$. Determine all polynomials $P(x)$ with rational coefficients such that there exists infinitely many naturals $n$ satisfying $P(n) = rad(n)$.
Show that there exists a set $ A$ of positive integers with the following property: for any infinite set $ S$ of primes, there exist [i]two[/i] positive integers $ m$ in $ A$ and $ n$ not in $ A$, each of which is a product of $ k$ distinct elements of $ S$ for some $ k \geq 2$.
Let $p$ be a prime number for which $\frac{p-1}{2}$ is also prime, and let $a,b,c$ be integers not divisible by $p$. Prove that there are at most $1+\sqrt {2p}$ positive integers $n$ such that $n<p$ and $p$ divides $a^n+b^n+c^n$.
Determine all prime numbers $p$ such that $p^2 - 6$ and $p^2 + 6$ are both prime numbers.
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$.
Prove that for any integer $a > 1$ there is a prime $p$ for which $1+a+a^2+...+ a^{p-1}$ is composite.
Find all distinct prime numbers $p,q,r,s$ such that $1-\frac{1}{p} - \frac{1}{q} -\frac{1}{r} - \frac{1}{s} =\frac{1}{pqrs}$
Let $p_1,p_2,\ldots,p_n$ be distinct primes greater than $3$. Show that $2^{p_1p_2\cdots p_n}+1$ has at least $4^n$ divisors.
Let $n\ge 2$ be a positive integer. For any integer $a$, let $P_a(x)$ denote the polynomial $x^n+ax$. Let $p$ be a prime number and define the set $S_a$ as the set of residues mod $p$ that $P_a(x)$ attains. That is, $$S_a=\{b\mid 0\le b\le p-1,\text{ and there is }c\text{ such that }P_a(c)\equiv b \pmod{p}\}.$$Show that the expression $\frac{1}{p-1}\sum\limits_{a=1}^{p-1}|S_a|$ is an integer.
[i]Proposed by fattypiggy123[/i]
Find all prime numbers $p$ such that there exists a unique $a \in \mathbb{Z}_p$ for which $a^3 - 3a + 1 = 0.$
A twin prime pair is a pair of primes $(p,q)$ such that $q = p + 2$. The Twin Prime Conjecture states that there are infinitely many twin prime pairs. What is the arithmetic mean of the two primes in the smallest twin prime pair? (1 is not a prime.)
$\textbf{(A) }4$
Let $p$ be a prime number and let $A$ be a set of positive integers that satisfies the following conditions:
(i) the set of prime divisors of the elements in $A$ consists of $p-1$ elements;
(ii) for any nonempty subset of $A$, the product of its elements is not a perfect $p$-th power.
What is the largest possible number of elements in $A$ ?
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.
Let $ p$ be an odd prime number. How many $ p$-element subsets $ A$ of $ \{1,2,\dots,2p\}$ are there, the sum of whose elements is divisible by $ p$?
Prove that for all $a, b$ and $x_0$ positive integers, in the sequence $x_1, x_2, x_3, \cdots$ defined by
$$x_{n+1}=ax_n+b, n\geq 0$$
Exist an $x_i$ that is not prime for some $i\geq 1$
Check if there exists positive integers $ a, b$ and prime number $p$ such that $a^3-b^3=4p^2$
Let define a function $f: \mathbb{N} \rightarrow \mathbb{Z}$ such that :
$i)$$f(p)=1$ for all prime numbers $p$.
$ii)$$f(xy)=xf(y)+yf(x)$ for all positive integers $x,y$
find the smallest $n \geq 2016$ such that $f(n)=n$
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 a prime. How many different (infinite) sequences $\left(a_k\right)_{k\ge0}$ exist such that for every positive integer $n$ \[\frac{a_0}{a_1}+\frac{a_0}{a_2}+\cdots+\frac{a_0}{a_n}+\frac{p}{a_{n+1}}=1?\]
Show that if $15$ numbers lie between $2$ and $1992$ and each pair is coprime, then at least one is prime.
Two different prime numbers between $ 4$ and $ 18$ are chosen. When their sum is subtracted from their product, which of the following numbers could be obtained?
$ \textbf{(A)}\ 21 \qquad \textbf{(B)}\ 60\qquad \textbf{(C)}\ 119 \qquad \textbf{(D)}\ 180\qquad \textbf{(E)}\ 231$
An ordered triple $(p, q, r)$ of prime numbers is called [i]parcera[/i] if $p$ divides $q^2-4$, $q$ divides $r^2-4$ and $r$ divides $p^2-4$. Find all parcera triples.
Prove that there is an integer $n>10^{2018}$ such that the sum of all primes less than $n$ is relatively prime to $n$.
[i](R. Salimov)[/i]