Transcription of The beamer class - CTAN
{{id}} {{{paragraph}}}
The beamer class User Guide for version \begin{frame}. \frametitle{There Is No Largest Prime Number}. \framesubtitle{The proof uses \textit{reductio ad absurdum}.}. \begin{theorem}. There is no largest prime number. \end{theorem}. \begin{proof}. \begin{enumerate}. \item<1-| alert@1> Suppose $p$ were the largest prime number. \item<2-> Let $q$ be the product of the first $p$ numbers. \item<3-> Then $q+1$ is not divisible by any of them. \item<1-> Thus $q+1$ is also prime and greater than $p$.\qedhere \end{enumerate}. \end{proof}. \end{frame}. Results There Is No Largest Prime Number There Is No Largest Prime Number The proof uses reductio ad absurdum. The proof uses reductio ad absurdum. Theorem Theorem There is no largest prime number. There is no largest prime number. Proof. Proof. 1 Suppose p were the largest prime number. 1 Suppose p were the largest prime number. 2 Let q be the product of the first p numbers. 2 Let q be the product of the first p numbers. 3 Then q + 1 is not divisible by any of them.
themes, on the user’s guide, on features of the class, on the internals of the implementation, on special LATEX features, and on life in general. A small selection of these people includes (in no particular order and I have surely forgotten to name lots of people who really, really deserve being in this list): Carsten (for everything),
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}