Question

the hcf of 652 and 195​

Answer 1

Step-by-step explanation:

To find the highest common factor (HCF) of 652 and 195, you can use the Euclidean algorithm.

652 ÷ 195 = 3 with a remainder of 67

195 ÷ 67 = 2 with a remainder of 61

67 ÷ 61 = 1 with a remainder of 6

61 ÷ 6 = 10 with a remainder of 1

6 ÷ 1 = 6 with no remainder

So, the HCF of 652 and 195 is 1.

Answer 2

To find the highest common factor (HCF) of 652 and 195, we can use the Euclidean algorithm:

1. Divide the larger number by the smaller number and find the remainder.
652 ÷ 195 = 3 remainder 67

2. Then, divide the divisor in the previous step by the remainder.
195 ÷ 67 = 2 remainder 61

3. Repeat this process until the remainder is zero.

67 ÷ 61 = 1 remainder 6
61 ÷ 6 = 10 remainder 1
6 ÷ 1 = 6 remainder 0

Since the remainder has become zero, the divisor at this stage (which is 1) is the HCF of 652 and 195.

So, the HCF of 652 and 195 is 1.