I'm reading a text on discrete math and came across a theorem which states:
"Every integer greater than 1 can be written uniquely as a prime or as the product of two or more primes where the prime factors are written in order of nondecreasing size."
I understand writing a composite as a prime factorization, no prob. But what is the relevance of "written in order of nondecreasing size"?
What does it mean and how is it useful?
Thanks!
Without this restriction the factorization wouldn't be unique -- most composite numbers would have several different factorizations that simply listed the same prime factors in different orders.
In order to be able to say there is a unique prime factorization, we need to declare that one of these different orders for the prime factors is the "right" one and the others don't count.
There's nothing particularly deep about requiring non-decreasing order of the factors in particular, except that it happens to be a choice of "right" order that is (a) easy to describe and (b) easy to see picks out exactly one of the many possible reorderings of every list of prime factors.
Alternatively one could also state the prime factorization theorem as
That's closer to the intuitive content of the theorem, except that multisets are slightly discriminated against by most mathematicians' preferences about how to express things. Things that can be expressed as sets or ordered sequences are usually more in favor.