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

40 views

closed

Use Euclid’s division lemma to show that the cube of a 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.

+1 vote
by (38.0k points)
selected

Let ‘a’ be positive integer. Then from Euclidean lemma a = bq + r;

now consider b = 9 then 0 ≤ r < 9, it means remainder will be 0, or 1, 2, 3, 4, 5, 6, 7, or 8

So a = bq + r

⇒ a = 9q + r (for b = 9)

now cube of a = a3 + (9q + r)3

= (9q)3 + 3.(9q) 3r + 3. 9q.r + r 3

= 93q3 + 3.92 (q2r) + 3.9(q.r) + r 3

= 9[92.q+ 3.9.q2 r + 3.q.r] + r3

a3 = 9m + r3 (where ‘m’ = 92 q3 + 3.9.q2r + 3.q.r)

if r = 0 ⇒ r3 = 0 then a3 = 9m + 0 = 9m

and for r = 1 ⇒ r3 = l3 then a3 = 9m + 1

and for r = 2 ⇒ r3 = 23 then a3 = 9m + 8

for r = 3 ⇒ r3 , = 33 ⇒ a3 = 9m + 27 = 9(m) where m = (9m +3)

for r = 4 ⇒ r3 = 43 ⇒ a3 = 9m + 64 = (9m + 63) + 1 = 9m + 1

for r = 5 ⇒ r3 = 125 ⇒ a3 = 9m + 125 = (9m + 117) + 8 = 9m + 8

for r = 6 ⇒ r3— 216 ⇒ a3 = 9m + 216 = 9m + 9(24) = 9m

for r = 7 ⇒ r3 = 243

⇒ a3 = 9m + 9(27) = 9m

for r = 8 ⇒ r3 = 512

⇒ a3 = 9m + 9(56) + 8 = 9m + 8

So from the above it is clear that a3 is either in the form of 9m or 9m + 1 or 9m + 8.

Hence proved.