Back
Next
(Choose 1 answer)
Finish the e
exam.
Explain the concept of congruence modulo n and its significance in encryption algorithms like Caesar cipher.
Which of the following best describes congruence modulo n?
A. Two numbers are congruent modulo n if their difference is divisible by n
B. Two numbers are congruent modulo n if they are both prime numbers
C. Two numbers are congruent modulo n if their product is divisible by n
D. Two numbers are congruent modulo n if they can be both divided by n without a remainder
