Question
Question: Show that the square of any positive integer is of the form \[3m\] or, \[3m+1~\] for some integer \[...
Show that the square of any positive integer is of the form 3m or, 3m+1 for some integer m.
Solution
Here we will use Euclid's Division Lemma method to prove the given condition. We will first assume the integer to be any variable and then we will divide that integer by 3, and then we will write the integer in the form of quotient and remainder. Then we will take different values of remainder and we will find the square of integer for different values of remainder.
Complete step by step solution:
Let that positive integer be a
Now, we will divide the integer by 3 and let the remainder be r and b be the quotient.
We can write the integer in terms of remainder and quotient as;
⇒a=3b+r ……….. (1)
Where r can be 0, 1, 2, ….
Now, we will take three cases in which we take different values of rstarting from 0.
Case 1: when r=0
We can write equation 1 after substituting the value of r as
⇒a=3b
Squaring on both sides, we get
⇒a2=(3b)2
Applying exponents on the bases, we get
⇒a2=9b2
We can also write the equation as
⇒a2=3(3b2)
Now, we will put m in place of 3b2 .
⇒a2=3m …… (2)
Case 2: when r=1
We can write equation 1 after substituting the value of r as
⇒a=3b+1
Squaring on both sides, we get
⇒a2=(3b+1)2
Applying exponents on the bases, we get
⇒a2=9b2+6b+1
We can also write the equation as
⇒a2=3(3b2+2b)+1
Now, we will put m in place of 3b2+2b .
⇒a2=3m+1 ……. (3)
Case 3: when r=2
We can write equation 1 after substituting the value of r as
⇒a=3b+2
Squaring on both sides, we get
⇒a2=(3b+2)2
Applying exponents on the bases, we get
⇒a2=9b2+12b+4
We can also write the equation as
⇒a2=3(3b2+4b+1)+1
Now, we will put m in place of 3b2+4b+1 .
⇒a2=3m+1 ……. (4)
Hence, from equation 2, 3 and 4 we can say that the square of any positive integer is of the form 3m or, 3m+1 .
Note:
Since we have used Euclid's division method to prove that condition. So here is the definition or explanation of this method. if we have two positive integers a and b , then according to Euclid’s Division Lemma method, there exist another unique integers q and r, which satisfies the condition a=bq+r where 0≤r≤b .