Hcf of 184230 and 276 by euclide division algorithms

1.	Hcf of 184230 and 276 by euclide division algorithms
Answer» Given numbers are 184, 230, and 276.Applying Euclid\'s division lemma to 184 and 230, we get230 = 184\xa0{tex}\\times{/tex}\xa01 + 46184 = 46\xa0{tex}\\times{/tex}\xa04 + 0The remainder at this stage is zero.So, the divisor at this or the remainder at the previous stage i.e., 46 is the HCF of 184 and 230.Also,276 = 46\xa0{tex}\\times{/tex}\xa06 + 0∴ HCF of 276 and 46 is 46HCF (184, 230, 276) = 46Hence, the required HCF of 184, 230 and 276 is 46.

Discussion