Use Euclid's Division Lemma to show that the square of any positive integer is either for some integer.
Let us consider a positive numbers .
As per the given data:
for integer .
We know that According to Euclid’s Division Lemma
{ condition for }
so is an integer which lies in between
Hence can be either
So, now we can have five cases which we will take one by one.
Case I- When , the equation becomes
Now, squaring both the sides, we get
Case II- When , the equation becomes
Now, squaring both the sides, we get
Case III- When , the equation becomes
Now, squaring both the sides, we get
Case IV- When , the equation becomes
Now, squaring both the sides, we get
Case V- When , the equation becomes
Now, squaring both the sides, we get
Therefore, In each case, is either of the form for integer