Math, asked by shanvi487, 1 month ago

Q. Use euclid division algorithms to find the hcf of :
1. 272 and 1032
2.405 and 2520
3.155 and and 1385
4.384 and 1296
5.1848 and 3058

Answers

Answered by gsr71918

0

Answer:

use 1032 = 272(q) + r till you get r = 0. then the divisor of the last division is the HCF

Step-by-step explanation:

out of syllabus for 10th class. but still I know

it uses : dividend = divisor * quotient + reminder

Previous Question

Next Question

Similar questions

Science, 28 days ago

what will happen when you mix hydrochloric acid with nitric acid...

English, 28 days ago

Multiple Choice Questions (MCQ)(1 Mark) – MY OWN TRUE FAMILY (Ted Hughes) 1) Once the child went inside a/an – a. birchwood b. sandal wood c. oakwood d. tropical forest Ans. 2) The child was looking for – a. a squirrel b. a stag c. a dove d. a deer Ans. 3) The woman that the child met was – a. young b. middle aged c. old d. none of these Ans. 4) The clothes that the woman was wearing...

Science, 28 days ago

v) What is lithosphere?

Science, 1 month ago

in clayey soil, there are very little _____ between the soil particles...

Chemistry, 1 month ago

what are quantum numbers? give the significance of various quantim numbers...

Computer Science, 8 months ago

Write a program in java to input a number user(BufferedReader) and print if it is prime number pr not . With VDT table.

English, 8 months ago

do you enjoy reading this book .is it a noun,adjective,adverb,prepostition ...

Social Sciences, 8 months ago

2. What is the irnportance and role of the constitution in a dernocrao...