Question

using Euclid division algorithm,show that cube of 37 is of the form 9m+1 where m is some integer

Answer 1

Step-by-step explanation:

Use Euclid's division lemma to show that cube of any positive integer is either of the form 9m, 9m + 1 or 9m + 8 for some integer 'm'. a3=(3q)3=27q3=9(3q3)=9m where m=3q3 and 'm' is an integer. where m=3q3+3q2+q and 'm' is an integer. 9m+8, where m=3q3+6q2+4q and m is an integer.

like this answer

and follow me

Answer 2

Answer:

Use Euclid's division lemma to show that cube of any positive integer is either of the form 9m, 9m + 1 or 9m + 8 for some integer 'm'. a3=(3q)3=27q3=9(3q3)=9m where m=3q3 and 'm' is an integer. where m=3q3+3q2+q and 'm' is an integer. 9m+8, where m=3q3+6q2+4q and m is an integer.

hope this helped you