CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Use Euclid's division lemma to show that the square of any positive integer is either of the form 3mor3m+1 for some integer m.


Open in App
Solution

Let us consider a positive integer a

Divide the positive integer a by 3, and let r be the reminder and q be the quotient such that

We know that According to Euclid’s Division Lemma

a=bq+r{ condition for ris(0r<b)}

a=3q+r(i)b=3

so r is an integer which lies in between 0and3

Hence r can be either 0,1or2.

Case I - When r=0, the equation 1 becomes

a=3q

Now, squaring both the sides, we get

a2=3q2a2=9q2a2=33q2a2=3mWhere3q2=m

Case II- When r=1, the equation 1 becomes

a=3q+1

Now, cubing both the sides, we get

a2=3q+12a2=3q2+12+23q1a2=9q2+6q+1a2=33q2+2q+1a2=3m+1Where3q2+2q=m

Case III- When r=2, the equation 1 becomes

a=3q+2

Now, cubing both the sides, we get

a2=3q+22a2=3q2+22+23q2a2=9q2+12q+4a2=33q2+4q+1+1a2=3m+1Where3q2+2q+1=m

∴ square of any positive integer is of form 3mor3m+1.

Hence proved.


flag
Suggest Corrections
thumbs-up
219
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Introduction
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon