Found problems: 700
The number 7 is written on a board. Alice and Bob in turn (Alice begins) write an additional digit in the number on the board: it is allowed to write the digit at the beginning (provided the digit is nonzero), between any two digits or at the end. If after someone’s turn the number on the board is a perfect square then this person wins. Is it possible for a player to guarantee the win?
[i]Alexandr Gribalko[/i]
let m and n be natural numbers such that: $3m|(m+3)^n+1$
Prove that $\frac{(m+3)^n+1}{3m}$ is odd
$a, a_1,a_2,\dots ,a_n$ are natural numbers. We know that for any natural number $k$ which $ak+1$ is square, at least one of $a_1k+1,\dots ,a_n k+1$ is also square.
Prove $a$ is one of $a_1,\dots ,a_n$
[i]Proposed by Mohsen Jamali[/i]
The positive integers $a$ and $b$ are such that the numbers $15a+16b$ and $16a-15b$ are both squares of positive integers. What is the least possible value that can be taken on by the smaller of these two squares?
Let $p>5$ be a prime number and $A=\{b_1,b_2,\dots,b_{\frac{p-1}{2}}\}$ be the set of all quadratic residues modulo $p$, excluding zero. Prove that there doesn't exist any natural $a,c$ satisfying $(ac,p)=1$ such that set $B=\{ab_1+c,ab_2+c,\dots,ab_{\frac{p-1}{2}}+c\}$ and set $A$ are disjoint modulo $p$.
[i]This problem was proposed by Amir Hossein Pooya.[/i]
Find the number of integers $ c$ such that $ \minus{}2007 \leq c \leq 2007$ and there exists an integer $ x$ such that $ x^2 \plus{} c$ is a multiple of $ 2^{2007}$.
Let $x_1,x_2,x_3, \cdots$ be a sequence defined by the following recurrence relation:
\[ \begin{cases}x_{1}&= 4\\ x_{n+1}&= x_{1}x_{2}x_{3}\cdots x_{n}+5\text{ for }n\ge 1\end{cases} \]
The first few terms of the sequence are $x_1=4,x_2=9,x_3=41 \cdots$
Find all pairs of positive integers $\{a,b\}$ such that $x_a x_b$ is a perfect square.
Let $ f(x) \equal{} x^8 \plus{} 4x^6 \plus{} 2x^4 \plus{} 28x^2 \plus{} 1.$ Let $ p > 3$ be a prime and suppose there exists an integer $ z$ such that $ p$ divides $ f(z).$ Prove that there exist integers $ z_1, z_2, \ldots, z_8$ such that if \[ g(x) \equal{} (x \minus{} z_1)(x \minus{} z_2) \cdot \ldots \cdot (x \minus{} z_8),\] then all coefficients of $ f(x) \minus{} g(x)$ are divisible by $ p.$
Find all positive integers, such that there exist positive integers $a, b, c$, satisfying $\gcd(a, b, c)=1$ and $n=\gcd(ab+c, ac-b)=a+b+c$.
Find the remainder of
$$\prod_{n = 2}^{99} (1 - n^2 + n^4)(1 - 2n^2 + n^4)$$
when divided by $101$.
Do there exist natural numbers $a, b$ and $c$ such that $a^2+b^2+c^2$ is divisible by $2013(ab+bc+ca)$?
[i]Proposed by Mahan Malihi[/i]
Prove that the system \begin{align*}
x^6+x^3+x^3y+y & = 147^{157} \\
x^3+x^3y+y^2+y+z^9 & = 157^{147}
\end{align*} has no solutions in integers $x$, $y$, and $z$.
Let $a, b$ and $c$ be positive integers satisfying the equation $(a, b) + [a, b]=2021^c$. If $|a-b|$ is a prime number, prove that the number $(a+b)^2+4$ is composite.
[i]Proposed by Serbia[/i]
Prove that the number $a =\overline{{1...1}{5...5}6}$ is a perfect square (where $1$s are $2012$ in total and $5$s are $2011$ in total)
An infinite arithmetic progression whose terms are positive integers contains the square of an integer and the cube of an integer. Show that it contains the sixth power of an integer.
Find all nonnegative integers $m$ such that
\[a_m=(2^{2m+1})^2+1 \]
is divisible by at most two different primes.
Let $(x_{n})_{n=1}^{+\infty}$ be a sequence defined recursively with $x_{n+1} = x_{n}(x_{n}-2)$ and $x_{1} = \frac{7}{2}$. Let $x_{2021} = \frac{a}{b}$, where $a,b \in \mathbb{N}$ are coprime. Show that if $p$ is a prime divisor of $a$, then either $3|p-1$ or $p=3$.
[i]Authored by Nikola Velov[/i]
A number $n$ is [i]interesting[/i] if 2018 divides $d(n)$ (the number of positive divisors of $n$). Determine all positive integers $k$ such that there exists an infinite arithmetic progression with common difference $k$ whose terms are all interesting.
Given a prime number $p > 2$. Find the least $n\in Z_+$, for which every set of $n$ perfect squares not divisible by $p$ contains nonempty subset with product of all it's elements equal to $1\ (\text{mod}\ p)$
For integers $x$, $y$, and $z$, we have $(x-y)(y-z)(z-x)=x+y+z$. Prove that $27|x+y+z$.
For each integer $a_0 > 1$, define the sequence $a_0, a_1, a_2, \ldots$ for $n \geq 0$ as
$$a_{n+1} =
\begin{cases}
\sqrt{a_n} & \text{if } \sqrt{a_n} \text{ is an integer,} \\
a_n + 3 & \text{otherwise.}
\end{cases}
$$
Determine all values of $a_0$ such that there exists a number $A$ such that $a_n = A$ for infinitely many values of $n$.
[i]Proposed by Stephan Wagner, South Africa[/i]
Let $a$, $b$, $c$, $d$, $e$ be distinct positive integers such that $a^4+b^4=c^4+d^4=e^5$. Show that $ac+bd$ is a composite number.
For each prime $p$, construct a graph $G_p$ on $\{1,2,\ldots p\}$, where $m\neq n$ are adjacent if and only if $p$ divides $(m^{2} + 1-n)(n^{2} + 1-m)$. Prove that $G_p$ is disconnected for infinitely many $p$
If $n$ is a positive integer, let $A = \{n,n+1,...,n+17 \}$.
Does there exist some values of $n$ for which we can divide $A$ into two disjoints subsets $B$ and $C$ such that the product of the elements of $B$ is equal to the product of the elements of $C$?
Let $n$ be a nonnegative integer, and let $p$ be a prime number that is congruent to $7$ modulo $8$. Prove that
$$\sum_{k=1}^{p} \left\{ \frac{k^{2n}}{p} - \frac{1}{2} \right\} = \frac{p-1}{2}$$