fundamental theorem of arithmetic
GPTKB entity
Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
unique factorization theorem
|
| gptkbp:appliesTo |
integers greater than 1
|
| gptkbp:category |
prime numbers
theorems in number theory |
| gptkbp:consequence |
greatest common divisor can be computed using prime factorization
least common multiple can be computed using prime factorization |
| gptkbp:field |
number theory
|
| gptkbp:firstPublished |
gptkb:Disquisitiones_Arithmeticae
|
| https://www.w3.org/2000/01/rdf-schema#label |
fundamental theorem of arithmetic
|
| gptkbp:implies |
prime factorization is unique
|
| gptkbp:provenBy |
gptkb:Carl_Friedrich_Gauss
|
| gptkbp:publicationYear |
1801
|
| gptkbp:relatedTo |
gptkb:Prime_Number
gptkb:Euclid's_lemma unique factorization domain |
| gptkbp:state |
every integer greater than 1 can be represented uniquely as a product of prime numbers, up to the order of the factors
|
| gptkbp:bfsParent |
gptkb:Euclid's_infinitude_of_primes_theorem
|
| gptkbp:bfsLayer |
7
|