Question

use euclid's division algorithm to show the square of any positive integer is either of form 2m or 2M + 1 for some integer m​

Answer 1

Answer:

The answer is 54.........

Answer 2

Step-by-step explanation:

hope it will helps you.......