Debian Codegraph @

texmf-dist/doc/latex/beamer/beamerthemeexamplebase.tex

raw
1 % Copyright 2003--2007 by Till Tantau
2 % Copyright 2010 by Vedran Mileti\'c
3 % Copyright 2015 by Vedran Mileti\'c, Joseph Wright
4 %
5 % This file may be distributed and/or modified
6 %
7 % 1. under the LaTeX Project Public License and/or
8 % 2. under the GNU Free Documentation License.
9 %
10 % See the file LICENSE.md for more details.
11
12 \beamertemplatesolidbackgroundcolor{black!5}
13 \beamertemplatetransparentcovered
14
15 \title{There Is No Largest Prime Number}
16 \subtitle{With an introduction to a new proof technique}
17
18 \author[Euklid]{Euklid of Alexandria}
19 \institute[Univ. Alexandria]{Department of Mathematics\\ University of Alexandria}
20 \date[ISPN '80]{27th International Symposium on Prime Numbers, --280}
21
22 \begin{document}
23
24 \begin{frame}
25 \titlepage
26 \tableofcontents
27 \end{frame}
28
29 \section{Results}
30 \subsection{Proof of the Main Theorem}
31
32 \begin{frame}<1>
33 \frametitle{There Is No Largest Prime Number}
34 \framesubtitle{The proof uses \textit{reductio ad absurdum}.}
35
36 \begin{theorem}
37 There is no largest prime number.
38 \end{theorem}
39 \begin{proof}
40 \begin{enumerate}
41 % The strange way of typesetting math is to minimize font usage
42 % in order to keep the file sizes of the examples small.
43 \item<1-| alert@1> Suppose $p$ were the largest prime number.
44 \item<2-> Let $q$ be the product of the first $p$ numbers.
45 \item<3-> Then $q$\;+\,$1$ is not divisible by any of them.
46 \item<1-> Thus $q$\;+\,$1$ is also prime and greater than $p$.\qedhere
47 \end{enumerate}
48 \end{proof}
49 \end{frame}
50
51 \end{document}