forked from matze/mtheme
-
Notifications
You must be signed in to change notification settings - Fork 6
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
tests: try to use default beamer theme test to see if that works
- Loading branch information
Showing
3 changed files
with
1,526 additions
and
109 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,47 @@ | ||
\input regression-test | ||
|
||
\beamertemplatesolidbackgroundcolor{black!5} | ||
\beamertemplatetransparentcovered | ||
|
||
\usepackage{times} | ||
|
||
\title{There Is No Largest Prime Number} | ||
\subtitle{With an introduction to a new proof technique} | ||
|
||
\author[Euklid]{Euklid of Alexandria} | ||
\institute[Univ. Alexandria]{Department of Mathematics\\ University of Alexandria} | ||
\date[ISPN '80]{27th International Symposium on Prime Numbers, --280} | ||
|
||
\begin{document} | ||
|
||
\START | ||
\showoutput | ||
|
||
\begin{frame} | ||
\titlepage | ||
\tableofcontents | ||
\end{frame} | ||
|
||
\section{Results} | ||
\subsection{Proof of the Main Theorem} | ||
|
||
\begin{frame}<1> | ||
\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} | ||
% The strange way of typesetting math is to minimize font usage | ||
% in order to keep the file sizes of the examples small. | ||
\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} | ||
|
||
\end{document} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,17 +1,5 @@ | ||
\input regression-test.tex\relax | ||
\documentclass[hyperref={draft}]{beamer} | ||
|
||
\documentclass{beamer} | ||
\usetheme{default} | ||
|
||
\usetheme{moloch} | ||
|
||
\begin{document} | ||
|
||
\START | ||
\showoutput | ||
\begin{frame} | ||
Some frame content | ||
\end{frame} | ||
\vfil\break | ||
\END | ||
|
||
\end{document} | ||
\input{beamerthemebase} |
Oops, something went wrong.