Express the hcf of 960 and 1575.
Express it in form of 960m and 1575n
.
Answers
Answered by
1
Answer:
Euclid's division algorithm:
Given positive integers a and b , there
exist whole numbers q and r satisfying
a = bq + r , 0 < r < b
According to the problem given ,
Applying Ecuclid's division lemma to 960,
and 1575, we get
1575 = 960 × 1
960 = 615 ×1 + 270
615 = 270 × 1 + 75
270 = 75 × 3 + 45
75 = 45 × 1 + 30
45 = 30 × 1 + 15
30 = 15 × 2 + 0
Notice that the remainder has become zero,
and we cannot proceed anybfurther.
We claim that the HCF of 960 and 1575 is the
divisor at this stage , i.e . 15.
I hope this helps you.
Read more on Brainly.in - https://brainly.in/question/393152#readmore
Step-by-step explanation:
Similar questions
Business Studies,
6 months ago
English,
6 months ago
Science,
6 months ago
English,
11 months ago
Physics,
1 year ago