Found problems: 721
Positive integers $a, b, n$ are given. Assume that $a$ and $n$ are even, $b$ is odd and the number $ab(a+b)^{n-1}$ is divisible by $a^n+b^n$. Prove that there exist a prime number $p$, such that $p^{n+1}$ divides $a^n+b^n$.
Let $p \neq 13$ be a prime number of the form $8k+5$ such that $39$ is a quadratic non-residue modulo $p$. Prove that the equation $$x_1^4+x_2^4+x_3^4+x_4^4 \equiv 0 \pmod p$$ has a solution in integers such that $p\nmid x_1x_2x_3x_4$.
Let $p,q$ be prime numbers ($q$ is odd). Prove that there exists an integer $x$ such that:
$$q |(x+1)^p-x^p$$
If and only if $$q \equiv 1 \pmod p$$
Let $c,d \geq 2$ be naturals. Let $\{a_n\}$ be the sequence satisfying $a_1 = c, a_{n+1} = a_n^d + c$ for $n = 1,2,\cdots$.
Prove that for any $n \geq 2$, there exists a prime number $p$ such that $p|a_n$ and $p \not | a_i$ for $i = 1,2,\cdots n-1$.
Let $p$ be a prime, $A$ is an infinite set of integers. Prove that there is a subset $B$ of $A$ with $2p-2$ elements, such that the arithmetic mean of any pairwise distinct $p$ elements in $B$ does not belong to $A$.
Let $p_n$ be the $n$-th prime. ($p_1=2$)
Define the sequence $(f_j)$ as follows:
- $f_1=1, f_2=2$
- $\forall j\ge 2$: if $f_j = kp_n$ for $k<p_n$ then $f_{j+1}=(k+1)p_n$
- $\forall j\ge 2$: if $f_j = p_n^2$ then $f_{j+1}=p_{n+1}$
(a) Show that all $f_i$ are different
(b) from which index onwards are all $f_i$ at least 3 digits?
(c) which integers do not appear in the sequence?
(d) how many numbers with less than 3 digits appear in the sequence?
Call a positive number $n$ [i]fine[/i], if there exists a prime number $p$ such that $p|n$ and $p^2\nmid n$. Prove that at least 99% of numbers $1, 2, 3, \ldots, 10^{12}$ are fine numbers.
A number with $2016$ zeros that is written as $101010 \dots 0101$ is given, in which the zeros and ones alternate. Prove that this number is not prime.
Find all primes $p$ such that the expression
\[\binom{p}1^2+\binom{p}2^2+\cdots+\binom{p}{p-1}^2\]
is divisible by $p^3$.
Given distinct prime numbers $p$ and $q$ and a natural number $n \geq 3$, find all $a \in \mathbb{Z}$ such that the polynomial $f(x) = x^n + ax^{n-1} + pq$ can be factored into 2 integral polynomials of degree at least 1.
Let $P$ be the set of prime numbers. Consider a subset $M$ of $P$ with at least three elements. We assume that, for each non empty and finite subset $A$ of $M$, with $A \neq M$, the prime divisors of the integer $( \prod_{p \in A} ) - 1$ belong to $M$.
Prove that $M = P$.
$\boxed{N2}$ Let $p$ be a prime numbers and $x_1,x_2,...,x_n$ be integers.Show that if
\[x_1^n+x_2^n+...+x_p^n\equiv 0 \pmod{p}\]
for all positive integers n then $x_1\equiv x_2 \equiv...\equiv x_p \pmod{p}.$
Twenty distinct points are marked on a circle and labeled $1$ through $20$ in clockwise order. A line segment is drawn between every pair of points whose labels differ by a prime number. Find the number of triangles formed whose vertices are among the original $20$ points.
Let $p$ be a prime number. Positive integers numbers $a$ and $b$ are such $\frac{p}{a}+\frac{p}{b}=1$ and $a+b$ is divisible by $p$. What values can an expression $\frac{a+b}{p}$ take?
[i]Yu.A.Karpenko[/i]
There exists a block of $1000$ consecutive positive integers containing no prime numbers, namely, $1001!+2$, $1001!+3$, $\cdots$, $1001!+1001$. Does there exist a block of $1000$ consecutive positive integers containing exactly five prime numbers?
Let $p=4k+1$ be a prime. $S$ is a set of all possible residues equal or smaller then $2k$ when $\frac{1}{2} \binom{2k}{k} n^k$ is divided by $p$. Show that \[ \sum_{x \in S} x^2 =p \]
Let $p$ be a prime number and let $M$ be a convex polygon. Suppose that there are precisely $p$ ways to tile $m$ with equilateral triangles with side $1$ and squares with side $1$. Show there is some side of $M$ of length $p-1$.
Given a prime number $p$ and let $\overline{v_1},\overline{v_2},\dotsc ,\overline{v_n}$ be $n$ distinct vectors of length $p$ with integer coordinates in an $\mathbb{R}^3$ Cartesian coordinate system. Suppose that for any $1\leqslant j<k\leqslant n$, there exists an integer $0<\ell <p$ such that all three coordinates of $\overline{v_j} -\ell \cdot \overline{v_k} $ is divisible by $p$. Prove that $n\leqslant 6$.
Define a function $f$ on the positive integers as follows: $f(n) = m$, where $m$ is the least positive integer such that $n$ is a factor of $m^2$. Find the smallest integer $M$ such that $\sqrt{M}$ is both a product of prime numbers, of which there are at least $3$, and a factor of $$\sum_{ d|M} f(d),$$ the sum of $f(d)$ for all positive integers $d$ that divide $M$.
We define the sequence $a_n=(2n)^2+1$ for each natural number $n$. We will call one number [i]bad[/i], if there don’t exist natural numbers $a>1$ and $b>1$ such that $a_n=a^2+b^2$. Prove that the natural number $n$ is [i]bad[/i], if and only if $a_n$ is prime.
Ana and Bety play a game alternating turns. Initially, Ana chooses an odd possitive integer and composite $n$ such that $2^j<n<2^{j+1}$ with $2<j$. In her first turn Bety chooses an odd composite integer $n_1$ such that
\[n_1\leq \frac{1^n+2^n+\dots+(n-1)^n}{2(n-1)^{n-1}}.\]
Then, on her other turn, Ana chooses a prime number $p_1$ that divides $n_1$. If the prime that Ana chooses is $3$, $5$ or $7$, the Ana wins; otherwise Bety chooses an odd composite positive integer $n_2$ such that \[n_2\leq \frac{1^{p_1}+2^{p_1}+\dots+(p_1-1)^{p_1}}{2(p_1-1)^{p_1-1}}.\]
After that, on her turn, Ana chooses a prime $p_2$ that divides $n_2,$, if $p_2$ is $3$, $5$, or $7$, Ana wins, otherwise the process repeats. Also, Ana wins if at any time Bety cannot choose an odd composite positive integer in the corresponding range. Bety wins if she manages to play at least $j-1$ turns. Find which of the two players has a winning strategy.
suppose that $v(x)=\sum_{p\le x,p\in \mathbb P}log(p)$ (here $\mathbb P$ denotes the set of all positive prime numbers). prove that the two statements below are equivalent:
[b]a)[/b] $v(x) \sim x$ when $x \longrightarrow \infty$
[b]b)[/b] $\pi (x) \sim \frac{x}{ln(x)}$ when $x \longrightarrow \infty$. (here $\pi (x)$ is number of the prime numbers less than or equal to $x$).
For positive integers $a>b>1$, define
\[x_n = \frac {a^n-1}{b^n-1}\]
Find the least $d$ such that for any $a,b$, the sequence $x_n$ does not contain $d$ consecutive prime numbers.
[i]V. Senderov[/i]
Let $p>$ be a prime number and $S$ be a set of $p+1$ integers. Prove that there exist pairwise distinct numbers $a_1,a_2,...,a_{p-1}\in S$ that
$$ a_1+2a_2+3a_3+...+(p-1)a_{p-1}$$ is divisible by $p$.
Consider the set $E$ of all natural numbers $n$ such that whenn divided by $11, 12, 13$, respectively, the remainders, int that order, are distinct prime numbers in an arithmetic progression. If $N$ is the largest number in $E$, find the sum of digits of $N$.