LCM- GCD

About: LCM- GCD

Factorization of a number ( with printing steps and indication of rules applied for the numbers
2 : last digit 0 or even number
3 : sum of digits divisible by 3 ,
5 : last digit 0 or 5 ,
11 : if the difference of the sums of alternating digits is divisible by 11



Calculation of the LCM and GCD of 2 or more numbers
convert (a decimal number to binary, octal, decimal, hexadecimal )
and visualization of the calculations required to find the number in the new base
The conversion from base 10 to base 10 is only useful for didactic purposes for understanding the calculation algorithm .