Found problems: 1048
Let $p > 10^9$ be a prime number such that $4p + 1$ is also prime.
Prove that the decimal expansion of $\frac{1}{4p+1}$ contains all the digits $0,1, \ldots, 9$.
The sequence $\{a_n\}$ is defined by $a_0 = 1, a_1 = 2,$ and for $n \geq 2,$
$$a_n = a_{n-1}^2 + (a_0a_1 \dots a_{n-2})^2.$$
Let $k$ be a positive integer, and let $p$ be a prime factor of $a_k.$ Show that $p > 4(k-1).$
Prove that equation $ p^{4}\plus{}q^{4}\equal{}r^{4}$ does not have solution in set of prime numbers.
Let $p=2^n+1$ and $3^{(p-1)/2}+1\equiv 0 \pmod p$. Show that $p$ is a prime.
[i](Zhuge Liang) [/i]
Let $p\geq 3$ be an odd positive integer. Show that $p$ is prime if and only if however we choose $(p+1)/2$ pairwise distinct positive integers, we can find two of them, $a$ and $b$, such that $(a+b)/\gcd(a,b)\geq p.$
Prove that a positive integer $n$ is composite if and only if there exist positive integers $a,b,x,y$ such that $a+b = n$ and $\frac{x}{a}+\frac{y}{b}= 1$.
Find all positive integers $n$ such that there exists a prime number $p$, such that $p^n-(p-1)^n$ is a power of $3$.
Note. A power of $3$ is a number of the form $3^a$ where $a$ is a positive integer.
Show that, for any fixed integer $\,n \geq 1,\,$ the sequence \[ 2, \; 2^2, \; 2^{2^2}, \; 2^{2^{2^2}}, \ldots (\mbox{mod} \; n) \] is eventually constant.
[The tower of exponents is defined by $a_1 = 2, \; a_{i+1} = 2^{a_i}$. Also $a_i \; (\mbox{mod} \; n)$ means the remainder which results from dividing $a_i$ by $n$.]
For an infinite sequence $a_1<a_2<a_3<...$ of positive integers we say that it is [i]nice[/i] if for every positive integer $n$ holds $a_{2n}=2a_n$. Prove the following statements:
$a)$ If there is given a [i]nice[/i] sequence and prime number $p>a_1$, there exist some term of the sequence which is divisible by $p$.
$b)$ For every prime number $p>2$, there exist a [i]nice[/i] sequence such that no terms of the sequence are divisible by $p$.
Let $\mathbb N$ denote the set of all natural numbers. Show that there exists two nonempty subsets $A$ and $B$ of $\mathbb N$ such that
[list=1]
[*] $A\cap B=\{1\};$
[*] every number in $\mathbb N$ can be expressed as the product of a number in $A$ and a number in $B$;
[*] each prime number is a divisor of some number in $A$ and also some number in $B$;
[*] one of the sets $A$ and $B$ has the following property: if the numbers in this set are written as $x_1<x_2<x_3<\cdots$, then for any given positive integer $M$ there exists $k\in \mathbb N$ such that $x_{k+1}-x_k\ge M$.
[*] Each set has infinitely many composite numbers.
[/list]
Specified natural number $a$. Prove that there are an infinite number of prime numbers $p$ such that for some natural $n$ the number $2^{2^n} + a$ is divisible by $p$.
For a given positive integer $n$ and prime number $p$, find the minimum value of positive integer $m$ that satisfies the following property: for any polynomial $$f(x)=(x+a_1)(x+a_2)\ldots(x+a_n)$$ ($a_1,a_2,\ldots,a_n$ are positive integers), and for any non-negative integer $k$, there exists a non-negative integer $k'$ such that $$v_p(f(k))<v_p(f(k'))\leq v_p(f(k))+m.$$ Note: for non-zero integer $N$,$v_p(N)$ is the largest non-zero integer $t$ that satisfies $p^t\mid N$.
The number $400000001$ can be written as $p\cdot q$, where $p$ and $q$ are prime numbers. Find the sum of the prime factors of $p+q-1$.
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$ .
Suppose an integer $x$, a natural number $n$ and a prime number $p$ satisfy the equation $7x^2-44x+12=p^n$. Find the largest value of $p$.
Denote by $d(n)$ the number of divisors of the positive integer $n$. A positive integer $n$ is called highly divisible if $d(n) > d(m)$ for all positive integers $m < n$.
Two highly divisible integers $m$ and $n$ with $m < n$ are called consecutive if there exists no highly divisible integer $s$ satisfying $m < s < n$.
(a) Show that there are only finitely many pairs of consecutive highly divisible
integers of the form $(a, b)$ with $a\mid b$.
(b) Show that for every prime number $p$ there exist infinitely many positive highly divisible integers $r$ such that $pr$ is also highly divisible.
Let $p$ be a prime number such that $3p+10$ is a sum of squares of six consecutive positive integers. Prove that $p-7$ is divisible by $36$.
Is it possible to arrange on a circle all composite positive integers not exceeding $ 10^6$, so that no two neighbouring numbers are coprime?
[i]Author: L. Emelyanov[/i]
[hide="Tuymaada 2008, Junior League, First Day, Problem 2."]Prove that all composite positive integers not exceeding $ 10^6$
may be arranged on a circle so that no two neighbouring numbers are coprime. [/hide]
A positive proper divisor is a positive divisor of a number, excluding itself. For positive integers $n \ge 2$, let $f(n)$ denote the number that is one more than the largest proper divisor of $n$. Determine all positive integers $n$ such that $f(f(n)) = 2$.
Find all positive integers $a$ such that $4x^2 + a$ is prime for all $x = 0, 1, \dots, a - 1$.
a) Show that it is possible to pair off the numbers $1,2,3,\ldots ,10$ so that the sums of each of the five pairs are five different prime numbers.
b) Is it possible to pair off the numbers $1,2,3,\ldots ,20$ so that the sums of each of the ten pairs are ten different prime numbers?
Le $S$ be the set of positive integers greater than or equal to $2$. A function $f: S\rightarrow S$ is italian if $f$ satifies all the following three conditions:
1) $f$ is surjective
2) $f$ is increasing in the prime numbers(that is, if $p_1<p_2$ are prime numbers, then $f(p_1)<f(p_2)$)
3) For every $n\in S$ the number $f(n)$ is the product of $f(p)$, where $p$ varies among all the primes which divide $n$ (For instance, $f(360)=f(2^3\cdot 3^2\cdot 5)=f(2)\cdot f(3)\cdot f(5)$).
Determine the maximum and the minimum possible value of $f(2020)$, when $f$ varies among all italian functions.
Find all prime numbers $p, q$ such that$$p(p+1)(p^2+1) = q^2(q^2+q+1) + 2025.$$
[i]Proposed by Md. Fuad Al Alam[/i]
For all integers $n\geq 1$ we define $x_{n+1}=x_1^2+x_2^2+\cdots +x_n^2$, where $x_1$ is a positive integer. Find the least $x_1$ such that 2006 divides $x_{2006}$.
Find all positive integers $n>2$ such that
$$ n! \mid \prod_{ p<q\le n, p,q \, \text{primes}} (p+q)$$