# Solution - Euclid’s Division Lemma

Account
Register

Share

Books Shortlist
ConceptEuclid’s Division Lemma

#### Question

Using Euclid's division algorithm, find the H.C.F. of (iii) 867 and 255

#### Solution

You need to to view the solution
Is there an error in this question or solution?

#### Similar questions VIEW ALL

Show that any positive integer which is of the form 6q + 1 or 6q + 3 or 6q + 5 is odd, where q is some integer.

view solution

Use Euclid's Division Algorithm to show that the cube of any positive integer is either of the 9m, 9m + 1 or 9m + 8 for some integer m

view solution

Show that every positive integer is of the form 2q and that every positive odd integer is of the from 2q + 1, where q is some integer.

view solution

Using Euclid's division algorithm, find the H.C.F. of 196 and 38220

view solution

Show that one and only one out of n; n + 2 or n + 4 is divisible by 3, where n is any positive integer.

view solution

#### Reference Material

Solution for concept: Euclid’s Division Lemma. For the course 8th-10th CBSE
S