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
संबंधित प्रश्न
Find the largest number which exactly divides 280 and 1245 leaving remainders 4 and 3, respectively.
What do you mean by Euclid’s division algorithm?
Without actual division, show that each of the following rational numbers is a terminating decimal. Express each in decimal form.
(i) `151/600`
Express each of the following as a rational number in its simplest form:
(i) `2. bar(4)`
The exponent of 2 in the prime factorisation of 144, is
The sum of the exponents of the prime factors in the prime factorisation of 196, is
If p and q are co-prime numbers, then p2 and q2 are
The smallest number by which \[\sqrt{27}\] should be multiplied so as to get a rational number is
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
The set A = {0,1, 2, 3, 4, …} represents the set of ______.
