Use Euclids division lemma to show that ...

Use Euclids division lemma to show that the cube of positive integer is of the form `9m,9m+1 or 9m+8.`
(OR)
Show that the cube of any positive integer is of form `9m or 9m+1 or 9m+8`, where m is an integer.

Similar Questions

Explore conceptually related problems

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

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

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

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

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

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

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

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

Use Euclid's division lemma to show that the square of any positive integer is of the form 3p, 3p+1.

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