The scheme where you can find the greatest common divisor of two integers by repetitive application of the division algorithm is
1 answer:
Answer:
False
Step-by-step explanation:
Euclidean Algorithm is the algorithm that allows us to find the greatest common divisor (gcd) of two integers by repetitive application of the division algorithm.
A division algorithm is an algorithm which, given two integers N and D, computes their quotient and/or remainder.
Quotient and/or Remainder =
You might be interested in
Answer:
Step-by-step explanation:
You would first have to plug in for x, (which is already given). After plugging in for x, you would need to solve the equation to get y.
Once you have both x and y, you will have your (x,y)
For example: (given x value = -5)
so:
x = -5
y = -14
( -5, -14)