Exam (elaborations)
CS6515 - Exam 2 Algorithms questions and answers
- Course
- Institution
Equivalence - ANSWER-"x ≡ y (mod N) means that x/N and y/N have the same remainder a ≡ b (mod N) and c ≡ d (mod N) then: a + c ≡ a + d ≡ b + c ≡ b + d (mod N) a - c ≡ a - d ≡ b - c ≡ b - d (mod N) a ** c ≡ a ** d ≡ b ** c ≡ b ** d (mod N) ka ≡ kb (mod N) for any inte...
[Show more]