query: transition from multiplicative order to Fermat's little theorem
positive_passages.docid: 4972
positive_passages.text: Mod of numbers with large exponents [modular order reduction]
negative_passages.docid: 107726
negative_passages.text: Why sum of two little "o" notation is equal little "o" notation from sum?
negative_passages.docid: 155812
negative_passages.text: A Fermat's FLT look-like for matrices.
negative_passages.docid: 146053
negative_passages.text: Proving identities (mod $pq$) using Fermat's little theorem?
negative_passages.docid: 148260
negative_passages.text: Polylogarithms of negative integer order
negative_passages.docid: 144017
negative_passages.text: How to find the smallest $n$ such that $n^a\equiv 1 \pmod p$
negative_passages.docid: 3632
negative_passages.text: Basic number theory proofs
negative_passages.docid: 157652
negative_passages.text: Fermat's Last Theorem for Gaussian Integers (excluding the integers or  same pure imaginaries)
negative_passages.docid: 77351
negative_passages.text: How to use Fermat's little theorem to find $50^{50}\pmod{13}$?
negative_passages.docid: 102398
negative_passages.text: Help deriving that $\mathrm{sign} : S_n\to \{\pm 1\}$ is multiplicative
negative_passages.docid: 32136
negative_passages.text: How to prove Lucas's Converse of Fermat's Little Theorem without using primitive root?
negative_passages.docid: 52774
negative_passages.text: Computing an infinite sum using the Residue theorem
negative_passages.docid: 4140
negative_passages.text: Fermat's Last Theorem with negative exponent
negative_passages.docid: 8434
negative_passages.text: Order of $\mathbb{Z}[i]/(1+i)$
negative_passages.docid: 15187
negative_passages.text: Integer reciprocals in arithmetic progression
negative_passages.docid: 41789
negative_passages.text: Fermat's theorem on sums of two squares
negative_passages.docid: 119891
negative_passages.text: Divisibility and the Fibonacci sequence