1.

State Euclid\'s division algorithm theorem

Answer» U r wlcm
It is related to divisibility of integers.Ex-25 is divided by 8,quotient is 3 and remainder is 1.25=8*3 +1. a= 25 b=8 q=3 and r= 1a=bq +r where 0It is technique to complete the hcf of two given positive integer , say a and b with a is grater than b ..


Discussion

No Comment Found