Show that every set $ \{p_1,p_2,\dots,p_k\}$ of prime numbers fulfils the following: The sum of all unit fractions (that are fractions of the type $ \frac{1}{n}$), whose denominators are exactly the $ k$ given prime factors (but in arbitrary powers with exponents unequal zero), is an unit fraction again. How big is this sum if $ \frac{1}{2004}$ is among this summands? Show that for every set $ \{p_1,p_2,\dots,p_k\}$ containing $ k$ prime numbers ($ k>2$) is the sum smaller than $ \frac{1}{N}$ with $ N=2\cdot 3^{k-2}(k-2)!$

Prove that there are infinitely many positive $n$ that for all prime divisors $p$ of $n^2 + 3, \exists 0 \leq k \leq \sqrt{n}$ and $p \mid k^2+3$

Construct a tetromino by attaching two $2 \times 1$ dominoes along their longer sides such that the midpoint of the longer side of one domino is a corner of the other domino. This construction yields two kinds of tetrominoes with opposite orientations. Let us call them $S$- and $Z$-tetrominoes, respectively. Assume that a lattice polygon $P$ can be tiled with $S$-tetrominoes. Prove that no matter how we tile $P$ using only $S$- and $Z$-tetrominoes, we always use an even number of $Z$-tetrominoes. [i]Proposed by Tamas Fleiner and Peter Pal Pach, Hungary[/i]

assume that A is a finite subset of prime numbers, and a is an positive integer. prove that there are only finitely many positive integers m s.t: prime divisors of a^m-1 are contained in A.

Let $p\geq 3$ a prime number, $a$ and $b$ integers such that $\gcd(a, b)=1$. Let $n$ a natural number such that $p$ divides $a^{2^n}+b^{2^n}$, prove that $2^{n+1}$ divides $p-1$.

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$.

Several sets of prime numbers, such as $ \{ 7, 83, 421, 659\}$ use each of the nine nonzero digits exactly once. What is the smallest possible sum such a set of primes could have? $ \textbf{(A)}\ 193\qquad\textbf{(B)}\ 207\qquad\textbf{(C)}\ 225\qquad\textbf{(D)}\ 252\qquad\textbf{(E)}\ 447$

An infinite sequence $a_1, a_2,\ldots$ of positive integers is such that $a_n \geq 2$ and $a_{n+2}$ divides $a_{n+1} + a_n$ for all $n \geq 1$. Prove that there exists a prime which divides infinitely many terms of the sequence.

Consider an integer $p>1$ with the property that the polynomial $x^2 - x + p$ takes prime values for all integers $x$ such that $0\leq x <p$. Show that there is exactly one triple of integers $a, b, c$ satisfying the conditions: $$b^2 -4ac = 1-4p,\;\; 0<a \leq c,\;\; -a\leq b<a.$$

The digits $ 1$, $ 2$, $ 3$, $ 4$, $ 5$, $ 6$, $ 7$, and $ 9$ are used to form four two-digit prime numbers, with each digit used exactly once. What is the sum of these four primes? $ \text{(A)}\ 150 \qquad \text{(B)}\ 160 \qquad \text{(C)}\ 170 \qquad \text{(D)}\ 180 \qquad \text{(E)}\ 190$

Determine all sequences of strictly positive integers $a_1, a_2, a_3, \ldots$ satisfying the following two conditions: [list] [*]There exists an integer $M > 0$ such that, for all indices $n \geqslant 1$, $0 < a_n \leqslant M$. [*]For any prime number $p$ and for any index $n \geqslant 1$, the number \[ a_n a_{n+1} \cdots a_{n+p-1} - a_{n+p} \] is a multiple of $p$. [/list]

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.)

$p$ is a prime number such that its remainder divided by 8 is 3. Find all pairs of rational numbers $(x,y)$ that satisfy the following equation. $$p^2 x^4-6px^2+1=y^2$$

Let us call "absolutely prime" the prime number, if having transposed its digits in an arbitrary order, we obtain prime number again. Prove that its notation cannot contain more than three different digits.

Find all the triples of positive integers $(a,b,c)$ for which the number \[\frac{(a+b)^4}{c}+\frac{(b+c)^4}{a}+\frac{(c+a)^4}{b}\] is an integer and $a+b+c$ is a prime.

What is the sum of the digits of the smallest prime that can be written as a sum of $5$ distinct primes? $\textbf{(A) }5\qquad\textbf{(B) }7\qquad\textbf{(C) }9\qquad\textbf{(D) }10\qquad\textbf{(E) }11$

The sequence $(a_n)_{n\in\mathbb{N}}$ is defined by $a_1=3$ and $$a_n=a_1a_2\cdots a_{n-1}-1$$ Show that there exist infinitely many prime number that divide at least one number in this sequences

Find all positive integer $n$ and prime number $p$ such that $p^2+7^n$ is a perfect square

Consider all triples $(x,y,p)$ of positive integers, where $p$ is a prime number, such that $4x^2 + 8y^2 + (2x-3y)p-12xy = 0$. Which below number is a perfect square number for every such triple $(x,y, p)$? A. $4y + 1$ B. $2y + 1$ C. $8y + 1$ D. $5y - 3$ E. $8y - 1$

There are finitely many primes dividing the numbers $\{ a \cdot b^n + c\cdot d^n : n=1, 2, 3,... \}$ where $a, b, c, d$ are positive integers. Prove that $b=d$.

In a Pythagorean triangle all sides are longer than 5. Is it possible that (a) all three sides are prime numbers, (b) exactly two sides are prime numbers. (Note: We call a triangle "Pythagorean", if it is a right-angled triangle where all sides are positive integers.)

Let $N$ be the number of ordered pairs $(x,y)$ st $1 \leq x,y \leq p(p-1)$ and : $$x^{y} \equiv y^{x} \equiv 1 \pmod{p}$$ where $p$ is a fixed prime number. Show that : $$(\phi {(p-1)}d(p-1))^2 \leq N \leq ((p-1)d(p-1))^2$$ where $d(n)$ is the number of divisors of $n$

A well-known theorem asserts that a prime $p > 2$ can be written as the sum of two perfect squares ($p = m^2 +n^2$ , with $m$ and $n$ integers) if and only if $p \equiv 1$ (mod $4$). Assuming this result, find which primes $p > 2$ can be written in each of the following forms, using integers $x$ and $y$: a) $x^2 +16y^2, $ b) $4x^2 +4xy+ 5y^2.$

What is the largest positive integer that is not the sum of a positive integral multiple of 42 and a positive composite integer?

Let a pair of positive integers $(n, m)$ that are relatively prime be called [i]intertwined[/i] if among any two divisors of $n$ greater than $1$, there exists a divisor of $m$ and among any two divisors of $m$ greater than $1$, there exists a divisor of $n$. For example, pair $(63, 64)$ is intertwined. [b]a)[/b] Find the largest integer $k$ for which there exists an intertwined pair $(n, m)$ such that the product $nm$ is equal to the product of the first $k$ prime numbers. [b]b)[/b] Prove that there does [b]not[/b] exist an intertwined pair $(n, m)$ such that the product $nm$ is the product of $2025$ distinct prime numbers. [b]c)[/b] Prove that there exists an intertwined pair $(n, m)$ such that the number of divisors of $n$ is greater than $2025$. [i]Proposed by Stijn Cambie, Belgium[/i]