#### Question

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

clickto share

#### Solution

You need to to view the solution

Is there an error in this question or solution?

#### APPEARS IN

#### Related Questions VIEW ALL [5]

#### Reference Material

Solution for question: 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 concept: Euclid’s Division Lemma. For the course CBSE