Found problems: 700
Show that \[ \prod_{1\leq x < y \leq \frac{p\minus{}1}{2}} (x^2\plus{}y^2) \equiv (\minus{}1)^{\lfloor\frac{p\plus{}1}{8}\rfloor} \;(\textbf{mod}\;p\ ) \] for every prime $ p\equiv 3 \;(\textbf{mod}\;4\ )$. [J. Suranyi]
Find all positive integers $ n$ such that there exists a unique integer $ a$ such that $ 0\leq a < n!$ with the following property:
\[ n!\mid a^n \plus{} 1
\]
[i]Proposed by Carlos Caicedo, Colombia[/i]
Find all nonnegative integer solutions $(x,y,z,w)$ of the equation\[2^x\cdot3^y-5^z\cdot7^w=1.\]
Does there exist a natural number $n$, for which $n.2^{2^{2014}}-81-n$ is a perfect square?
Prove that if $n$ is a positive integer such that the equation \[ x^3-3xy^2+y^3=n \] has a solution in integers $x,y$, then it has at least three such solutions. Show that the equation has no solutions in integers for $n=2891$.
Show that there exist infinitely many mutually non- congruent triangles $T$, satisfying
(i) The side lengths of $T $ are consecutive integers.
(ii) The area of $T$ is an integer.
Determine all natural numbers $n$ such that for each natural number $a$ relatively prime with $n$ and $a \le 1 + \left\lfloor \sqrt{n} \right\rfloor$ there exists some integer $x$ with $a \equiv x^2 \mod n$.
Remark: "Natural numbers" is the set of positive integers.
Determine whether there exists an arithimethical progression consisting of 40 terms and each of whose terms can be written in the form $ 2^m \plus{} 3^n$ or not. where $ m,n$ are nonnegative integers.
Prove that if $ p$ is a prime number, then $ 7p+3^{p}-4$ is not a perfect square.
Every point with integer coordinates in the plane is the center of a disk with radius $1/1000$.
(1) Prove that there exists an equilateral triangle whose vertices lie in different discs.
(2) Prove that every equilateral triangle with vertices in different discs has side-length greater than $96$.
[i]Radu Gologan, Romania[/i]
[hide="Remark"]
The "> 96" in [b](b)[/b] can be strengthened to "> 124". By the way, part [b](a)[/b] of this problem is the place where I used [url=http://mathlinks.ro/viewtopic.php?t=5537]the well-known "Dedekind" theorem[/url].
[/hide]
Find all positive integers $ n$ for which the numbers in the set $ S \equal{} \{1,2, \ldots,n \}$ can be colored red and blue, with the following condition being satisfied: The set $ S \times S \times S$ contains exactly $ 2007$ ordered triples $ \left(x, y, z\right)$ such that:
[b](i)[/b] the numbers $ x$, $ y$, $ z$ are of the same color,
and
[b](ii)[/b] the number $ x \plus{} y \plus{} z$ is divisible by $ n$.
[i]Author: Gerhard Wöginger, Netherlands[/i]
Solve the equation $x^2- 10[x] + 9 = 0$.
($[x]$ is the integer part of $x$, $[x]$ is equal to the largest integer not exceeding $x$. For example, $[3,33] = 3$, $[2] = 2$, $[- 3.01] = -4$).
Let $M$ be an integer, and let $p$ be a prime with $p>25$. Show that the set $\{M, M+1, \cdots, M+ 3\lfloor \sqrt{p} \rfloor -1\}$ contains a quadratic non-residue to modulus $p$.
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$.
$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]
Let $p>13$ be a prime of the form $2q+1$, where $q$ is prime. Find the number of ordered pairs of integers $(m,n)$ such that $0\le m<n<p-1$ and
\[3^m+(-12)^m\equiv 3^n+(-12)^n\pmod{p}.\]
[i]Alex Zhu.[/i]
[hide="Note"]The original version asked for the number of solutions to $2^m+3^m\equiv 2^n+3^n\pmod{p}$ (still $0\le m<n<p-1$), where $p$ is a Fermat prime.[/hide]
Find, with proof, all positive integers $n$ for which $2^n + 12^n + 2011^n$ is a perfect square.
Find all positive integers $n$ such that $7^n+147$ is a perfect square.
Define the Fibonacci numbers by $F_1 = F_2 = 1$ and $F_n = F_{n-1} + F_{n-2}$ for $n\geq 3$. Let $k$ be a positive integer. Suppose that for every positive integer $m$ there exists a positive integer $n$ such that $m \mid F_n-k$. Must $k$ be a Fibonacci number?
[i]Proposed by Fedir Yudin.[/i]
Prove that if $7$ divides $a^2 + b^2 + 1$, then $7$ does not divide $a + b$.
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).$
Determine all pairs $(x, y)$ of integers such that \[(19a+b)^{18}+(a+b)^{18}+(19b+a)^{18}\] is a nonzero perfect square.
For a prime $p$, let $\mathbb{F}_p$ denote the integers modulo $p$, and let $\mathbb{F}_p[x]$ be the set of polynomials with coefficients in $\mathbb{F}_p$. Find all $p$ for which there exists a quartic polynomial $P(x) \in \mathbb{F}_p[x]$ such that for all integers $k$, there exists some integer $\ell$ such that $P(\ell) \equiv k \pmod p$. (Note that there are $p^4(p-1)$ quartic polynomials in $\mathbb{F}_p[x]$ in total.)
[i]Aprameya Tripathy[/i]
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$.
Suppose that \[\sum_{i=1}^{982} 7^{i^2}\] can be expressed in the form $983q + r$, where $q$ and $r$ are integers and $0 \leq r \leq 492$. Find $r$.
[i]Author: Alex Zhu[/i]