This document discusses prime factorization, greatest common factors (GCF), least common multiples (LCM), and the Euclidean algorithm. It provides examples of finding the prime factorization of numbers, using factor trees and canonical representation. It also gives steps for calculating the GCF and LCM of two or more numbers by finding their prime factorizations and examining the exponents of common factors. The Euclidean algorithm is introduced as an alternate method for finding the GCF of two numbers based on repeated division. Applications of these concepts to rational numbers and fractions are also described.