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
संबंधित प्रश्न
A mason has to fit a bathroom with square marble tiles of the largest possible size. The size of the bathroom is 10 ft. by 8 ft. What would be the size in inches of the tile required that has to be cut and how many such tiles are required?
Using prime factorization, find the HCF and LCM of 24, 36, 40 .
The HCF of two numbers is 23 and their LCM is 1449. If one of the numbers is 161, find the other.
Find the smallest number which when divides 28 and 32, leaving remainders 8 and 12 respectively.
The smallest number by which \[\sqrt{27}\] should be multiplied so as to get a rational number is
The LCM and HCF of two rational numbers are equal, then the numbers must be
If the sum of LCM and HCF of two numbers is 1260 and their LCM is 900 more than their HCF, then the product of two numbers is
Use Euclid's division algorithm to find the HCF of 255 and 867.
Show that cube of any positive integer is of the form 4m, 4m + 1 or 4m + 3, for some integer m.
Prove that one of any three consecutive positive integers must be divisible by 3.
