This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 33

Determine the primes $p$ for which the numbers $2\lfloor p/k\rfloor - 1, \ k = 1,2,\ldots, p,$ are all quadratic residues modulo $p.$ [i]Vlad Matei[/i]
Given a positive prime number $p$. Prove that there exist a positive integer $\alpha$ such that $p|\alpha(\alpha-1)+3$, if and only if there exist a positive integer $\beta$ such that $p|\beta(\beta-1)+25$.
Determine the primes $p$ for which the numbers $2\lfloor p/k\rfloor - 1, \ k = 1,2,\ldots, p,$ are all quadratic residues modulo $p.$ [i]Vlad Matei[/i]
Let $ m,\ n \geq 3$ be positive odd integers. Prove that $ 2^{m}\minus{}1$ doesn't divide $ 3^{n}\minus{}1$.
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$ 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.
Find all positive integers $n$ that are quadratic residues modulo all primes greater than $n$.