Advertisements
Advertisements
प्रश्न
Find the smallest number which when increased by 17 is exactly divisible by both 520 and 468.
उत्तर
TO FIND: Smallest number which when increased by 17 is exactly divisible by both 520 and 468.
L.C.M OF 520 and 468
`468 = 2^2xx3^2xx13`
\[\text{LCM of 520 and 468} = 2^3 \times 3^2 \times 5 \times 13\]
\[ = 4680\]
Hence 4680 is the least number which exactly divides 520 and 468 i.e. we will get a remainder of 0 in this case. But we need the Smallest number which when increased by 17 is exactly divided by 520 and 468.
Therefore
= 4680 -17
= 4663
Hence 4663 is Smallest number which when increased by 17 is exactly divisible by both 520 and 468.
APPEARS IN
संबंधित प्रश्न
Using Euclid's division algorithm, find the H.C.F. of 135 and 225
Define HOE of two positive integers and find the HCF of the following pair of numbers:
105 and 120
Find the greatest number which divides 285 and 1249 leaving remainders 9 and 7 respectively.
Find the greatest number which divides 2011 and 2623 leaving remainders 9 and 5 respectively.
The HCF of two numbers is 23 and their LCM is 1449. If one of the numbers is 161, find the other.
Without actual division show that each of the following rational numbers is a non-terminating repeating decimal.
(i) `29/343`
Prove that for any prime positive integer p, \[\sqrt{p}\]
is an irrational number.
What is the HCF of the smallest composite number and the smallest prime number?
Every odd integer is of the form 2m − 1, where m is an integer (True/False).
If p1 and p2 are two odd prime numbers such that p1 > p2, then