A series converges when its partial sums have a finite limit of a sequence.
The comparison test says that if eventually and converges, then converges. Indeed, the partial sums of the nonnegative terms are increasing, and are bounded above by a fixed initial contribution plus the sum of the comparison series. The bounded monotone sequence theorem proves their convergence. Finite initial terms do not affect convergence. Applying this result to also proves absolute convergence whenever eventually with .
Choose with . Every tail of a sequence is nonempty and bounded, so its supremum exists and lies in . Removing one term cannot increase a supremum, hence . The bounded monotone sequence theorem, applied to , proves
Thus is the limit superior of .
For , eventually , and then . Only finitely many indices can satisfy . If only finitely many satisfied , some entire tail of a sequence would have . Its supremum would also be at most , contradicting .
Inductively choose so late that and . There are infinitely many choices for the latter inequality, so both requirements can be met. Then , proving . This constructs a subsequence attaining the limit superior.
For a nonempty set , a supremum is a real number such that for every , and every upper bound of satisfies . Equivalently, is an upper bound and, for every , some satisfies . By completeness of the real numbers, it exists whenever is nonempty and bounded above.
An increasing monotone sequence satisfies for every ; a bounded sequence satisfies for some finite and every . Put . Given , the defining property of the supremum supplies with . For every , monotonicity gives
This is exactly the definition of convergent sequence, so the bounded monotone sequence theorem gives .
Suppose there were only finitely many prime numbers, say . Work in the infinite group and set . The left cosets are the residue classes modulo , so each is a finite-index subgroup, with .
By part (b)(v), is empty or infinite. But part (a)(ii) identifies it as the nonempty two-element set . This contradiction proves Euclid's theorem:

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact