Question

Use Euclid's division algorithm to show that the cube of any positive integer is in the form of 4m, 4m+1 ,4m+3​

Answer 1

Answer:

Solution: Let a be the positive integer and b = 4. Then, by Euclid's algorithm, a = 4q + r for some integer q ≥ 0 and r = 0, 1, 2, 3 because 0 ≤ r < 4. So, a = 4q or 4q + 1 or 4q + 2 or 4q + 3.25-Nov-2017