Question

using euclid division lemma algorthim find hcf of 2048 and960​

Answer 1

Step-by-step explanation:

please make me as brainllist

Answer 2

HERE IS YOUR ANSWER MATE......;

REFFER THE ATTACHMENT ✔️✔️

• Extra Information :-

• Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. HCF of two positive integers a and b is the largest positive integer d that divides both a and b.

• So, according to Euclid's Division Lemma, if we have two positive integers a and b, then there would be whole numbers q and r that satisfy the equation: a = bq + r, where 0 ≤ r < b. a is the dividend. b is the divisor. q is the quotient and r is the remainder.

HOPE IT'S HELPFUL....:-)