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 prime factorization, find the HCF and LCM of 24, 36, 40 .
Without actual division show that each of the following rational numbers is a non-terminating repeating decimal.
(i) `29/343`
Express each of the following as a rational number in its simplest form:
(i) `2. bar(4)`
Express each of the following as a rational number in its simplest form:
(i) `2. bar (24)`
What do you mean by Euclid’s division algorithm.
The product of two numbers is 1050 and their HCF is 25. Find their LCM.
If a and b are relatively prime, what is their LCM?
Prove that following numbers are irrationals:
The smallest number by which \[\sqrt{27}\] should be multiplied so as to get a rational number is
A positive integer is of the form 3q + 1, q being a natural number. Can you write its square in any form other than 3m + 1, i.e., 3m or 3m + 2 for some integer m? Justify your answer.