Related articles:
Algebraic number theory
Integer
Integer factorization
Greatest common divisor
Prime number
Least common multiple
Euclidean algorithm
Euclid
Key terms:
prime
q
number
theorem
math
product
integer
prime factorization
proof
unique
divides
prime numbers
fundamental theorem of arithmetic
k
positive
written
j
must
cdots q
cannot
teorema
product of primes
natural numbers
unique factorization domain
least
multiple
above
positive integer
smaller than
cdots p
smallest
therefore
two different
greatest common divisor
follows
values
number theory
ring
written as a product
dp
assumption
mathematics
last theorem
algebraic
hypothesis
gcd
takes one
contradiction
euclidean
let
Search external links cited by footnotes on Wikipedia page Fundamental theorem of arithmetic:
|
|