query: A quadratic residue equality proof
positive_passages.docid: 148970
positive_passages.text: How to calculate such sums of Legendre symbols?
negative_passages.docid: 64742
negative_passages.text: Prove a residue matrix $A$ (with coefficients in $\mathbb Z_n)$ has an inverse if and only if $\gcd(\det A,n) = 1$
negative_passages.docid: 68421
negative_passages.text: Residue theorem with $\frac{1}{2\pi}\int_{0}^{2\pi}e^{\cos\theta}\cos(n\theta) d\theta$.
negative_passages.docid: 2315
negative_passages.text: How to prove that $\lVert x + y\rVert = \lVert x\rVert + \lVert y \rVert \implies \lVert tx + (1-t)y\rVert = t\lVert x\rVert + (1-t)\lVert y \rVert$?
negative_passages.docid: 145447
negative_passages.text: bilinear form - proof
negative_passages.docid: 153647
negative_passages.text: Elementary number theory and quadratic
negative_passages.docid: 146053
negative_passages.text: Proving identities (mod $pq$) using Fermat's little theorem?
negative_passages.docid: 34323
negative_passages.text: Prove that $a^{(p-1)/2} \equiv 1$ (mod p) and $a^{(p-1)/2} \equiv -1 \pmod p$
negative_passages.docid: 68275
negative_passages.text: Primitive Root Theorem Proof
negative_passages.docid: 64453
negative_passages.text: Prove if $(a,p)=1$, then $\{a,2a,3a,...,pa\}$ is a complete residue system modulo $p$.
negative_passages.docid: 29979
negative_passages.text: When is $-3$ a quadratic residue mod $p$?
negative_passages.docid: 72551
negative_passages.text: Proof that $\rho = \pm1$ implies linear combination
negative_passages.docid: 99316
negative_passages.text: Multivariate Residue Theorem?
negative_passages.docid: 73238
negative_passages.text: Show that $a^{q-1} \equiv 1 \pmod{pq}$
negative_passages.docid: 110703
negative_passages.text: How Can I prove (a+b) mod m = (a mod m) + (b mod m)) mod m?
negative_passages.docid: 65783
negative_passages.text: Proving: "The trace of an idempotent matrix equals the rank of the matrix"
negative_passages.docid: 29231
negative_passages.text: Proof of : $x^{n}\equiv x^{\varphi(m)+[n \bmod \varphi(m)]} \mod m$