01-11-2017
Mathematics

contestada

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

Respuesta :

LammettHash LammettHash

03-11-2017

[tex]3019=273\times11+16[/tex]
[tex]273=16\times17+\underline1[/tex]
[tex]\implies\mathrm{gcd}(3019,273)=1[/tex]

Answer Link

Otras preguntas

If 4 times a number is 156, then 1/3 of the number is

If the pattern in the table is extended to represent more equivalent ratios for 2:6, which pair of numbers would be in the columns? A multiplication table. In t

why did the aryans use the caste system in India

What happens to the density of a material if you have a larger piece of it?(1 point)

A mountaineer shouts for help Half a second later (0.5 she hears the echo How far away is the rock face which is reflecting her voice (take the speed of sound t

most of the land that central pacific crossed was flat. • true • false

5 3/4 i don't know how to solve this

Solve: 5^3 a 125 b 25 c 15 d 5

Andre collected data on the length, in minutes, of some films. This is a histogram summarizing his data. How many films are in Andre’s data set? Describe the

what is 16÷8+5×2 explain steps, evaluate the expression