Question

hlo guys !

Q1) what is Euclid's arithmetic ?​

Answer 1

Answer:

The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. For example, 21 is the GCD of 252 and 105 (as 252 = 21 × 12 and 105 = 21 × 5), and the same number 21 is also the GCD of 105 and 252 − 105 = 147. Since this replacement reduces the larger of the two numbers, repeating this process gives successively smaller pairs of numbers until the two numbers become equal. When that occurs, they are the GCD of the original two numbers. By reversing the steps or using the extended Euclidean algorithm, the GCD can be expressed as a linear combination of the two original numbers, that is the sum of the two numbers, each multiplied by an integer (for example, 21 = 5 × 105 + (−2) × 252). The fact that the GCD can always be expressed in this way

Step-by-step explanation:

mark me brainliest

Answer 2

Answer ❤️

Second, Euclid gave a version of what is known as the unique factorization theorem or the fundamental theorem of arithmetic ..

This says that any whole number can be factored into the product of primes in one and only one way.

hope help you

brainlist please ❤️