Math, asked by birodeep, 9 months ago

Use Euclid's Division algorithm to find HCF of: 1. (35,63)

Answers

Answered by ayushi12452

1

Answer:

hcf=7

Step-by-step explanation:

a=bq+r

63=35×1+28

35=28×1±7

28=7×4+0

plz follow me

Previous Question

Next Question

Similar questions

English, 4 months ago

make sentences with the following idioms: fall upon evil days ...

Economy, 4 months ago

an event becomes a disaster when there are...

Math, 4 months ago

Express the first quantity as a percentage of the second quantity. (i) 30,50 (ii) 180, 360 (iii) 45 cm, 120 cm (iv) 7.28 kg, 11.2 kg (v) 0.25, 5.00 (vi) 2.5, 22.5...

Math, 9 months ago

what is the smallest number by which 3087 must be divided so that the quotient is a perfect cube ans is 9...

India Languages, 9 months ago

plastic emission and nature protection, write an essay in Malayalam...

English, 1 year ago

'But how can anyone hold back a big boulder? "interupted my sister. change this sentence into indirect speech ...

Math, 1 year ago

Prove that angles opposite to equal side of an isocelous triangle are equal.

Physics, 1 year ago

find equivalent emf of the cells committed in series and parallel...