User:JustBerry/Math/Prime Factorization/sandbox

This is the user sandbox of JustBerry. A user sandbox is a subpage of the user's user page. It serves as a testing spot and page development space for the user and is not an encyclopedia article. Create or edit your own sandbox here.

Other sandboxes: Main sandbox | Template sandbox

Finished writing a draft article? Are you ready to request review of it by an experienced editor for possible inclusion in Wikipedia? Submit your draft for review!

Status: Work In Progress

[http://en.wikipedia.org/wiki/Integer_factorization]

Introduction

In number theory, integer factorization or prime factorization is the decomposition of a composite number into smaller non-trivial divisors, which when multiplied together equal the original integer. When a prime factorization has the same prime factor (f) appearing x number of times in a prime factorization, the factors can be written as f^x. There are several methods to performing a prime factorization. The "factor tree" method is one of the most common methods to finding a prime factorization. It represents the prime factors of a positive integer in a "family tree" layout or diagram.^[1]

External Links

Video

http://www.khanacademy.org/math/arithmetic/factors-multiples/prime_factorization/v/prime-factorization

Practice

References

^ "What is a Factor Tree?". Factor Tree. Retrieved 28 May 2013. {{cite web}}: |first= has generic name (help); |first= missing |last= (help)

[1] "What is a Factor Tree?". Factor Tree. Retrieved 28 May 2013. {{cite web}}: |first= has generic name (help); |first= missing |last= (help)

[1]