Question

The largest no. which divides 70 and 125 leaving remainder 5,8

Answer 1

Answer:

Step-by-step explanation:

Thinking process :-

First , we subtract the remainders 5 and 8 from corresponding numbers respectively and then HCF of resulting numbers by using Euclid's division algorithm, which is the required largest number.

Solution:-

Since, 5 and 8 are remainders of 70  and 125 respectively.Thus, after subtracting these remainders from the numbers, we have the number 65 = (70 - 5), 117 = (125 - 8), which is divisible by the required number.

Now, required number = HCF of 65, 117               [for the largest number]

⇒ 117 = 65 × 1 + 52           [∵ dividend = divisor × quotient + remainder]

⇒ 65 = 52 × 1 + 13

⇒ 52 = 13 × 4 + 0

∴ HCF = 13

Hence, 13 is the largest number which divides 70 and 125, leaving remainder 5 and 8

Hope it helps you. Pls mark me the brainlist

Answer 2

Answer:

Answer:- 13

Step-by-step explanation:

= 70 - 5 = 65

= 125 - 8 = 117

Now, by Euclid's division method, find the HCF of 65 and 117

= 117 = 65 * 1 + 52

= 65 = 52 * 1 + 13

= 52 = 13 * 4 + 0

= HCF = 13