real numbers - J K Online Classes

Euclid’s Division Lemma question| Finding HCF and representing it in 1190m and 1445n

Question : Use Euclid’s algorithm to find the HCF of 1190 and 1445. Express the HCF in the form 1190m + 1445n. Solution: First

Question : Using Euclid’s Division Lemma, show that the square of any positive integer is either of the form 3m or (3m + 1)