Advertisements
Advertisements
Question
Find the largest number which divides 320 and 457 leaving remainders 5 and 7 respectively.
Solution
We know that the required number divides 315 (320 – 5) and 450 (457 – 7).
∴ Required number = HCF (315, 450)
On applying Euclid’s lemma, we get:
Therefore, the HCF of 315 and 450 is 45.
Hence, the required number is 45.
APPEARS IN
RELATED QUESTIONS
Using Euclid's division algorithm, find the H.C.F. of (iii) 867 and 255
Show that every positive integer is of the form 2q and that every positive odd integer is of the from 2q + 1, where q is some integer.
Define HOE of two positive integers and find the HCF of the following pair of numbers:
56 and 88
Find the greatest number which divides 285 and 1249 leaving remainders 9 and 7 respectively.
Using prime factorization, find the HCF and LCM of 36, 84 In case verify that HCF × LCM = product of given numbers.
What is a composite number?
HCF of two numbers is always a factor of their LCM (True/False).
In Q.No. 7, HCF (a, b) is
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.
