fundamental theorem of arithmetic

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Noun[edit]

fundamental theorem of arithmetic (uncountable)

  1. (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]