Use division algorithm to show that the square of any positive integer is of the form 3p or 3p + 1.

Show that the square of any positive integer is of the form 5 m or 5 m pm 1.

Use division algorithm to show that the cube of any positive integer is of the form 9 m, 9m + 1 or 9m + 8.

Use Euclid’s division lemma to show that the square of any positive integer is either of the form 3m or 3m.+ 1 for some integer m.

Show that the square of any positive integer is of the form 4m or 4m + 1 for some integer m.

Use Euclid’s division lemma to show that the cube of any positive integer is of the form 9m, 9m + 1 or 9m + 8.

Use division algorithm to show that any positive odd integer is of the form 6q + 1, or 6q + 3 or 6q + 5, where q is some integer

Show that the square of an odd positive integer is of the form 8m + 1, for some whole ? number m.

Show that the square of an odd positive c integer is of the form 6q + 1 or 6q + 3 for some integer q.

If the square of any positive integer a is divided by 6, the remainder cannot be

Show that the square of any positive integer cannot be of the form 6m + 2 or 6m + 5 for ? some integer m.