Advertisements
Advertisements
Question
If the HCF of 408 and 1032 is expressible in the form 1032 m − 408 × 5, find m.
Solution
General integers are 408 and 1032 where 408 < 1032
By applying Euclid’s division lemma, we get
1032 = 408 × 2 + 216
Since remainder ≠ 0, apply division lemma on division 408 and remainder 216
408 = 216 × 1 + 192
Since remainder ≠ 0, apply division lemma on division 216 and remainder 192
216 = 192 × 1 + 24
Since remainder ≠ 0, apply division lemma on division 192 and remainder 24
192 = 24 × 8 + 32
We observe that 32m under in 0. So the last divisor 24 is the H.C.F of 408 and 1032
∴ 216 = 1032m – 408 × 5
⇒ 1032 m = 24 + 408 × 5
⇒ 1032m = 24 + 2040
⇒ 1032m = 2064
⇒ m =`2064/132=2`
APPEARS IN
RELATED QUESTIONS
Prove that the square of any positive integer is of the form 5q, 5q + 1, 5q + 4 for some integer q.
The length, breadth and height of a room are 8 m 25 cm, 6 m 75 cm and 4 m 50 cm, respectively. Determine the longest rod which can measure the three dimensions of the room exactly.
144 cartons of Coke Cans and 90 cartons of Pepsi Cans are to be stacked in a Canteen. If each stack is of the same height and is to contain cartons of the same drink, what would be the greatest number of cartons each stack would have?
During a sale, colour pencils were being sold in packs of 24 each and crayons in packs of 32 each. If you want full packs of both and the same number of pencils and crayons, how many of each would you need to buy?
Using prime factorization, find the HCF and LCM of 24, 36, 40 .
What is the smallest number that, when divided by 35, 56 and 91 leaves remainders of 7 in each case?
If d is the Highest Common Factor of 32 and 60, find x and y satisfying d = 32x + 60y
The set A = {0,1, 2, 3, 4, …} represents the set of ______.
The LCM of two prime numbers p and q (p > q) is 221. Find the value of 3p - q.
Use Euclid’s division algorithm to find the HCF of 441, 567, 693.
