Skip to main

Mathematics (thesaurus)

Search from vocabulary

mapear
anotar
descargar

Concept information

number > elementary arithmetic > fundamental theorem of arithmetic

Término preferido

fundamental theorem of arithmetic  

Definición

  • In mathematics, the fundamental theorem of arithmetic, also called the unique factorization theorem and prime factorization theorem, states that every integer greater than 1 can be represented uniquely as a product of prime numbers, up to the order of the factors. For example,
    The theorem says two things about this example: first, that 1200 can be represented as a product of primes, and second, that no matter how this is done, there will always be exactly four 2s, one 3, two 5s, and no other primes in the product. The requirement that the factors be prime is necessary: factorizations containing composite numbers may not be unique (for example, ). This theorem is one of the main reasons why 1 is not considered a prime number: if 1 were prime, then factorization into primes would not be unique; for example, The theorem generalizes to other algebraic structures that are called unique factorization domains and include principal ideal domains, Euclidean domains, and polynomial rings over a field. However, the theorem does not hold for algebraic integers. This failure of unique factorization is one of the reasons for the difficulty of the proof of Fermat's Last Theorem. The implicit use of unique factorization in rings of algebraic integers is behind the error of many of the numerous false proofs that have been written during the 358 years between Fermat's statement and Wiles's proof.
    (Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Fundamental_theorem_of_arithmetic)

Concepto genérico

Etiquetas alternativas

  • prime factorization theorem
  • unique factorization theorem

En otras lenguas

URI

http://data.loterre.fr/ark:/67375/PSR-RJRGLFBW-4

Descargue este concepto:

RDF/XML TURTLE JSON-LD última modificación 18/10/24