use Euclid division Lemma to show that the square of any positive integer is either the form of 3M or 3M +1 for some integer m
with process
biswajitbaruah1977:
hi
Answers
Answered by
1
Answer:
Let 'a' be any positive integer. On dividing it by 3 , let 'q' be the quotient and 'r' be the remainder. Therefore , the square of any positive integer is either of the form 3m or 3m+1. Use Euclid division lemma to show that the square of any positive integer is either of the form 3m or 3m+1 for some integer m
Answered by
2
Answer:
Let 'a' be any positive integer. On dividing it by 3 , let 'q' be the quotient and 'r' be the remainder. Therefore , the square of any positive integer is either of the form 3m or 3m+1. Use Euclid division lemma to show that the square of any positive integer is either of the form 3m or 3m+1 for some integer m.
Similar questions
English,
5 months ago
English,
10 months ago
Computer Science,
1 year ago
Chemistry,
1 year ago
History,
1 year ago