Please provide an integer to find its prime factors, exponential decomposition, interactive factor tree, and continuous division ladder.
A prime number is a natural number strictly greater than 1 that has exactly two distinct positive divisors: 1 and itself.
The number 2 is the smallest prime number and the only even prime number. All other even integers are divisible by 2 and therefore composite.
The Fundamental Theorem of Arithmetic states that every integer greater than 1 either is a prime number itself or can be represented as the unique product of prime numbers, up to the order of the factors.
This prime decomposition acts as a unique numerical "DNA fingerprint" for every integer.
A visual branching diagram where composite numbers are broken down recursively into pairs of multiplying factors until all terminal nodes are prime numbers.
Repeatedly dividing the number by the smallest prime number (2, 3, 5, 7, ...) that divides it evenly until the quotient reaches 1.
RSA encryption secures online transactions because multiplying two 300-digit primes is instantaneous, but factoring their product back into primes takes millennia.
Prime factor decomposition provides the fastest algorithmic method to compute Greatest Common Factors and Least Common Multiples.
Radicals like √72 are simplified to 6√2 by grouping square pairs from its prime factorization 2³ × 3² = (2² × 3²) × 2.
If 1 were considered prime, the Fundamental Theorem of Arithmetic would break down because numbers would have infinite prime factorizations (e.g. 6 = 2 × 3 = 1 × 2 × 3 = 1 × 1 × 2 × 3).
The prime factorization of a prime number is simply the number itself (e.g. the prime factorization of 97 is 97).
Combine repeated prime factors into base numbers with superscript exponent counts. For example, 2 × 2 × 2 × 3 × 5 × 5 is written as 2³ × 3 × 5².