###### Advertisements

###### Advertisements

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

###### Advertisements

#### Solution

Let **a** and **b** be two positive integers such that **a** is greater than **b**; then:

**a = b**q + r; where q and r are positive integers and 0 ≤ r < b.

Taking b = 3, we get:

a = 3q + r; where 0 ≤ r < 3

⇒ Different values of integer **a** are 3q, 3q + 1 or 3q + 2.

**Cube of 3q** = (3q)^{3} = 27q^{3} = 9(3q^{3}) = 9m; where **m** is some integer.

**Cube of 3q + 1** = (3q + 1)^{3}

= (3q)^{3} + 3(3q)^{2} x 1 + 3(3q) x 1^{2} + 1^{3}

[Q (q + b)^{3} = a^{3} + 3a^{2}b + 3ab^{2} + 1]

= 27q^{3} + 27q^{2} + 9q + 1

= 9(3q^{3} + 3q^{2} + q) + 1

= **9m + 1**; where m is some integer.

**Cube of 3q + 2** = (3q + 2)^{3}

= (3q)^{3} + 3(3q)^{2} x 2 + 3 x 3q x 2^{2} + 2^{3}

= 27q^{3} + 54q^{2} + 36q + 8

= 9(3q^{3} + 6q^{2} + 4q) + 8

= **9m + 8**; where m is some integer.

Cube of any positive integer is of the form 9m or 9m + 1 or 9m + 8.

**Hence the required result.**

#### APPEARS IN

#### RELATED QUESTIONS

Show that one and only one out of n; n + 2 or n + 4 is divisible by 3, where **n** is any positive integer.

What is the largest number that divides 626, 3127 and 15628 and leaves remainders of 1, 2 and 3 respectively.

The HCF of two numbers is 18 and their product is 12960. Find their LCM.

Find the simplest form of `1095 / 1168` .

Express each of the following as a rational number in its simplest form:

(i) `0. bar (24)`

What do you mean by Euclid’s division algorithm.

The HCF to two numbers is 16 and their product is 3072. Find their LCM.

What is the smallest number that, when divided by 35, 56 and 91 leaves remainders of 7 in each case?

Prove that following numbers are irrationals:

Find all positive integers, when divided by 3 leaves remainder 2

Prove that the product of two consecutive positive integers is divisible by 2

If d is the Highest Common Factor of 32 and 60, find x and y satisfying d = 32x + 60y

A positive integer, when divided by 88, gives the remainder 61. What will be the remainder when the same number is divided by 11?

Prove that two consecutive positive integers are always co-prime

Euclid’s division lemma states that for positive integers a and b, there exist unique integers q and r such that a = bq + r, where r must satisfy

Using Euclid’s division lemma, if the cube of any positive integer is divided by 9 then the possible remainders are

Prove that n^{2} – n divisible by 2 for every positive integer n

When the positive integers a, b and c are divided by 13 the respective remainders is 9, 7 and 10. Find the remainder when a b + + 2 3c is divided by 13

Show that 107 is of the form 4q +3 for any integer q

Show that the square of any positive integer cannot be of the form 5q + 2 or 5q + 3 for any integer q.