Advertisements
Advertisements
प्रश्न
What is the smallest number that, when divided by 35, 56 and 91 leaves remainders of 7 in each case?
उत्तर
TO FIND: Smallest number that, when divided by 35, 56 and 91 leaves remainder of 7 in each case
L.C.M OF 35, 56 and 91
`35= 5xx7`
`56=2^2xx7`
`91=13xx7`
L.C.M of 35,56 and 91 = `2^2xx5xx7xx13`
=3640
Hence 84 is the least number which exactly divides 28, 42 and 84 i.e. we will get a remainder of 0 in this case. But we need the smallest number that, when divided by 35, 56 and 91 leaves remainder of 7 in each case
Therefore
= 3640 +7
= 3647
Hence 3647 is smallest number that, when divided by 35, 56 and 91 leaves remainder of 7 in each case.
APPEARS IN
संबंधित प्रश्न
Define HOE of two positive integers and find the HCF of the following pair of numbers:
32 and 54
Define HOE of two positive integers and find the HCF of the following pair of numbers:
18 and 24
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?
Three pieces of timber 42m, 49m and 63m long have to be divided into planks of the same length. What is the greatest possible length of each plank? How many planks are formed?
What do you mean by Euclid’s division algorithm.
What is a composite number?
A rectangular courtyard is 18 m 72 cm long and 13 m 20 cm broad. it is to be paved with square tiles of the same size. Find the least possible number of such tiles.
Express 429 as a product of its prime factors.
Prove that one of any three consecutive positive integers must be divisible by 3.
Use Euclid’s division algorithm to find the HCF of 441, 567, 693.
