Home
Class 12
MATHS
Use Euclid's algorithm to establish that...

Use Euclid's algorithm to establish that (i) every odd integer is of the form `4k+1` or `4k+3`. (ii) the square of any integer is either of the form `3k` or `3k +1` (iii) the cube of any integer is of the from `9k`, `9k+ 1` or `9k+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 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 square of any positive integer is either of the form 3m or 3m + 1 for some integer m.

Use Euclid's division lemma to show that the square of any positive integer is either of the form 3m or 3m + 1 for some integer m.