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: 37

Let $p$ be an odd prime of the form $p=4n+1$. [list=a][*] Show that $n$ is a quadratic residue $\pmod{p}$. [*] Calculate the value $n^{n}$ $\pmod{p}$. [/list]
Determine all positive integers $n$ such that $ xy+1 \equiv 0 \; \pmod{n} $ implies that $ x+y \equiv 0 \; \pmod{n}$.
Let $n$ be a positive integer. Prove that $n$ is prime if and only if \[{{n-1}\choose k}\equiv (-1)^{k}\pmod{n}\] for all $k \in \{ 0, 1, \cdots, n-1 \}$.
Show that $1994$ divides $10^{900}-2^{1000}$.
Inside the convex pentagon $ABCDE$, a point $O$ was chosen, and it turned out that all five triangles $AOB$, $BOC$, $COD$, $DOE$ and $EOA$ are congrunet to each other. Prove that these triangles are isosceles or right-angled.
Consider a prime number $p\geqslant 11$. We call a triple $a,b,c$ of natural numbers [i]suitable[/i] if they give non-zero, pairwise distinct residues modulo $p{}$. Further, for any natural numbers $a,b,c,k$ we define \[f_k(a,b,c)=a(b-c)^{p-k}+b(c-a)^{p-k}+c(a-b)^{p-k}.\]Prove that there exist suitable $a,b,c$ for which $p\mid f_2(a,b,c)$. Furthermore, for each such triple, prove that there exists $k\geqslant 3$ for which $p\nmid f_k(a,b,c)$ and determine the minimal $k{}$ with this property. [i]Călin Popescu and Marian Andronache[/i]
Characterize the set of positive integers $n$ such that, for all integers $a$, the sequence $a$, $a^2$, $a^3$, $\cdots$ is periodic modulo $n$.
Determine all positive integers $n \ge 2$ that satisfy the following condition; For all integers $a, b$ relatively prime to $n$, \[a \equiv b \; \pmod{n}\Longleftrightarrow ab \equiv 1 \; \pmod{n}.\]
Determine the smallest number N, multiple of 83, such that N^2 has 63 positive divisors.
Determine the number of integers $n \ge 2$ for which the congruence \[x^{25}\equiv x \; \pmod{n}\] is true for all integers $x$.
Let $p$ be a prime number. Determine the maximal degree of a polynomial $T(x)$ whose coefficients belong to $\{ 0,1,\cdots,p-1 \}$, whose degree is less than $p$, and which satisfies \[T(n)=T(m) \; \pmod{p}\Longrightarrow n=m \; \pmod{p}\] for all integers $n, m$.
The angles of one quadrilateral are equal to the angles another quadrilateral. In addition, the corresponding angles between their diagonals are equal. Are these quadrilaterals necessarily similar?