Question

जब तुम पढ़ रहे थे तब मैं खेल रहा था (संयुक्त वाकया में बदलिये)


कृपया स्पैम न करे||​

Answer 1

Answer:

Euclid's 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 .

$\huge\mathcal{\underline{\underline{thanks\:siso\:for\:writing\:bio\:☺}}}$