Use the well-ordering principle for the integers to prove Theorem 4.4.4: Every integer greater than I is divisible by a prime number. | Numerade

Can you use the well-ordering property to prove the statement: "Every positive integer can be described using no more than fifteen English words"? Assume the words come from a particular dictionary of English. [Hint: Suppose that there are positive integers that cannot be described using no more than fifteen English words. By well ordering, the smallest positive integer that cannot be described using no more than fifteen English words would then exist.] | Numerade