算術の基本定理
1. Fundamental theorem of arithmeticIn number theory, the fundamental theorem of arithmetic (or the unique-prime-factorization theorem) states that any integer greater than 1 can be written as a unique product of prime numbers. For example, Proof of existence of a prime factorization is straightforward; proof of uniqueness is more challenging. Some proofs use the fact that if a prime number p divides the product of two natural numbers a and b, then p divides either a or b, a statement known as Euclid's lemma.
Read “Fundamental theorem of arithmetic” on English Wikipedia
Read “算術の基本定理” on Japanese Wikipedia
Read “Fundamental theorem of arithmetic” on DBpedia
Read “Fundamental theorem of arithmetic” on English Wikipedia
Read “算術の基本定理” on Japanese Wikipedia
Read “Fundamental theorem of arithmetic” on DBpedia
Discussions
Log in to talk about this word.