Advertisements
Advertisements
Question
Find the least number which when divides 35, 56 and 91 leaves the same remainder 7 in each case.
Solution
Least number which can be divided by 35, 56 and 91 is LCM of 35, 56 and 91.
Prime factorization of 35, 56 and 91 is:
35 = 5 × 7
56 = 23 × 7
91 = 7 × 13
LCM = product of greatest power of each prime factor involved in the numbers = 23 × 5 × 7 × 13 = 3640
Least number which can be divided by 35, 56 and 91 is 3640.
Least number which when divided by 35, 56 and 91 leaves the same remainder 7 is 3640 + 7 = 3647.
Thus, the required number is 3647.
APPEARS IN
RELATED QUESTIONS
For any positive integer n , prove that n3 − n divisible by 6.
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:
155 and 1385
Two brands of chocolates are available in packs of 24 and 15 respectively. If I need to buy an equal number of chocolates of both kinds, what is the least number of boxes of each kind I would need to buy?
144 cartons of Coke Cans and 90 cartons of Pepsi Cans are to be stacked in a Canteen. If each stack is of the same height and is to contain cartons of the same drink, what would be the greatest number of cartons each stack would have?
Without actual division, show that each of the following rational numbers is a terminating decimal. Express each in decimal form.
(i) `19/3125`
Prove that following numbers are irrationals:
If a = 23 ✕ 3, b = 2 ✕ 3 ✕ 5, c = 3n ✕ 5 and LCM (a, b, c) = 23 ✕ 32 ✕ 5, then n =
Show that cube of any positive integer is of the form 4m, 4m + 1 or 4m + 3, for some integer m.
Using Euclid’s division algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3, respectively.
