Euclid Division lemma

Using Eulids division lemma, show that the cube of any positive integer is of the form 9m , or ( 9m+1) or ( 9m+8) for some integer m.

Euclid's Division Lemma

Apply Euclid's division lemma with number 124 and 24.

Real Numbers|Fundamental Theorem Of Arithmetic|Euclid's Division Lemma|Irrational Numbers

Find the HCF of 726 and 275 by using Euclid's division lemma.

Classification Of Real Numbers|Euclid's Division Lemma|Questions|Euclid's Division Algorithm|Questions|Summary

Example based on euclid's division lemma||The fundamental Theorem OF Arithmetic|| Prime Factorization|| Factor Tree

Euclid's division lemma || Algorithm to find H.C.F || Example-1,2,3,4 ||Exemplar solved example

Introduction || Classification OF number || Real number || Prime || Composite || Prime triplet || Rational number || Terminating decimal || Non- terminating decimal || Euclid's division lemma

Use Euclid's division lemma to show that the square of any positive integer is either of the form 3m or 3m + 1 for some integer m.