You can find details on this algorithm in the Wikipedia article "Ancient Egyptian multiplication".
Chat with our AI personalities
You can use Euclid's algorithm to calculate the gcf of two of the numbers - then use Euclid's algorithm again with the result and the third number.Or you can factor all the numbers into prime factors, and check which prime factors occur in all three numbers.
576
12
You multiply the answer you got by the number you divided by for example: If you divided 2 by 12 you would get 6 then you would multiply 6 by 2 and get 12
multiply a number by .12 or 12/100.