Question

find the HCF of 240 and 1024 using euclid's division algorithm​

Answer 1

Answer:

gcf, hcf, gcd (240; 1,024) = 16 = 2^4: greatest (highest) common factor (divisor), calculated. The numbers have common prime factors.

Step-by-step explanation:

Answer 2

Answer:

⇒ 245 - 5 = 240 and 1029 - 5 = 1024 are completely divisible by the required number. Since, it is given that the required number is the largest number. Therefore, it is the HCF of 240 and 1024.

refer attachment also

Step-by-step explanation:

@Fhalak here