Log in to add a comment

Log in to add a comment

EUCLID'S DIVISION LEMMA:GIVEN ANY POSITIVE INTEGERS a AND b THERE EXISTS A UNIQUE INTEGERS

a=bq+r where 0 less than or equal to r less than b....

ALGORITHM IS USED FOR FINDING THE HIGHEST COMMON FACTOR OF TWO NUMBERS AND HERE WE APPLY THE STATEMENT OF EUCLID'S DIVISION LEMMA..............

HOPE IT IS USEFUL ANDDDDD PLEASEEEE!!!!!!! MARK THIS ANSWER AS A BRAINLIEST PLEASE

ALGORITHM IS A SERIES OF WELL DEFINED STEPS WHICH GIVES A PROCEDURE FOR SOLVING A TYPE OF PROBLEM......

EUCLID'S DIVISION LEMMA:GIVEN ANY POSITIVE INTEGERS a AND b THERE EXISTS A UNIQUE INTEGERS q AND r SATISFYING

a=bq+r where 0 less than or equal to r less than b....

ALGORITHM IS USED FOR FINDING THE HIGHEST COMMON FACTOR OF TWO NUMBERS AND HERE WE APPLY THE STATEMENT OF EUCLID'S DIVISION LEMMA..............

pls mark as brainel cc