Advertisements
Advertisements
प्रश्न
Prove that the square of any positive integer is of the form 3m or, 3m + 1 but not of the form 3m +2.
उत्तर
By Euclid’s division algorithm
a = bq + r, where 0 ≤ r ≤ b
Put b = 3
a = 3q + r, where 0 ≤ r ≤ 3
If r = 0, then a = 3q
If r = 1, then a = 3q + 1
If r = 2, then a = 3q + 2
Now, (3q)2 = 9q2
= 3 × 3q2
= 3m, where m is some integer
(3q + 1)2 = (3q)2 + 2(3q)(1) + (1)2
= 9q2 + 6q + 1
= 3(3q2 + 2q) + 1
= 3m + 1, where m is some integer
(3q + 2)2 = (3q)2 + 2(3q)(2) + (2)2
= 9q2 + 12q + 4
= 9q2 + 12q + 4
= 3(3q2 + 4q + 1) + 1
= 3m + 1, hwrer m is some integer
Hence the square of any positive integer is of the form 3m, or 3m +1
But not of the form 3m + 2
APPEARS IN
संबंधित प्रश्न
Show that the square of an odd positive integer is of the form 8q + 1, for some integer q.
Using Euclid’s algorithm, find the HCF of 960 and 1575 .
Using prime factorization, find the HCF and LCM of 8, 9, 25 .
The HCF of two numbers is 145 and their LCM is 2175. If one of the numbers is 725, find
the other.
The HCF of two numbers is 18 and their product is 12960. Find their LCM.
Express each of the following as a rational number in its simplest form:
(i) `2. bar(4)`
If a and b are relatively prime, what is their LCM?
Find the smallest number which when increased by 17 is exactly divisible by both 520 and 468.
If a = 23 ✕ 3, b = 2 ✕ 3 ✕ 5, c = 3n ✕ 5 and LCM (a, b, c) = 23 ✕ 32 ✕ 5, then n =
Using Euclid’s division lemma, if the cube of any positive integer is divided by 9 then the possible remainders are