Math, asked by khushigadhavi, 10 months ago

use Euclid algorithm to find the HCF of 963 555 and 657​

Answers

Answered by Anonymous
4

Answer:

Step-by-step explanation:

to find the HCF of 657 and 963, we will use Euclid's division Lemma, 963 = 657*1+306. since the remainder is not equal to zero, we will again apply Euclid's division Lemma. 657 = 306*2+ 45.

Plz mark me the brainliest....

Answered by purvigupta58
1

Step-by-step explanation:

i hope you like this answer and please if you like please make me brainlist

Attachments:
Similar questions