FundamentalTheoremOfArithmetic.md (596B)
1 # The Fundamental Theorem of Arithmetic 2 3 Abstract Math 10.4. Can be proven through [StrongInduction](StrongInduction.md) 4 5 **Definition:** Any integer greater than 1 has a unique prime factorization. 6 7 This means any number can be given in the form a * b * ... * z where all numbers multiplied together are prime numbers. 8 9 The proof of this is quite interesting. Basically it states, if a number is not the prime factorization of any other numbers, then it can't be made because all numbers can be made by multiplying primes together thus this number must be prime meaning it factorizes itself. 10