Question

write statement of fundamental theorem of arithmetic 2. state Euclid's algorithm .......​

Answer 1

The Fundamental Theorem of Arithmetic says that every integer greater than 1 can be factored uniquely into a product of primes. Euclid's lemma says that if a prime divides a product of two numbers, it must divide at least one of the numbers

Answer 2

In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor of two integers, the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements....

hope it will help you ✌️