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.
Solution : By Euclid’s Division Algorithm, we have a = bq + r …………..(i) On putting b = 3 in (1), we get a = 3q + r, [0 \(\le\) r < 3] If r = 0 a = 3q \(\implies\) \(a^2\) = \(9q^2\) …