Advertisements
Advertisements
प्रश्न
Find the greatest number which divides 285 and 1249 leaving remainders 9 and 7 respectively.
उत्तर
The require number when divides 285 and 1249, leaves remainder 9 and 7, this means 285 – 9 = 276 and 1249 – 7 = 1242 are completely divisible by the number
∴ The required number = HCF of 276 and 1242
By applying Euclid’s division lemma
1242 = 276 × 4 + 138
276 = 138 × 2 + 0
∴ HCF = 138
Hence remainder is = 0
Hence required number is 138
APPEARS IN
संबंधित प्रश्न
Define HOE of two positive integers and find the HCF of the following pair of numbers:
240 and 6552
Without actual division show that each of the following rational numbers is a non-terminating repeating decimal.
(i) `9/35`
Express each of the following integers as a product of its prime factors:
945
What is the smallest number that, when divided by 35, 56 and 91 leaves remainders of 7 in each case?
Prove that \[2\sqrt{3} - 1\] is an irrational number.
The sum of two prime number is always a prime number (True/ False).
The LCM of two numbers is 1200. Which of the following cannot be their HCF?
If a = 23 ✕ 3, b = 2 ✕ 3 ✕ 5, c = 3n ✕ 5 and LCM (a, b, c) = 23 ✕ 32 ✕ 5, then n =
Write whether the square of any positive integer can be of the form 3m + 2, where m is a natural number. Justify your answer.
Assertion: If the HCF of 510 and 92 is 2, then the LCM of 510 and 92 is 32460.
Reason: As HCF (a, b) × LCM (a, b) = a × b
