Advertisements
Advertisements
Question
Find the HCF of the following pairs of integers and express it as a linear combination of 506 and 1155.
Solution
By applying Euclid’s division lemma
1155 = 506 × 2 + 143 …. (i)
Since remainder ≠ 0, apply division lemma on division 506 and remainder 143
506 = 143 × 3 + 77 ….(ii)
Since remainder ≠ 0, apply division lemma on division 143 and remainder 77
143 = 77 × 1 + 56 ….(iii)
Since remainder ≠ 0, apply division lemma on division 77 and remainder 66
77 = 66 × 1 + 11 …(iv)
Since remainder ≠ 0, apply division lemma on divisor 36 and remainder 9
66 = 11 × 6 + 0
∴ HCF = 11
Now, 11 = 77 – 6 × 11 [from (iv)]
= 77 – [143 – 77 × 1] × 1 [from (iii)]
= 77 – 143 × 1 – 77 × 1
= 77 × 2 – 143 × 1
= [506 – 143 × 3] × 2 – 143 × 1 [from (ii)]
= 506 × 2 – 143 × 6 – 143 × 1
= 506 × 2 – 143 × 7
= 506 × 2 – [1155 – 506 × 27 × 7] [from (i)]
= 506 × 2 – 1155 × 7 + 506 × 14
= 506 × 16 – 115 × 7
APPEARS IN
RELATED QUESTIONS
Use Euclid's Division Algorithm to show that the cube of any positive integer is either of the 9m, 9m + 1 or 9m + 8 for some integer m
Define HOE of two positive integers and find the HCF of the following pair of numbers:
240 and 6552
Using prime factorization, find the HCF and LCM of 23, 31 In case verify that HCF × LCM = product of given numbers.
Three measuring rods are 64 cm, 80 cm and 96 cm in length. Find the least length of cloth that can be measured an exact number of times, using any of the rods.
Find the missing numbers in the following factorization:
Without actual division, show that each of the following rational numbers is a terminating decimal. Express each in decimal form.
(i) `151/600`
If p1 and p2 are two odd prime numbers such that p1 > p2, then
Find all positive integers, when divided by 3 leaves remainder 2
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 product of three consecutive positive integers is divisible by 6”. Is this statement true or false”? Justify your answer.