lcm hcf

30 is the LCM of 10 and 15. * * Factors of 10 are: 1, 2, 5, 10 * Factors of 15 are: 1, 3, 5, 15 * => 5 is the HCF of 10 and 15. * * Tasks: * (Easy) Write a program to find the LCM and HCF * of 2 numbers. * * (Medium) Write a program to find the LCM and * HCF of 3 numbers. * * (Hard) Write a program to find the LCM and HCF * of 4 or more numbers. * */ // Get factors of number function get_factors($num) { $factors = array(); $n = $num; for($i = 2; $i <= $num - 1; $i++) { if($n % $i == 0) { $exp = 0; while($n % $i == 0) { $exp++; $n = $n/$i; } $factors[$i] = $exp; } } return $factors; } /* Print number and its factors */ function print_number_factors($number,$factors) { $img=array(); foreach(array_keys($factors) as $k) { if($factors[$k] > 1) { array_push($img, $k. "^{".
$factors[$k].
"}"); } else { array_push($img, $k); } } $msg = $number." : ". implode(" * ", $img)."
"; } /* Calculate lcm and hcf */ function calculate($numbers) { $nums = $numbers; $factors = array(); $img = array(); $msg = ""; echo "

LCM and HCF of ".implode(",",$nums)."

"; foreach($nums as $num) { $factors[$num] = get_factors($num); print_number_factors( "".$num."", $factors[$num]); } $lcm_factors = array(); $hcf_factors = array(); $check_common = true; while(count($factors) > 0) { $f1 = $factors[$nums[0]]; foreach(array_keys($f1) as $k) { $min = $f1[$k]; $max = $f1[$k]; $common = true; for($i=1; $i $max) { $max = $f2[$k]; } if($f2[$k] < $min) { $min = $f2[$k]; } unset( $factors[$nums[$i]][$k]); } else { $common = false; } } $lcm_factors[$k] = $max; if($common && $check_common) { $hcf_factors[$k] = $min; } } unset($factors[$nums[0]]); array_shift($nums); $check_common = false; } $lcm = 1; $hcf = 1; foreach(array_keys($lcm_factors) as $k) { $lcm *= pow($k,$lcm_factors[$k]); } foreach(array_keys($hcf_factors) as $k) { $hcf *= pow($k,$hcf_factors[$k]); } echo "
Least Common Multiple :
"; print_number_factors("".$lcm."", $lcm_factors); echo "
Highest Common Factor :
"; print_number_factors("".$hcf."", $hcf_factors); echo "
"; } ?> lcm hcf

"; calculate($input); echo "

"; } ?>

[challenge] LCM HCF