Found problems: 700
Find all positive integers $n$ such that for any integer $k$ there exists an integer $a$ for which $a^3+a-k$ is divisible by $n$.
[i]Warut Suksompong, Thailand[/i]
For how many primes $p$ less than $15$, there exists integer triples $(m,n,k)$ such that
\[
\begin{array}{rcl}
m+n+k &\equiv& 0 \pmod p \\
mn+mk+nk &\equiv& 1 \pmod p \\
mnk &\equiv& 2 \pmod p.
\end{array}
\]
$
\textbf{(A)}\ 2
\qquad\textbf{(B)}\ 3
\qquad\textbf{(C)}\ 4
\qquad\textbf{(D)}\ 5
\qquad\textbf{(E)}\ 6
$
Prove that there are infinite many positive integers $ n$ such that
$ n^2\plus{}1\mid n!$, and infinite many of those for which $ n^2\plus{}1 \nmid n!$.
Determine all positive integers $n$ for which there exists an integer $m$ such that $2^{n}-1$ divides $m^{2}+9$.
Solve the equation
\[ 3^x \minus{} 5^y \equal{} z^2.\]
in positive integers.
[i]Greece[/i]
Find all function $f:\mathbb{Z}\rightarrow\mathbb{Z}$ such that
$f(f(x)+f(y))+f(x)f(y)=f(x+y)f(x-y)$
for all integer $x,y$
Let $p$ be a prime number and $F=\left \{0,1,2,...,p-1 \right \}$. Let $A$ be a proper subset of $F$ that satisfies the following property: if $a,b \in A$, then $ab+1$ (mod $p$) $ \in A$.
How many elements can $A$ have? (Justify your answer.)
Prove that there exist infinitely many positive integers $n$ such that the largest prime divisor of $n^4 + n^2 + 1$ is equal to the largest prime divisor of $(n+1)^4 + (n+1)^2 +1$.
Let $p$ be a prime number in the form $p=4k+3$. Prove that if the numbers $x_0,y_0,z_0,t_0$ are solutions of the equation $x^{2p}+y^{2p}+z^{2p}=t^{2p}$, then at least one of them is divisible by $p$. [i](Plamen Koshlukov)[/i]
Let $n\geq 1$ be a positive integer. We say that an integer $k$ is a [i]fan [/i]of $n$ if $0\leq k\leq n-1$ and there exist integers $x,y,z\in\mathbb{Z}$ such that
\begin{align*}
x^2+y^2+z^2 &\equiv 0 \pmod n;\\
xyz &\equiv k \pmod n.
\end{align*}
Let $f(n)$ be the number of fans of $n$. Determine $f(2020)$.
Prove that there are no integers $x, y, z$ satisfying the equation $$x^2+y^2-z^2=xyz-2.$$
[i]Proposed by Navid Safaei[/i]
The sequences $(a_n),(b_n)$ are defined by $a_0=1,b_0=4$ and for $n\ge 0$
\[a_{n+1}=a_n^{2001}+b_n,\ \ b_{n+1}=b_n^{2001}+a_n\]
Show that $2003$ is not divisor of any of the terms in these two sequences.
Let $m$ be a positive integer and $p$ be a prime, such that $m^2 - 2$ is divisible by $p$. Suppose that there exists positive integer $a$ such that $a^2+m-2$ is divisible by $p$. Prove that there exists positive integer $b$ such that $b^2- m -2$ is divisible by $p$.
Let $a_1,a_2,\dots,a_m$ be a finite sequence of positive integers. Prove that there exist nonnegative integers $b,c,$ and $N$ such that $$\left\lfloor \sum_{i=1}^m \sqrt{n+a_i} \right\rfloor =\left\lfloor \sqrt{bn+c} \right\rfloor$$ holds for all integers $n>N.$
[i]Proposed by Carl Schildkraut[/i]
For some integer $m$, the polynomial $x^3-2011x+m$ has the three integer roots $a$, $b$, and $c$. Find $|a|+|b|+|c|$.
Let $(x_{n}) \ n\geq 1$ be a sequence of real numbers with $x_{1}=1$ satisfying $2x_{n+1}=3x_{n}+\sqrt{5x_{n}^{2}-4}$
a) Prove that the sequence consists only of natural numbers.
b) Check if there are terms of the sequence divisible by $2011$.
Let $P$ be a polynomial with integer coefficients. We say $P$ is [i]good [/i] if there exist infinitely many prime numbers $q$ such that the set $$X=\left\{P(n) \mod q : \quad n\in \mathbb N\right\}$$ has at least $\frac{q+1}{2}$ members.
Prove that the polynomial $x^3+x$ is good.
Prove that $5^n-3^n$ is not divisible by $2^n+65$ for any positive integer $n$.
Let $A=\{a^2+13b^2 \mid a,b \in\mathbb{Z}, b\neq0\}$. Prove that there
a) exist
b) exist infinitely many
$x,y$ integer pairs such that $x^{13}+y^{13} \in A$ and $x+y \notin A$.
(proposed by B. Bayarjargal)
Prove that there exists a polynomial with integer coefficients satisfying the following conditions:
(a)$f(x)=0$ has no rational root.
(b) For any positive integer $n$, there always exists an integer $m$ such that $n\mid f(m)$.
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$
Determine all functions $f$ defined on the set of all positive integers and taking non-negative integer values, satisfying the three conditions:
[list]
[*] $(i)$ $f(n) \neq 0$ for at least one $n$;
[*] $(ii)$ $f(x y)=f(x)+f(y)$ for every positive integers $x$ and $y$;
[*] $(iii)$ there are infinitely many positive integers $n$ such that $f(k)=f(n-k)$ for all $k<n$.
[/list]
The sides of a 99-gon are initially colored so that consecutive sides are red, blue, red, blue, $\,\ldots, \,$ red, blue, yellow. We make a sequence of modifications in the coloring, changing the color of one side at a time to one of the three given colors (red, blue, yellow), under the constraint that no two adjacent sides may be the same color. By making a sequence of such modifications, is it possible to arrive at the coloring in which consecutive sides
are red, blue, red, blue, red, blue, $\, \ldots, \,$ red, yellow, blue?
For positive integers $a, b, c$ (not necessarily distinct), suppose that $a+bc, b+ac, c+ab$ are all perfect squares. Show that $$a^2(b+c)+b^2(a+c)+c^2(a+b)+2abc$$ can be written as sum of two squares.
Let $x$, $y$ and $z$ be odd positive integers such that $\gcd \ (x, y, z) = 1$ and the sum $x^2 +y^2 +z^2$ is divisible by $x+y+z$. Prove that $x+y+z- 2$ is not divisible by $3$.