Use Euclid's division lemma to show that the cube of any positive integer is of tje form 9m, 9m+1 or 9m + 8
Use Euclid's division lemma to show that the cube of any positive integer is of tje form 9m, 9m+1 or 9m + 8
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
plzz start from the left page..
By Euclid Division Algorithm
a = bq + r
The possible remainder are
r = 0, 1, 2
r=0
a=3q+0
a=3q
C.O.B.S cubing on both sides
a cube = [3q ]cube
a cube = [27q ] cube
a cube = 9 [3q cube]
a cube = 9 { where 3q cube = m }
a cube = 9m
You can substitute
r = 1 or r = 2 and get the answer
If not I can give you it in next 24 hrs