shaalaa.com
S

Solution - Euclid’s Division Lemma

Account
User


Login
Register


      Forgot password?
Share
Notifications

View all notifications
Books Shortlist
Your shortlist is empty

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?

Similar questions VIEW ALL

An army contingent of 616 members is to march behind an army band of 32 members in a parade. The two groups are to march in the same number of columns. What is the maximum number of columns in which they can march?

view solution

Show that one and only one out of n; n + 2 or n + 4 is divisible by 3, where n is any positive integer.

view solution

 Show that any positive odd integer is of the form 4q + 1 or 4q + 3, where q is some integer.

view solution

Using Euclid's division algorithm, find the H.C.F. of (iii) 867 and 255

view solution

Show that any positive integer which is of the form 6q + 1 or 6q + 3 or 6q + 5 is odd, where q is some integer.

view solution

Content BooksVIEW ALL [1]

Reference Material

Solution for concept: Euclid’s Division Lemma. For the course 8th-10th CBSE
S