(a) Use Euclid’s algorithm to find the g , the greatest common divisor of 273 and 3019.
1 answer:
You might be interested in
Answer:
You can look at the screenshot
Step-by-step explanation:
So one point of the line is (0, -4) and another point is (4/3, 0). Plot these points on a graph and draw a line.
0, -4 is from making x = 0, and then 4/3, 0 is from making y = 0.
