Math, asked by khanahmad3753, 9 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, 5 months ago

what is the volume of a cylinder having radius 7m and height 10m...

Chinese, 5 months ago

what is the real name of the male lead in THE TALE OF THE NINE TAILED ...

Computer Science, 5 months ago

6. IS a 7. How many types of function are there in Excel?

Math, 9 months ago

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

Physics, 9 months ago

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

Math, 1 year ago

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

Computer Science, 1 year ago

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

Physics, 1 year 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...