Advertisements
Advertisements
Question
Find the largest number which divides 615 and 963 leaving remainder 6 in each case.
Solution
The required number when the divides 615 and 963
Leaves remainder 616 is means 615 – 6 = 609 and 963 – 957 are completely divisible by the number
∴ the required number = HCF of 609 and 957
By applying Euclid’s division lemma
957 = 609 × 1 + 348
609 = 348 × 1 + 261
348 = 261 × 1 + 87
261 = 87 × 370
HCF = 87
Hence the required number is ‘87’
APPEARS IN
RELATED QUESTIONS
Define HOE of two positive integers and find the HCF of the following pair of numbers:
105 and 120
Using Euclid’s algorithm, find the HCF of 960 and 1575 .
Using prime factorization, find the HCF and LCM of 23, 31 In case verify that HCF × LCM = product of given numbers.
In a morning walk three persons step off together, their steps measure 80 cm, 85 cm and 90 cm respectively. What is the minimum distance each should walk so that he can cover the distance in complete steps?
Every odd integer is of the form 2m − 1, where m is an integer (True/False).
Two numbers have 12 as their HCF and 350 as their LCM (True/False).
When the positive integers a, b and c are divided by 13 the respective remainders is 9, 7 and 10. Find the remainder when a b + + 2 3c is divided by 13
Show that cube of any positive integer is of the form 4m, 4m + 1 or 4m + 3, for some integer m.
Prove that one and only one out of n, n + 2 and n + 4 is divisible by 3, where n is any positive integer.
Show that the square of any positive integer cannot be of the form 6m + 2 or 6m + 5 for any integer m.
