fundamental theorem of arithmetic
Jump to navigation
Jump to search
English[edit]
Noun[edit]
fundamental theorem of arithmetic (uncountable)
- (number theory) the theorem that states that every integer greater than one is uniquely expressible as a product of prime numbers, which is called its prime factorization
Translations[edit]
theorem
|