Download Prime factorization using subsequent division

yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Addition wikipedia , lookup

Elementary mathematics wikipedia , lookup

Factorization of polynomials over finite fields wikipedia , lookup

Factorization wikipedia , lookup

List of prime numbers wikipedia , lookup

Date: _____________________
Prime Factorization
What is it?
Breaking-down a composite number by the prime numbers it is made of.
Why do we use it?
It can be used to find the Greatest Common Factor (GCF) and the Least Common
Multiple (LCM) of two or more numbers, to compare fractions with unlike
denominators, and for recognizing patterns.
This is how it’s done:
Subsequent Division (monkey division)
Prime #’s: 2, 3, 5, 7, 11, 13, 17
*Smallest primes first ALWAYS!
Write the answer using
You’re not done ‘til
you get to 1!
Prime factorization is written using exponents, so instead of
2  2  2  7 we write…
The Prime Factorization of 56 is: ________________