Use the euclidean algorithm to calculate gcd(259, 621) and gcd(108, 156).

The gcd(259, 621) = 1 and gcd(108, 156) = 12

Step-by-step explanation:

The Euclidean algorithm solves the problem:

Given integers a, b, find d = gcd(a,b)

These are the steps of the Euclidean algorithm:

These are the steps for the division algorithm:

To find the greatest common divisor of 621 and 259 by the Euclidean algorithm you need to:

next you need to write the expression

The greatest common divisor of 621 and 259 is 1

To find the greatest common divisor of 156 and 108 by the Euclidean algorithm you need to:

The greatest common divisor of 156 and 108 is 12

only 10/60 isn't equivalent

hope this : )

x = ±sqrt(10)

step-by-step explanation:

5 - 2x² = -15

subtract 5 from each side

5-5 - 2x² = -15-5

-2x^2   = -20

divide by -2 on each side

-2x^2   /-2= -20/-2

x^2 =10

take the square root on each side

sqrt(x^2 )=±sqrt(10)

x = ±sqrt(10)

check:

5 - 2x² = -15

+sqrt(10)

5 - 2(sqrt(10))² = -15

5 -2(10) = -15

5 -20 = -15

-15 = -15

-sqrt(10)

5 - 2(-sqrt(10))² = -15

5 -2(10) = -15

5 -20 = -15

-15 = -15