Math, asked by birodeep, 11 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, 5 months ago

help me in english chapter name:- Prepositional Phrases...

Math, 5 months ago

To the pressure exerted on go area lacm by löcm is loco dynes.lcm * 2 find the applied force. We...

Math, 5 months ago

Q.2]: State true or false; 1. All rectangle are square. 2. All rhombus are parallelograms. 3. A perfect cube does not end with two zero. 4. The square of a prime number is 9 prime. 5. Zero has no reciprocal.

Math, 11 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, 11 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...