Home
Class 11
MATHS
[" 15.Use Euclid's Division Aligorithm t...

[" 15.Use Euclid's Division Aligorithm to show that the cube of any positive "],[" integer is either of the forin "9q,9q+1" or "9q+8" ."]

Promotional Banner

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

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.

Use division algorithm to show that the cube of any positive integer is of the form 9 m, 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 .