Math, asked by khanahmad3753, 8 months ago

find the HCF of Euclid division algorithm 156,504

Answers

Answered by bhanukiran1307

0

Answer:

4

Step-by-step explanation:

prime factorisation of 156= 2^2 ×28

prime factorisation of 504= 2^3×3 ×21

so, HCF=2^2 =4

Previous Question

Next Question

Similar questions

Math, 4 months ago

proof that 2√2 is an irrational no.

Math, 4 months ago

Draw a circle of radius 3.5 with center o draw a central angle AOB = 110° plz ans my question its very important pls dont spam...

Math, 4 months ago

mayank secures 630 marks out of 900 and pooja secures 630 marks out of 1300 .Whose performance is better?pls answer.

Math, 8 months ago

Factorise 2x^2-9-3x using splitting the middle term method...

Physics, 8 months ago

check the correctness of physical equation v=u + at...

Math, 11 months ago

find t if 2x^2-5x+10 and 2x^2-tx+2t...

Computer Science, 11 months ago

1 point Recombination does not occur in a solar cell ...

Physics, 11 months ago

a body is projected with velocity u at an angle theta with horizontal. derive the expression for (a) maximum height (b) range of the projectile...