Math, asked by ssvsistla, 10 months ago

1651 and 2032 use Euclid division lemma​

Answers

Answered by Anonymous
11

Step-by-step explanation:

Use euclid's division algorithm to find ... 2032 = 1651 × 1 + 381 . 381 = 127 × 3 + 0. Since the remainder becomes 0 here, so HCF of 1651 and 2032 is 127.

Answered by prabodh12
2

Answer:

it's kinda hard..use hcf

Previous Question
Next Question
Similar questions
English, 5 months ago
She danced gracefully. (Identify the tens​...
Math, 5 months ago
If 5a + 9 = -1 then find the value of a.​
English, 5 months ago
‘Look at the navel of the image,’ said the young man; and where he pointed there was a wet patch the circumference of a little coin. a. What was the criticism made by the young man? b. What was the challenge made by Jakanachari? c. Where did he point out the flaw in the statue? d. How did the stranger prove that there was a flaw in the stone?​
Hindi, 10 months ago
what is 5/7 - 4/2 ????? ​
World Languages, 10 months ago
what is Golgi bodies​...
Physics, 1 year ago
Write short notes on Data Highway Plus...
Physics, 1 year ago
Write notes on Recursive Estimation.
Physics, 1 year ago
Write short notes on : Electro-osmosis.