Found problems: 721
Let $S$ be the set of all ordered triples $(p,q,r)$ of prime numbers for which at least one rational number $x$ satisfies $px^2+qx+r=0.$ Which primes appear in seven or more elements of $S?$
With $\sigma (n)$ we denote the sum of natural divisors of the natural number $n$. Prove that, if $n$ is the product of different prime numbers of the form $2^k-1$ for $k \in \mathbb{N}$($Mersenne's$ prime numbers) , than $\sigma (n)=2^m$, for some $m \in \mathbb{N}$. Is the inverse statement true?
Find all integers for which $n$ is $n^4 -3n^2 + 9$ prime
Mable and Nora play a game according to the following steps in order:
1. Mable writes down any 2015 distinct prime numbers in ascending order in a row. The product of these primes is Marble's score.
2. Nora writes down a positive integer
3. Mable draws a vertical line between two adjacent primes she has written in step 1, and compute the product of the prime(s) on the left of the vertical line
4. Nora must add the product obtained by Marble in step 3 to the number she has written in step 2, and the sum becomes Nora's score.
If Marble and Nora's scores have a common factor greater than 1, Marble wins, otherwise Nora wins.
Who has a winning strategy?
Given a prime $p>3$ and an odd integer $n>0$, show that the equation $$xyz=p^n(x+y+z)$$ has at least $3(n+1)$ different solutions up to symmetry. (That is, if $(x',y',z')$ is a solution and $(x'',y'',z'')$ is a permutation of the previous, they are considered to be the same solution.)
Given a prime number $p\ge 3,$ and an integer $d \ge 1$. Prove that there exists an integer $n\ge 1,$ such that $\gcd(n,d) = 1,$ and the product \[P=\prod\limits_{1 \le i < j < p} {({i^{n + j}} - {j^{n + i}})} \text{ is not divisible by } p^n.\]
An integer $a\ge1$ is called [i]Aegean[/i], if none of the numbers $a^{n+2}+3a^n+1$ with $n\ge1$ is prime.
Prove that there are at least 500 Aegean integers in the set $\{1,2,\ldots,2018\}$.
(Proposed by Gerhard Woeginger, Austria)
The sequence $ < x_n >$ is defined through:
$ x_{n \plus{} 1} \equal{} \left(\frac {n}{2004} \plus{} \frac {1}{n}\right)x_n^2 \minus{} \frac {n^3}{2004} \plus{} 1$ for $ n > 0$
Let $ x_1$ be a non-negative integer smaller than $ 204$ so that all members of the sequence are non-negative integers.
Show that there exist infinitely many prime numbers in this sequence.
Find all triples of positive integers $(a,b,c)$ such that:
$a^2bc-2ab^2c-2abc^2+b^3c+bc^3+2b^2c^2=11$
Find all pairs of prime numbers $(p, q)$ for which the numbers $p+q$ and $p+4q$ are simultaneously perfect squares.
[b](i)[/b] Show that there cannot exists three peime numbers, each greater than $3$, which are in arithmetic progression with a common difference less than $5$.
[b](ii)[/b] Let $k > 3$ be an integer. Show that it is not possible for $k$ prime numbers, each greater than $k$, to be in an arithmetic progression with a common difference less than or equal to $k+1$.
Determine the smallest positive integer $m$ with the property that $m^3-3m^2+2m$ is divisible by both $79$ and $83$.
Find all natural numbers $a$, $b$, $c$ and prime numbers $p$ and $q$, such that:
$\blacksquare$ $4\nmid c$
$\blacksquare$ $p\not\equiv 11\pmod{16}$
$\blacksquare$ $p^aq^b-1=(p+4)^c$
Determine the greatest common divisor of the numbers $p^6-7p^2+6$ where $p$ runs through the prime numbers $p \ge 11$.
Let $f(x) = x^{1998} - x^{199}+x^{19}+ 1$. Prove that there is an infinite set of prime numbers, each dividing at least one of the integers $f(1), f(2), f(3), f(4), ...$
Let $p{}$ be a prime number and $x_1,x_2,\ldots,x_p$ be integers for which $x_1^n+x_2^n+\cdots+x_p^n$ is divisible by $p{}$ for any positive integer $n{}$. Prove that $x_1-x_2$ is divisible by $p{}.$
Let $a$ be a fixed positive integer and $(e_n)$ the sequence, which is defined by $e_0=1$ and
$$ e_n=a + \prod_{k=0}^{n-1} e_k$$
for $n \geq 1$.
Prove that
(a) There exist infinitely many prime numbers that divide one element of the sequence.
(b) There exists one prime number that does not divide an element of the sequence.
(Theresia Eisenkölbl)
Let $n$ be a given number greater than 2. We consider the set $V_n$ of all the integers of the form $1 + kn$ with $k = 1, 2, \ldots$ A number $m$ from $V_n$ is called indecomposable in $V_n$ if there are not two numbers $p$ and $q$ from $V_n$ so that $m = pq.$ Prove that there exist a number $r \in V_n$ that can be expressed as the product of elements indecomposable in $V_n$ in more than one way. (Expressions which differ only in order of the elements of $V_n$ will be considered the same.)
A prime number$ q $is called[b][i] 'Kowai' [/i][/b]number if $ q = p^2 + 10$ where $q$, $p$, $p^2-2$, $p^2-8$, $p^3+6$ are prime numbers. WE know that, at least one [b][i]'Kowai'[/i][/b] number can be found. Find the summation of all [b][i]'Kowai'[/i][/b] numbers.
Is it possible to choose five different positive integers so that the sum of any three of them is a prime number?
Let $n$ be a positive integer. If $4^n + 2^n + 1$ is a prime, prove that $n$ is a power of three.
Let $Q$ be a set of prime numbers, not necessarily finite. For a positive integer $n$ consider its prime factorization: define $p(n)$ to be the sum of all the exponents and $q(n)$ to be the sum of the exponents corresponding only to primes in $Q$. A positive integer $n$ is called [i]special[/i] if $p(n)+p(n+1)$ and $q(n)+q(n+1)$ are both even integers. Prove that there is a constant $c>0$ independent of the set $Q$ such that for any positive integer $N>100$, the number of special integers in $[1,N]$ is at least $cN$.
(For example, if $Q=\{3,7\}$, then $p(42)=3$, $q(42)=2$, $p(63)=3$, $q(63)=3$, $p(2022)=3$, $q(2022)=1$.)
Let $p{}$ be an odd prime number. Determine whether there exists a permutation $a_1,\ldots,a_p$ of $1,\ldots,p$ satisfying \[(i-j)a_k+(j-k)a_i+(k-i)a_j\neq 0,\] for all pairwise distinct $i,j,k.$
Define $f: \mathbb{N} \rightarrow \mathbb{N}$ by $$f(n) = \sum \frac{(1+\sum_{i=1}^{n} t_i)!}{(1+t_1) \cdot \prod_{i=1}^{n} (t_i!) }$$
where the sum runs through all $n$-tuples such that $\sum_{j=1}^{n}j \cdot t_j=n$ and $t_j \ge 0$ for all $1 \le j \le n$.
Given a prime $p$ greater than $3$, prove that $$\sum_{1 \le i < j <k \le p-1 } \frac{f(i)}{i \cdot j \cdot k} \equiv \sum_{1 \le i < j <k \le p-1 } \frac{2^i}{i \cdot j \cdot k} \pmod{p}.$$
A sequence $x_1, x_2, ..., x_n, ...$ consists of an initial block of $p$ positive distinct integers that then repeat periodically. This means that $\{x_1, x_2, \dots, x_p\}$ are $p$ distinct positive integers and $x_{n+p}=x_n$ for every positive integer $n$. The terms of the sequence are not known and the goal is to find the period $p$. To do this, at each move it possible to reveal the value of a term of the sequence at your choice.
(a) Knowing that $1 \le p \le 10$, find the least $n$ such that there is a strategy which allows to find $p$ revealing at most $n$ terms of the sequence.
(b) Knowing that $p$ is one of the first $k$ prime numbers, find for which values of $k$ there exist a strategy that allows to find $p$ revealing at most $5$ terms of the sequence.