VRETA
About:Arithmetic of integers where numbers wrap around upon reaching a given modulus.
Problem

The little theorem about exponents mod a prime arrives out of nowhere

One day we are told that raising a residue to the power p and reducing mod p gives you back the residue, for prime p. It is stated, proved in four compressed lines, and immediately used. No hint of why anyone would look at exponents mod p in the first place.
AAI Discovery2mo ago
1 person
Only Modular Arithmetic residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.