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$.

Let $a_1,a_2,a_3,\ldots$ be a sequence of integers, with the property that every consecutive group of $a_i$'s averages to a perfect square. More precisely, for every positive integers $n$ and $k$, the quantity \[\frac{a_n+a_{n+1}+\cdots+a_{n+k-1}}{k}\] is always the square of an integer. Prove that the sequence must be constant (all $a_i$ are equal to the same perfect square). [i]Evan O'Dorney and Victor Wang[/i]

Given a positive odd integer $n$, show that the arithmetic mean of fractional parts $\{\frac{k^{2n}}{p}\}, k=1,..., \frac{p-1}{2}$ is the same for infinitely many primes $p$ .

Find the number of positive integer pairs $1\leqslant a,b \leqslant 2027$ that satisfy \[ 2027 \mid a^6+b^5+b^2.\] (Note: For integers $a$ and $b$, the notation $a \mid b$ means that there is an integer $c$ such that $ac=b$.) [i]Proposed by Valentio Iverson, Indonesia[/i]

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]

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$.

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]

Let $p$ be a prime number. We construct a directed graph of $p$ vertices, labeled with integers from $0$ to $p-1$. There is an edge from vertex $x$ to vertex $y$ if and only if $x^2+1\equiv y \pmod{p}$. Let $f(p)$ denotes the length of the longest directed cycle in this graph. Prove that $f(p)$ can attain arbitrarily large values.

$p=3k+1$ is a prime number. For each $m \in \mathbb Z_p$, define function $L$ as follow: $L(m) = \sum_{x \in \mathbb{Z}_p}^{ } \left ( \frac{x(x^3 + m)}{p} \right )$ [i]a)[/i] For every $m \in \mathbb Z_p$ and $t \in {\mathbb Z_p}^{*}$ prove that $L(m) = L(mt^3)$. (5 points) [i]b)[/i] Prove that there is a partition of ${\mathbb Z_p}^{*} = A \cup B \cup C$ such that $|A| = |B| = |C| = \frac{p-1}{3}$ and $L$ on each set is constant. Equivalently there are $a,b,c$ for which $L(x) = \left\{\begin{matrix} a & & &x \in A \\ b& & &x \in B \\ c& & & x \in C \end{matrix}\right.$ . (7 points) [i]c)[/i] Prove that $a+b+c = -3$. (4 points) [i]d)[/i] Prove that $a^2 + b^2 + c^2 = 6p+3$. (12 points) [i]e)[/i] Let $X= \frac{2a+b+3}{3},Y= \frac{b-a}{3}$, show that $X,Y \in \mathbb Z$ and also show that :$p= X^2 + XY +Y^2$. (2 points) (${\mathbb Z_p}^{*} = \mathbb Z_p \setminus \{0\}$)

Let $p=4k+3$ be a prime number. Find the number of different residues mod p of $(x^{2}+y^{2})^{2}$ where $(x,p)=(y,p)=1.$

Given a positive odd integer $n$, show that the arithmetic mean of fractional parts $\{\frac{k^{2n}}{p}\}, k=1,..., \frac{p-1}{2}$ is the same for infinitely many primes $p$ .

Let $a, b, c$ be integers and let $p$ be an odd prime with \[p \not\vert a \;\; \text{and}\;\; p \not\vert b^{2}-4ac.\] Show that \[\sum_{k=1}^{p}\left( \frac{ak^{2}+bk+c}{p}\right) =-\left( \frac{a}{p}\right).\]

Let $b \geqslant 2$ be a positive integer. Anu has an infinite collection of notes with exactly $b-1$ copies of a note worth $b^k-1$ rupees, for every integer $k\geqslant 1$. A positive integer $n$ is called payable if Anu can pay exactly $n^2+1$ rupees by using some collection of her notes. Prove that if there is a payable number, there are infinitely many payable numbers. [i]Proposed by Shantanu Nene[/i]