Euclid's Division Lemma

Euclids Division Lemma states that for any two positive integers a and b, there exists unique integers q and r such that a=bq+r , where r must satisfy.

State Euclid Division lemma

Find the HCF of the following by using Euclid Division Lemma a = bq+r, q> 0 (i) 96 and 72

Use Euclids division Lemma to show that the cube of any positive integer is either of the form 9m ,\ 9m+1 or, 9m+8 for some integer m .

Use Euclids division Lemma to show that the cube of any positive integer is either of the form 9m ,\ 9m+1 or, 9m+8 for some integer m .

Use Euclids division Lemma to show that the cube of any positive integer is either of the form 9m,9m+1 or,9m+8 for some integer m .

Real Numbers-Euclid'S Divison Lemma|Real Numbers-Euclid'S Divison Algorithm|Ncert Questions|Omr

State Euclid Division lemma.

Find the HCF of 60 and 100 by using Euclids division lemma.

Use Euclid division Lemma to show that any positive even interger is of the form 4q or 4q+2 or 4q+4 when q is some integer.