Chazmo
Chazmo Chazmo
  • 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 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

A teenagers heart pumps an average of 7200L or blood every 24 hours. What is the rate of change of volume of blood
Tapiwa raked 5% more leaves than Adam raked. Together they raked 697 liters of leaves. How many liters of leaves did Adam rake?
How many credits do you need to graduate high school in new jersey?
A deck of cards is randomly dealt by the computer during a game of spider solitaire. find the probability (as a reduced fraction) the first card dealt is part
Explain how the imperfect is used to talk about the past.
How are renaissance and the baroque different music?
list of primary arguments of the critics and defenders of the constitution
Where there is asymmetric information between buyers and sellers:?
What is a not a way humans have directly impaxted coral reefs?
prejudice would be an example of what factors affecting wages? a. supply b. government laws c. social attitudes d. education