3 years ago

(a) Use Euclid’s algorithm to find the g , the greatest common divisor of 273 and 3019.

1 answer:

5 0

$3019=273\times11+16$
$273=16\times17+\underline1$
$\implies\mathrm{gcd}(3019,273)=1$

You might be interested in

katrin2010 [14]

Answer:

35.8

Step-by-step explanation:

$\frac{340.1}{9.5}$ = 358

We know that our answer can never be greater than 358 since the dividend

is 340.1 and the divisor is 9.5;

Also,

Both values are to one decimal places and we can use this to solve the problem;

9 can divide 340 in about 37 place with a remainder of 7,

So, it is appropriate to make the solution 35.8

5 0

2 years ago

yKpoI14uk [10]

10x-2x-20+4 is incorrect

5 0

3 years ago

Nataly_w [17]

The answer to the question is C.

5 0

2 years ago

weeeeeb [17]

Answer:

1 is true

2 is true

3 is true

4 0

2 years ago

Shtirlitz [24]

First option is the answer

7 0

2 years ago