Math, asked by pandu6141, 10 months ago

use Euclid's algorithm to find the HCF of (i) 1651 and 2032

Answers

Answered by Gunjan1256

0

Step-by-step explanation:

using Euclid division lemma =

a=bq+r

we divide till no. that remainder comes not 0

Attachments:

Previous Question

Next Question

Similar questions

Biology, 4 months ago

Assertion: The stomatal pores open during the day and close during the night. Reason: Photosynthesis takes place during the day.

Math, 4 months ago

वंडर ऑफ साइंस हिंदी में ...

English, 4 months ago

My brother is quicker _______ my sister in solving crossword puzzle. Fill in the blank with correctlinker. a. then b. than c. but ...

Science, 10 months ago

paracute fabric is made of ...

Math, 10 months ago

Sum of the digits of a two-digit number is 5. When we interchange the digits, it is found that the resulting new number is less than the original number by 27. What is the two-digit number?

Math, 1 year ago

1) the sum of exterior angles of a octagon is_________ 2) find the sum of interior angles of an 11 sided polygon?

English, 1 year ago

Write a speech on the topic: Being a good student-A challenge Please do it... It's urgent.

Chemistry, 1 year ago

Ratio of radii of 3rd orbit of Life +2 is...