Advertisements
Advertisements
प्रश्न
Find the least number which when divides 35, 56 and 91 leaves the same remainder 7 in each case.
उत्तर
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
संबंधित प्रश्न
Show that any positive odd integer is of the form 4q + 1 or 4q + 3, where q is some integer.
Find the greatest number that will divide 445, 572 and 699 leaving remainders 4, 5 and 6 respectively.
Find the simplest form of `473/645` .
Without actual division show that each of the following rational numbers is a non-terminating repeating decimal.
(i)`64/455`
If a and b are relatively prime, what is their LCM?
Express each of the following integers as a product of its prime factors:
420
Euclid’s division lemma states that for positive integers a and b, there exist unique integers q and r such that a = bq + r, where r must satisfy
The least number that is divisible by all the numbers from 1 to 8 (both inclusive) is ______.
“The product of three consecutive positive integers is divisible by 6”. Is this statement true or false”? Justify your answer.
Using Euclid’s division algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3, respectively.
