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.
Answers
Answered by
1
Step-by-step explanation:
in place of m there is q that's it
Attachments:
![](https://hi-static.z-dn.net/files/d16/177128164b02d6c9dd022977965e1bda.jpg)
![](https://hi-static.z-dn.net/files/d65/4fd6ab34162c258808eb49d07f5542c6.jpg)
Answered by
35
Answer:
✒️Let 'a' be any positive integer.
✒️On dividing it by 3 , let the 'q' be the quotient and 'r' be the remainder.
Such that
a = 3q + , where r = 0, 1, 2
When, r = 0
a = 3q + 0 ---------- (1)
When, r = 1
a = 3q + 1 ----------- (2)
When r = 2
a = 3q + 2 ------------ (3)
So ,
(1) when, a = 3q + 0
a = 3q
By squaring both side
By taking common
(2) When, a = 3q + 1
By squaring both side
By taking common
(3) When, a = 3q + 2
By squaring both side
By taking common
✏️Therefore , the square of any positive integer is either of the form of 3m or 3m + 1
Similar questions
Math,
6 months ago
History,
6 months ago
Math,
6 months ago
Math,
1 year ago
Business Studies,
1 year ago