euclid division lemma class 10

Euclid's Division Lemma

Proof of Euclid 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.

Use Euclid's division lemma to show that the cube of any positive integer is of the form 9m ,9m+1 or 9m+8 .

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

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

Find the HCF of the following using Euclid division lemma 135 And 225

Discussion OF Work sheet-3||Euclid's division lemma or algorithm||Example||H.C.F., Using euclid division lemma finding H.C.F.|| Factor method||Prime factor method||Example

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