Answer by Milo Brandt for Use the Well ordering principle to prove
Well, this is a proof where you should just use what you know - you recognize that the well-ordering principle tells you something about a least element, so let's investigate that! There's nothing...
View ArticleAnswer by RyRy the Fly Guy for Use the Well ordering principle to prove
Here is one such sequence...$$5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ...$$the above is an infinitely long sequence of natural numbers such that $a_n \ge a_{n+1}$ for $n \ge 1$. It is sufficient...
View ArticleUse the Well ordering principle to prove
Is there a process that is capable of generating an infinitely long sequence of natural numbers $a_1, a_2, a_3, \ldots$ such that for all $n \ge 1, a_n \ge a_{n+1}$?I know i have to use the well...
View Article
