Question: discrete math linear congruence 1. Use the Extended Euclidean Algorithm to nd 6. = gcd{85,210) and write (I as an integer combination of a. =
discrete math
linear congruence

1. Use the Extended Euclidean Algorithm to nd 6. = gcd{85,210) and write (I as an integer combination of a. = 35 and n = 210. (i) Use this to mlve the following linear congruence. 85:: E 115 (mod 210}. (ii) How many distinct solutions are there to 35::1T5 in 3/210? List. all the mlutiomi, writing each as E where II} E'- e
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
