# 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.

4.3k views
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.

by (95.9k points)
selected

Then by Euclid's Division algorithm, corresponding to the positive integers a and 3 there exist non-negative integers q and r such that