##  [Fundamental Theorem of Arithmetic](/fundamental-theorem-arithmetic-1) 

 Definition

The statement that every integer greater than one factors uniquely as a product of prime numbers, up to ordering of the factors; primes are the multiplicative atoms of the integers.

 

 

 

 

 

 





## Principle

Principle

Primes serve as irreducible building blocks and multiplication in the integers admits unique factorization, which underpins multiplicative arithmetic and classification of integer structure.

 

 

 

 

 





## Demonstration

Demonstration

Example: 84 factors as 2^2 · 3 · 7, and no different multiset of primes produces 84; this uniqueness allows one to read off multiplicative invariants such as greatest common divisors and valuations.

 

 

 

 

## Misapplication

Misapplication

Assuming the same uniqueness holds in arbitrary rings of algebraic integers without checking whether the ring is a unique factorization domain; doing arithmetic that treats non-UFD elements as prime leads to contradictions.

 

 

 

 

 





## Consequence

Consequence

Enables decomposition-based arguments across number theory: multiplicative functions, valuation theory, gcd/lcm computations, and many algorithmic methods depend on unique prime factorization in Z.

 

 

 

 

## Reversal

Reversal

In domains lacking unique factorization, elements can have distinct irreducible factorizations (non-unique factorization), showing the theorem's failure outside Z and motivating the study of UFDs and class groups.

 

 

 

 

 





## Boundary

Boundary

Applies exactly to the ring of integers Z for positive integers >1 (and extends to negatives if units ±1 are considered); excludes zero, units ±1, and does not automatically extend to general integral domains.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Relates to but is distinct from the property of being a Unique Factorization Domain (UFD): the theorem is the specific UFD statement for Z, while many rings of algebraic integers fail to satisfy it, leading to subtle arithmetic phenomena.

 

 

 

 

 





## Synthesis

Synthesis

The Fundamental Theorem of Arithmetic asserts that primes are the unique multiplicative constituents of integers >1, providing the essential combinatorial and structural basis for multiplicative number theory and computational factorization.