# Solution - Use Euclid's Division Algorithm to show that the square of any positive integer is either of the form 3m or 3m + 1 for some integer m. - Euclid’s Division Lemma

Account
Register

Share

Books Shortlist
Your shortlist is empty
ConceptEuclid’s Division Lemma

#### Question

Use Euclid's Division Algorithm to show that the square of any positive integer is either of the form 3m or 3m + 1 for some integer m.

#### Solution

You need to to view the solution
Is there an error in this question or solution?

#### Reference Material

Solution for question: Use Euclid's Division Algorithm to show that the square of any positive integer is either of the form 3m or 3m + 1 for some integer m. concept: Euclid’s Division Lemma. For the course CBSE
S