Question

Use euclids division algorithm to find the HCF of 900and270?​

Answer 1

Answer:

According to Euclid's division algorithm, for any integer a and any positive integer b, there exists unique integers q and r such that a=bq+r ( where r is greater than or equal to 0 and less than b or 0⩽r<b). We say that ais the dividend, b is the divisor, q is the quotient and r is the remainder

i hope it will be help you..