Mathematics of Cryptography
... answers in which both x and y are nonnegative integers). We divide both sides by 5 to get 4x + y = 20. We then solve the equation 4s + t = 1. We can find s = 0 and t = 1 using the extended Euclidean algorithm. The particular solutions are x0 = 0 × 20 = 0 and y0 = 1 × 20 = 20. The general solutions w ...
... answers in which both x and y are nonnegative integers). We divide both sides by 5 to get 4x + y = 20. We then solve the equation 4s + t = 1. We can find s = 0 and t = 1 using the extended Euclidean algorithm. The particular solutions are x0 = 0 × 20 = 0 and y0 = 1 × 20 = 20. The general solutions w ...