find the HCFof 1620,1725,and 255
by Euclid’s division algorithm​

2 thoughts on “find the HCFof 1620,1725,and 255<br />by Euclid’s division algorithm​”

1. Answer:

   First find the HCF of 1620 and 1725

   1725 = 1620 × 1 + 105

   1620 = 105 × 15 + 45

   105 = 45 × 2 + 15

   45 = 15 × 3 + 0

   HCF ( 1725 , 1620 ) = 15

   Now we have to find HCF of 15 and 255

   255 = 15 × 17 + 0

   HCF ( 15 , 255 ) = 15

   Therefore ,

   HCF ( 1620 , 1725 , 255 ) = 15

   MARK ME BRAINLIEST

   Reply

2. Answer:

   15

   Step-by-step explanation:

   In mathematics, the greatest common divisor of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For two integers x, y, the greatest common divisor of x and y is denoted

   Reply