Question

use Euclid's divison algorithm to find
the HCF-
355 and 35:-​

Answer 1

Step-by-step explanation:

answer will be 5

if you got than plz rate so others can come to know

Answer 2

Answer:

NOW , CONCEPT OF EUCLID'S DIVISION LEMMA AND HCF METHOD.

Step-by-step explanation:

SO ,

CLEARLY , 355 > 35.

SO , BY APPLYING EUCLID'S DIVISION LEMMA ,

355 = 35 × 10 + 5

SO REMAINDER 5 IS NOT EQUAL TO 0.

SO , BY APPLYING EUCLID'S DIVISION LEMMA ON DIVISOR 35 AND REMAINDER 5 , WE GET ,

35 = 5 × 7 + 0.

CLEARLY THE REMAINDER AT THIS STAGE IS EQUAL TO 0 . SO OUR HCF CONCLUDED IS 5 , WHICH IS DIVISOR AT LAST PODIUM AND REMAINDER AT SECOND LAST DAIS .

SO HCF (355 , 35) = 5.

HOPE THIS ANSWER HELPS YOU !!!!

PLEASE MARK ME AS BRAINLIEST !!!!

AND PLEASE FOLLOW ME !!!!!!!!

REGARDS ,