Prime Factorization Method
The calculator breaks each number down into its prime factors, then finds the HCF by multiplying the lowest shared power of every common prime factor, and the LCM by multiplying the highest power of every prime factor that appears in any number. It also verifies results using the Euclidean division algorithm, which repeatedly divides the larger number by the smaller number until the remainder reaches zero, with the last non-zero remainder being the HCF.