Math, asked by Hariharan12949, 11 months ago

By using Euclids algorithm find the largest number which divides 650 and 1170,

Answers

Answered by Aaqibsidd

3

Answer:

1170 = 650*1+520

650 = 520*1+130

520 = 130*4+0

hence remainder here is 0 130 is HCF of 1170 and 650

Answered by Pynbiang12

3

Answer:

Your answer is 130.

Mark this as brainlist.

Attachments:

Previous Question

Next Question

Similar questions

Science, 5 months ago

it is connected with the management...

English, 5 months ago

6. Fill the the blanks with suitable prepositions:- 2 a) We can go ___ the river. (in/into) b) He was fond ____ movies. (of/for) c) Don’t laugh ____ the poor fellow. (an/at) d) He has applied ___ this post. (to/for) Q7. Fill in the blanks with suitable conjunctions: 2 a) I didn’t go to the show ____ I had already seen it. (as/so) b) Keep the food covered ____ the flies will contaminate it.

English, 5 months ago

collect different leaves from the park or garden and paste them in the space given below also write the names of the tree they belong to.

English, 11 months ago

As long as I can remember, Sophie has been always good at english is it correct...

English, 11 months ago

You have purchased a LG TV from Nirag electronics. write a letter of complaint to the manager about the non working of the TV in request for a refund or replace...

Math, 1 year ago

how to construct incircle with steps...

Science, 1 year ago

if x/y +y/x = -1 where x,y ≠ 0 then find the value of x³- y³.do it fast...

Math, 1 year ago

what is (2underoot5 square...