Advertisements
Advertisements
प्रश्न
Find all positive integers, when divided by 3 leaves remainder 2
उत्तर
All the positive integers when divided by 3 leaves remainder 2
By Euclid’s division lemma
a = bq + r, 0 ≤ r ≤ b
Here a = 3q + r where 0 < q < 3
a leaves remainder 2 when divided by 3
∴ The positive integers are 2, 5, 8, 11, …
APPEARS IN
संबंधित प्रश्न
Use Euclid's Division Algorithm to show that the cube of any positive integer is either of the 9m, 9m + 1 or 9m + 8 for some integer m
Prove that the square of any positive integer of the form 5q + 1 is of the same form.
If the HCF of 657 and 963 is expressible in the form 657x + 963y − 15, find x.
Find the largest number which exactly divides 280 and 1245 leaving remainders 4 and 3, respectively.
Using prime factorization, find the HCF and LCM of 30, 72, 432 .
Using prime factorization, find the HCF and LCM of 21, 28, 36, 45 .
Find the least number which when divides 35, 56 and 91 leaves the same remainder 7 in each case.
Without actual division, show that each of the following rational numbers is a terminating decimal. Express each in decimal form.
(i) `24/125`
The product of any three consecutive natural number is divisible by 6 (True/False).
Every even integer is of the form 2m, where m is an integer (True/False).
