show that cube of any integer can be expressed in one the form 9k,9k+1,9k+8
Answers
Answered by
10
Answered by
7
Let the a be any positive integer when divided by 9 gives "q" as quoteint and "r" as remainder.
Then,by using Euclid division lemma
Case :- 1 ,when r = 0
Cubing on both side,
Case 2 ,when r = 1
Cubing on both sides
for some integer ,k
Case 3, when r=2,
Cubing on both sides ,
for some integer k,
hence,the cube of every positive integer can be expressed in the form of 9k , 9k+1, 9k+8 for some integer k.
Similar questions