✦ScienexySCIENCE KNOWLEDGE LIBRARY
topic · SCI-MAT-002-045

Fundamental Theorem of Arithmetic

The Fundamental Theorem of Arithmetic states that every integer greater than 1 can be expressed uniquely as a product of prime numbers, apart from the order of the factors. It establishes the mathematical foundation of prime factorization.

NameExpressionDescription

Fundamental Theorem of Arithmetic

n = p_1^(a_1) × p_2^(a_2) × ... × p_r^(a_r)

Every integer n greater than 1 can be represented uniquely as a product of distinct primes raised to positive integer exponents.

Prime Integer

p = p^1

A prime number is represented by itself as its prime factorization.

Composite Integer

n = p_1 × p_2 × ... × p_k

A composite integer is expressed as a product of two or more prime factors, including repetitions.

Explanation

The Fundamental Theorem of Arithmetic is one of the central results in elementary number theory. It states that every integer greater than 1 is either prime or can be expressed as a product of primes, and that this representation is unique apart from the order in which the prime factors are written. For example, 60 can be expressed as 2 × 2 × 3 × 5. No different collection of prime factors can produce 60. This theorem explains why prime numbers are considered the basic building blocks of positive integers. It also supports methods for finding GCD, LCM, divisors and simplifying fractions.

Variables

SymbolMeaning

n

An integer greater than 1.

p_i

A distinct prime factor of n.

a_i

The positive integer exponent representing the multiplicity of p_i.

r

The number of distinct prime factors.

k

The total number of prime factors when repetitions are counted.

Example or application

A worked example has not yet been added.

Definition

The Fundamental Theorem of Arithmetic states that every integer greater than 1 has a prime factorization that is unique up to the order of its prime factors.

Purpose

The theorem establishes the uniqueness and reliability of prime factorization and explains how all integers greater than 1 are built from prime numbers.

Importance

It is a foundational theorem in number theory and supports prime factorization, divisibility, GCD, LCM, divisor counting and many advanced mathematical results.

Key Concepts

NameDescription

Prime Factorization

Expressing an integer greater than 1 as a product of prime numbers.

Existence

Every integer greater than 1 can be expressed as a product of primes, or is itself prime.

Uniqueness

The prime factors and their multiplicities are uniquely determined, apart from their order.

Prime Building Blocks

Prime numbers are the basic multiplicative components of positive integers greater than 1.

Multiplicity

The number of times a particular prime appears in a prime factorization.

Characteristics

  • The theorem applies to every integer greater than 1.

  • Every composite integer can be expressed as a product of primes.

  • A prime integer is already its own prime factorization.

  • The prime factorization is unique apart from factor order.

  • Repeated prime factors must be included with their multiplicities.

  • The number 1 is excluded because it has no prime factors.

  • The theorem applies to positive integers rather than arbitrary real numbers.

Types

NameDescription

Existence of Prime Factorization

Every integer greater than 1 can be expressed as a product of prime numbers.

Uniqueness of Prime Factorization

The prime factorization of an integer is unique apart from the order of its factors.

Prime Integer Case

A prime number has itself as its complete prime factorization.

Composite Integer Case

A composite number has a prime factorization containing at least two prime factors when counted with repetition.

Components

NameDescription

Integer

The positive whole number greater than 1 being considered.

Prime Factors

The prime numbers whose product equals the original integer.

Multiplicity

The number of occurrences of each distinct prime factor.

Order Independence

The order of the prime factors can change without changing the factorization.

Properties

NameExpressionDescription

Existence

Every n > 1 has a prime factorization

Every integer greater than 1 is either prime or can be written as a product of primes.

Uniqueness

Prime factorization is unique up to order

No different collection of prime factors can represent the same integer.

Prime Case

n = p when n is prime

A prime number has only itself as its prime factor.

Multiplicities

n = p_1^(a_1) × ... × p_r^(a_r)

The exponents record how many times each prime factor appears.

Exclusion of One

1 has no prime factorization

The number 1 is excluded from the theorem because it is not a product of prime factors.

Examples

ProblemSolutionExplanation

Express 60 as a product of prime factors.

60 = 2 × 2 × 3 × 5 = 2^2 × 3 × 5.

The prime factors are 2, 3 and 5, with 2 appearing twice. Their product is 60.

Compare two factorizations of 90.

90 = 2 × 3 × 3 × 5 = 3 × 5 × 2 × 3.

The order changes, but the prime factors and their multiplicities remain identical.

Determine whether 77 has a unique prime factorization.

77 = 7 × 11.

Both factors are prime, and this prime factorization is unique apart from their order.

Explain the prime factorization of 144.

144 = 2^4 × 3^2.

The integer is built from four factors of 2 and two factors of 3, giving a unique prime factorization.

Applications

  • Establishing the foundation of prime factorization.

  • Calculating GCD and LCM using prime factors.

  • Finding the number of positive divisors.

  • Simplifying fractions.

  • Studying divisibility and integer structure.

  • Supporting advanced results in number theory and cryptography.

Prerequisites

  • Understanding of prime and composite numbers.

  • Knowledge of prime factorization.

  • Basic multiplication and division.

  • Understanding of exponents and powers.

Learning Objectives

  • State the Fundamental Theorem of Arithmetic.

  • Explain the existence of prime factorization.

  • Explain why prime factorization is unique apart from order.

  • Express integers using prime factorization.

  • Identify prime factors and their multiplicities.

  • Understand why the number 1 is excluded from the theorem.

  • Apply the theorem to basic number theory problems.

Common Mistakes

  • Assuming that uniqueness means the factors must always appear in the same order.

  • Forgetting repeated prime factors.

  • Including 1 as a prime factor.

  • Thinking that prime factorization is possible only for composite numbers.

  • Assuming that a composite number can have two different prime factorizations.

  • Applying the theorem to zero or negative integers without considering its stated domain.

Practice Questions

  • State the Fundamental Theorem of Arithmetic.

  • Find the prime factorization of 210.

  • Explain why the prime factorization of 72 is unique.

  • Compare 2 × 2 × 3 × 5 with 5 × 3 × 2 × 2.

  • Explain why 1 is excluded from the theorem.

  • Write 360 as a product of distinct prime factors using exponents.

Key Takeaway

Every integer greater than 1 has a unique prime factorization apart from the order of its factors. This theorem explains why prime numbers form the basic building blocks of positive integers.

Related Topics

  • SCI-MAT-002-043

  • SCI-MAT-002-044

  • SCI-MAT-002-046

  • SCI-MAT-002-047

  • SCI-MAT-002-048

Sources and verification

Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.

  • Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.

Suggest a correction or source · More in Arithmetic & Number Theory