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 interger m.
Answers
Answered by
3
Let the positive integer be of the form n=3q or n=3q+1
(3q)^2= 9q^2
(3q+1)^2= 9q^2+6q+1
=3(3q+2q) +1
Where m=3q+2q
(3q)^2= 9q^2
(3q+1)^2= 9q^2+6q+1
=3(3q+2q) +1
Where m=3q+2q
Answered by
0
Heyaa..
According to Euclid's Division Lemma,
So when comparing to the question, we get, b = 3 and q = m...
Now applying the values of b and q in lemma, we get
-----------------eqn 1
From this, we get ' r ' values as,
r = 0, 1, 2
So by taking square of these integers,
#
#
#
Now, applying the values of r in eqn 1,
=>
=>
=> ( But it is not possible in this case since it does not oby the rule of 0 r < b ) ( Here b > r )
So, we can get that the square of every positive integers is of the form,
=>
=>
Hope it helps...
And here CutieBarbie :)
According to Euclid's Division Lemma,
So when comparing to the question, we get, b = 3 and q = m...
Now applying the values of b and q in lemma, we get
-----------------eqn 1
From this, we get ' r ' values as,
r = 0, 1, 2
So by taking square of these integers,
#
#
#
Now, applying the values of r in eqn 1,
=>
=>
=> ( But it is not possible in this case since it does not oby the rule of 0 r < b ) ( Here b > r )
So, we can get that the square of every positive integers is of the form,
=>
=>
Hope it helps...
And here CutieBarbie :)
Similar questions