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 5n,5n+1or5n+4 for some integer.


Open in App
Solution

Let us consider a positive numbers a.

As per the given data:

a=5nora=5n+1ora=5n+2ora=5n+3ora=5n+4 for integer a.

We know that According to Euclid’s Division Lemma

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

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

so r is an integer which lies in between 0and5

Hence r can be either 0,1,2,3,4

So, now we can have five cases which we will take one by one.

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

a=5q

Now, squaring both the sides, we get

a2=5q2a2=25q2a2=55q2a2=5nwheren=5q2

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

a=5q+1

Now, squaring both the sides, we get

a2=5q+12a2=25q2+1+10qa2=25q2+10q+1a2=55q2+2q+1a2=5n+1wheren=5q2+2q

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

a=5q+2

Now, squaring both the sides, we get

a2=5q+22a2=25q2+4+20qa2=25q2+20q+4a2=55q2+4q+4a2=5n+4wheren=5q2+4q

Case IV- When r=3, the equation 1 becomes

a=5q+3

Now, squaring both the sides, we get

a2=5q+32a2=25q2+9+30qa2=25q2+30q+5+4a2=55q2+6q+1+4a2=5n+4wheren=5q2+6q+1

Case V- When r=4, the equation 1 becomes

a=5q+4

Now, squaring both the sides, we get

a2=5q+42a2=25q2+16+40qa2=25q2+40q+15+1a2=55q2+6q+3+1a2=5n+1wheren=5q2+6q+3

Therefore, In each case, a is either of the form 5n,5n+1or5n+4 for integer n


flag
Suggest Corrections
thumbs-up
9
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Euclid Division Algorithm
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon