If a ≡ b (mod n) then; A. n | a . b B. n | a + b C. a | b D. n | a – b View AnswerD. n | a – b Related MCQs A number P>1 is prime iff: Other name of G.C.D algorithm is: aΦ(h1)≡ 1 (mod m) is called: A partial sum of Taylor’s series is called: G.C.D of 6 and 0 is :
