Question

proove fundamental theorem of arithmetic​

Answer 1

Answer:

For this proof,we will assume that the reader already knows the following two facts:

*Every integer greater than 1 has at laest onep prime division. This implies that every integer greater than 1 is either prime or composite.

* (Euclids Lemma) If a prime number p/ab for integers a,b then p/a or p/b.(Used to show uniqueness)

If either of these seems unfamiliar, take a moment now to think about why they are true. They can also be found in previous lessons.

There are two parts that we need to proof:

* The existence of such a products of primes.

* The product of primes is unique up to their order.

To proove existence,we will use strong induction