Prime factorization: Difference between revisions

Revision as of 14:54, 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.

Page

Toolbox

Search

Prime factorization: Difference between revisions

Revision as of 14:54, 19 June 2006

Example Problem

Revision as of 14:37, 19 June 2006 view source Me@home (talk \| contribs) 141 edits No edit summary ← Older edit	Revision as of 14:54, 19 June 2006 view source MCrawford (talk \| contribs) 1,942 edits m Prime Factorization moved to Prime factorization: I uncapitalized "factorization" because the article name is not a proper name. Newer edit →
(No difference)