Found problems: 700
Prove that for any n natural, the number \[ \sum \limits_{k=0}^{n} \binom{2n+1}{2k+1} 2^{3k} \]
cannot be divided by $5$.
Find the number of nonnegative integers $n < 29$ such that there exists positive integers $x,y$ where $$x^2+5xy-y^2$$ has remainder $n$ when divided by $29$.
A prime number $p$ is mundane if there exist positive integers $a$ and $b$ less than $\tfrac{p}{2}$ such that $\tfrac{ab-1}{p}$ is a positive integer. Find, with proof, all prime numbers that are not mundane.
Let $p=4k+3$ be a prime. Prove that if
\[\dfrac {1} {0^2+1}+\dfrac{1}{1^2+1}+\cdots+\dfrac{1}{(p-1)^2+1}=\dfrac{m} {n}\]
(where the fraction $\dfrac {m} {n}$ is in reduced terms), then $p \mid 2m-n$.
[i]Proposed by A. Golovanov[/i]
Find all integer/s $n$ such that $\displaystyle{\frac{5^n-1}{3}}$ is a prime or a perfect square of an integer.
[i]Proposed by Prajit Adhikari, Nepal[/i]
Let m be a positive integer. Prove that there exist infinitely many prime numbers p such that m+p^3 is composite.
Find all positive integers $n$ such that
$$n(2^n-1)$$
is a perfect square
Let $p$ be an odd prime and let $Z_{p}$ denote (the field of) integers modulo $p$. How many elements are in the set \[\{x^{2}: x \in Z_{p}\}\cap \{y^{2}+1: y \in Z_{p}\}?\]
Let $p{}$ be a fixed prime number. Determine the number of ordered $k$-tuples $(a_1,\ldots,a_k)$ of non-negative integers smaller than $p{}$ for which $p\mid a_1^2+\cdots+a_k^2$ where a) $k=3$ and b) $k$ is an arbitrary odd positive integer.
Show that there exist constants $c$ and $\alpha > \frac{1}{2}$, such that for any positive integer $n$, there is a subset $A$ of $\{1,2,\ldots,n\}$ with cardinality $|A| \ge c \cdot n^\alpha$, and for any $x,y \in A$ with $x \neq y$, the difference $x-y$ is not a perfect square.
Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$.
[i]Proposed by Jaroslaw Wroblewski, Poland[/i]
Determine all integers $ k\ge 2$ such that for all pairs $ (m$, $ n)$ of different positive integers not greater than $ k$, the number $ n^{n\minus{}1}\minus{}m^{m\minus{}1}$ is not divisible by $ k$.
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.
Let $n \geq 2$ be natural number.
Prove, that $(1^{n-1}+2^{n-1}+....+(n-1)^{n-1})+1$ divided by $n$ iff for any prime divisor $p$ of $n$ $p| \frac{n}{p}-1 $ and $(p-1)| \frac{n}{p}-1$.
Let $S$ be the set of all pairs $(a, b)$ of integers satisfying $0 \le a, b \le 2014.$ For any pairs $s_1 = (a_1, b_1), s_2 = (a_2, b_2) \in S$, define \[s_1 + s_2 = ((a_1 + a_2)_{2015}, (b_1 + b_2)_{2015}) \\ \text { and } \\ s_1 \times s_2 = ((a_1a_2 + 2b_1b_2)_{2015}, (a_1b_2 + a_2b_1)_{2015}), \] where $n_{2015}$ denotes the remainder when an integer $n$ is divided by $2015.$
Compute the number of functions $f : S \rightarrow S$ satisfying \[ f(s_1 + s_2) = f(s_1) + f(s_2) \text{ and } f(s_1 \times s_2) = f(s_1) \times f(s_2) \] for all $s_1, s_2 \in S.$
[i] Proposed by Yang Liu [/i]
Four positive integers $x,y,z$ and $t$ satisfy the relations
\[ xy - zt = x + y = z + t. \]
Is it possible that both $xy$ and $zt$ are perfect squares?
Find all positive integers $n$ such that $4^n+6^n+9^n$ is a square.
[i]David Yang, Alex Zhu.[/i]
Let $a$ and $b$ be distinct integers greater than $1$. Prove that there exists a positive integer $n$ such that $(a^n-1)(b^n-1)$ is not a perfect square.
[i]Proposed by Mongolia[/i]
None of the positive integers $k,m,n$ are divisible by $5$. Prove that at least one of the numbers $k^2-m^2,m^2-n^2,n^2-k^2$ is divisible by $5$.
Let $P(n)$ be a quadratic trinomial with integer coefficients. For each positive integer $n$, the number $P(n)$ has a proper divisor $d_n$, i.e., $1<d_n<P(n)$, such that the sequence $d_1,d_2,d_3,\ldots$ is increasing. Prove that either $P(n)$ is the product of two linear polynomials with integer coefficients or all the values of $P(n)$, for positive integers $n$, are divisible by the same integer $m>1$.
Find all positive integers $n$ that are quadratic residues modulo all primes greater than $n$.
Let $ b_1<b_2<b_3<\dots $ be the sequence of all natural numbers which are sum of squares of two natural numbers.
Prove that there exists infinite natural numbers like $m$ which $b_{m+1}-b_m=2015$ .
Prove that there are infinitely many distinct pairs $(a, b)$ of relatively prime integers $a>1$ and $b>1$ such that $a^b+b^a$ is divisible by $a+b$.
Find all positive integers $a$ such that for any positive integer $n\ge 5$ we have $2^n-n^2\mid a^n-n^a$.
$p$ is an odd prime number. Find all $\frac{p-1}2$-tuples $\left(x_1,x_2,\dots,x_{\frac{p-1}2}\right)\in \mathbb{Z}_p^{\frac{p-1}2}$ such that
$$\sum_{i = 1}^{\frac{p-1}{2}} x_{i} \equiv \sum_{i = 1}^{\frac{p-1}{2}} x_{i}^{2} \equiv \cdots \equiv \sum_{i = 1}^{\frac{p-1}{2}} x_{i}^{\frac{p - 1}{2}} \pmod p.$$
[i]Proposed by Ali Partofard[/i]