Prime factorization: Difference between revisions
IntrepidMath (talk | contribs) No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
For a positive integer <math>n</math>, the '''prime factorization''' of <math>n</math> is an expression for <math>n</math> as a product of powers of [[prime number]]s. An important theorem of [[number theory]] called the [[Fundamental Theorem of Arithmetic]] tells us that every [[positive integer]] has a unique prime factorization, up to changing the order of the terms. | |||
The prime factorization of 378 is <math>2^1\cdot3^3\cdot7^1</math>. | |||
<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, the <math>p_{i}</math> are prime numbers, and the <math>e_i</math> are their positive integral exponents. | |||
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 09:30, 23 June 2006
For a positive integer 
, the prime factorization of is an expression for as a product of powers of prime numbers. An important theorem of number theory called the Fundamental Theorem of Arithmetic tells us that every positive integer has a unique prime factorization, up to changing the order of the terms.
The prime factorization of 378 is 
.
, where n is any natural number, the 
are prime numbers, and the 
are their positive integral exponents.
Prime factorizations are important in many ways, for instance, to simplify fractions.
