WebMay 20, 2012 · The highest common factor (HCF) refers to a factor that is COMMON to two or more numbers. You have only one number in the question! ... What is the Hcf of 48 60 and 72? The GCF is 12. What is the HCF of 2440 and … WebThe product of these divisors gives the LCM of 60 and 72. Step 1: Find the smallest prime number that is a factor of at least one of the numbers, 60 and 72. Write this prime number (2) on the left of the given numbers (60 and 72), separated as per the ladder arrangement. Step 2: If any of the given numbers (60, 72) is a multiple of 2, divide it ...
Highest Common Factor of 60, 72 using Euclid
WebStep 1:Since 72 > 60, we apply the division lemma to 72 and 60, to get 72 = 60 x 1 + 12 Step 2:Since the reminder 60 ≠ 0, we apply division lemma to 12 and 60, to get 60 = 12 x 5 + 0 The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 12, the HCF of 60 and 72 is 12 Notice that 12 = HCF(60,12) = HCF(72,60) . WebMar 29, 2024 · Step 1: The first step is to use the division lemma with 60 and 48 because 60 is greater than 48 60 = 48 x 1 + 12 Step 2: Here, the reminder 48 is not 0, we must use division lemma to 12 and 48, to get 48 = 12 x 4 + 0 As you can see, the remainder is zero, so you may end the process at this point. texting landline to cell phone
LCM of 60 and 72 - How to Find LCM of 60, 72? - Cuemath
WebHCF stands for highest common factor and LCM stands for least common multiple. HCF is the greatest integer that divides all numbers and LCM is the smallest integer that is … WebOct 21, 2013 · The HCF of 60 is 60. But it's a factor as opposed to a common factor because there's only one number. Wiki User ∙ 2013-10-21 23:07:55 This answer is: … HCF of 60 and 72 is the divisor that we get when the remainder becomes 0 after doing long division repeatedly. 1. Step 1: Divide72 … See more As per the Euclidean Algorithm, HCF(X, Y) = HCF(Y, X mod Y) where X > Y and mod is the modulooperator. Here X = 72 and Y = 60 1. HCF(72, 60) = HCF(60, 72 mod 60) = HCF(60, 12) 2. HCF(60, 12) = HCF(12, 60 mod 12) … See more swscontext释放