What is that??????????????
Answer:
1. gcd(77,30)=1
Since 1 is the last non zero remainder appearing in these equations then, 1 is the gcd of 77 and 30.
2. u=-11, v=18
Using the Euclidean Algorithm we have that
Now, we express the remainder as linear combinations of 49 and 30.
Then 
3. x=18
If 
then
for some 
.
Then, if k=7,
Answer:
x = 25
Step-by-step explanation:
Given
x - 5 = 20 ( isolate x by adding 5 to both sides )
x = 25
Answer:
x=-19
y=55
Step-by-step explanation:
y=-3x-2.
5x+2y=15
substitute y into 5x+2y =15
5x +2 (-3x-2) = 15
distribute
5x -6x-4 = 15
combine like terms
-x-4 =15
add 4 to each side
-x-4+4 = 15+4
-x=19
multiply by -1
x = -19
now lets find y
y= -3x-2
y = -3(-19) -2
y = 57-2
y =55
Answer:
57
Step-by-step explanation:
the smallest angle
