query: Fermat's little theorem with the exponent smaller than the prime number
positive_passages.docid: 114346
positive_passages.text: Why is $a^{-1}$ mod $p$ equal to $a^{p-2}$ mod $p$?
negative_passages.docid: 95033
negative_passages.text: Find the remainder of a number with a large exponent
negative_passages.docid: 96062
negative_passages.text: Show $\underbrace{{111\cdots}1}_{{\small{p-1} \ 1's}}$ is divisible by $p$
negative_passages.docid: 152008
negative_passages.text: Least prime of the form $38^n+31$
negative_passages.docid: 131905
negative_passages.text: Proof for exponentiation in modular arithmetic
negative_passages.docid: 93549
negative_passages.text: Wilson and Fermat's Theorem
negative_passages.docid: 4140
negative_passages.text: Fermat's Last Theorem with negative exponent
negative_passages.docid: 87267
negative_passages.text: Conjecture similar to Fermat's Theorem.
negative_passages.docid: 95105
negative_passages.text: Solutions in complex number field, instead of $\mathbb{N}$, to Fermat's Last Theorem
negative_passages.docid: 143772
negative_passages.text: How can I algebraically prove that $2^n - 1$ is not always prime?
negative_passages.docid: 151036
negative_passages.text: arithmetic progression of primes
negative_passages.docid: 15352
negative_passages.text: How is Fermat's least time principle proven?
negative_passages.docid: 93820
negative_passages.text: Fermat's little theorem applied for $n$'th root existence $\!\bmod p$
negative_passages.docid: 63356
negative_passages.text: Can $x^{n}-1$ be prime if $x$ is not a power of $2$ and $n$ is odd?
negative_passages.docid: 76347
negative_passages.text: Shorter proof for some equvalences
negative_passages.docid: 157652
negative_passages.text: Fermat's Last Theorem for Gaussian Integers (excluding the integers or  same pure imaginaries)
negative_passages.docid: 27069
negative_passages.text: sum of all positive integers less than $n$ and relatively prime to $n$