Question

Find the HCF of 315 and 600 by using Euclids division algorithm​

Answer 1

Answer:

your answer is 345

Step-by-step explanation:

Answer 2

$\bf\pink{QuestioN:-}$

Find the HCF of 315 and 600 by using Euclids division algorithm​.

$\bf\yellow{AnsweR:-}$

Dividend = Divisor × Quotient + Remainder

Let us take,

600 as dividend and 315 as divisor.

$\bf{315)600(1}$

    $\bf\underline{-315}$

$\bf{285)315(1}$

    $\bf\underline{-285}$

$\bf{30 ) 285 ( 9}$

    $\bf\underline{-270}$

$\bf{15 ) 30 ( 2}$

   $\bf\underline{-30}$

    $\bf\boxed{\:0\:}$

Here 15 is giving the remainder as 0 . Therefore, we can tell that, the HCF of 315 and 600 is 15 .

ExtrA InfO:-

 

• Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. The HCF of two positive integers a and b is the largest positive integer d that divides both a and b.

All Done!!☺