Difference between revisions of "Prime factorization"

m (Prime Factorization moved to Prime factorization: I uncapitalized "factorization" because the article name is not a proper name.)
m (proofreading)
Line 1: Line 1:
 
By the [[Fundamental Theorem of Arithmetic]], every positive integer has a unique prime factorization. What is a prime factorization? It is a representation of a number in terms of powers of primes (it is of the form <math>{p_1}^{e_1}\cdot</math><math>{p_2}^{e_2}\cdot{p_3}^{e_3}\cdots{p_k}^{e_k} = n</math>, where ''n'' is any natural number).
 
By the [[Fundamental Theorem of Arithmetic]], every positive integer has a unique prime factorization. What is a prime factorization? It is a representation of a number in terms of powers of primes (it is of the form <math>{p_1}^{e_1}\cdot</math><math>{p_2}^{e_2}\cdot{p_3}^{e_3}\cdots{p_k}^{e_k} = n</math>, where ''n'' is any natural number).
Prime factorizations are important in many ways, for instance to simplify [[fractions]].
+
Prime factorizations are important in many ways, for instance, to simplify [[fractions]].
 
===Example Problem===
 
===Example Problem===

Revision as of 17:24, 19 June 2006

By the Fundamental Theorem of Arithmetic, every positive integer has a unique prime factorization. What is a prime factorization? It is a representation of a number in terms of powers of primes (it is of the form ${p_1}^{e_1}\cdot$${p_2}^{e_2}\cdot{p_3}^{e_3}\cdots{p_k}^{e_k} = n$, where n is any natural number). Prime factorizations are important in many ways, for instance, to simplify fractions.

Example Problem