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 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.

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 Euclids division Lemma to show that the cube of any positive integer is either of the form 9m,9m+1 or,9m+8 for some integer m .

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

Use Euclids division Lemma to show that the cube of any positive integer is either of the form 9m ,\ 9m+1 or, 9m+8 for some integer m .

Use Euclids division Lemma to show that the cube of any positive integer is either of the form 9m ,\ 9m+1 or, 9m+8 for some integer m .

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

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.

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

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