Question

find HCF of 2.3 and 5.2 by Euclid division lemma​

Answer 1

Answer:

What do you mean by Euclid's division algorithm.

ANSWER:

Euclid's division algorithm states that for any two positive integers a and b, there exist unique integers q and r, such that a = bq + r, where 0 ≤ r < b.

Page No 8:

Question 2:

A number when divided by 61 gives 27 as quotient and 32 as remainder.

Find the number.

ANSWER:

We know, Dividend = Divisor × Quotient + Remainder

Given: Divisor = 61, Quotient = 27, Remainder = 32

Let the Dividend be x.

∴ x = 61 × 27 + 32

= 1679

Hence, the required number is 1679.

Page No 8:

Question 3:

By what number should 1365 be divided to get 31 as quotient and 32 as remainder?

ANSWER:

Given: Dividend = 1365, Quotient = 31, Remainder = 32

Let the divisor be x.

Dividend = Divisor × Quotient + Remainder

1365 = x × 31 + 32

⇒ 1365 − 32 = 31x

⇒ 1333 = 31x

⇒ x =

1333

31

= 43

Hence, 1365 should be divided by 43 to get 31 as quotient and 32 as remainder.

please mark me as a brainlist