Use Euclid's division lemma to show that the square of any positive integer is either of the form for some integer .
Let us consider a positive integer
Divide the positive integer by , and let be the reminder and be the quotient such that
We know that According to Euclid’s Division Lemma
{ condition for }
so is an integer which lies in between
Hence can be either .
Case I - When , the equation becomes
Now, squaring both the sides, we get
Case II- When , the equation becomes
Now, cubing both the sides, we get
Case III- When , the equation becomes
Now, cubing both the sides, we get
∴ square of any positive integer is of form .
Hence proved.