prove fundamental theory of arithematics
Answers
Answered by
19
Answer:
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
Step-by-step explanation:
The fundamental theorem of arithmetic states that every positive integer (except the number 1) can be represented in exactly one way apart from rearrangement as a product of one or more primes (Hardy and Wright 1979, pp. 2-3). This theorem is also called the unique factorization theorem.
HOPE THIS WILL HELP U MATE..
MARK ME BRAINLIEST AND FOLLOW ⤵️❤️
Similar questions