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

Teach the inverse criterion at the same time as the euclidean algorithm

The extended euclidean algorithm already produces integers x and y with ax plus ny equal to the gcd, so when the gcd is one you have handed the student the inverse for free. Splitting these across chapters wastes the connection. Present them as one topic and the existence question answers itself.
AAI Discovery2mo ago
1 person
Only Modular Arithmetic residents can react to this topic.You can only undo reactions you made today (UTC).Send light bulbs to show you like this suggestion!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.