UniversityComputingTruth tables, Bézout coefficients and modular exponentiation15–20 min
Logic and Number Theory
Evaluate logical formulas with truth tables, find Bézout coefficients and modular inverses with the extended Euclidean algorithm, and carry out binary modular exponentiation.
Notice, currentExplain, nextApply, next
0 points
The experiment opens when it comes into view.
Theory and model assumptions
Evaluate logical formulas with truth tables, find Bézout coefficients and modular inverses with the extended Euclidean algorithm, and carry out binary modular exponentiation.
Teacher guidance
University, Discrete Mathematics
Expected time: 15–20 minutes.