Documentation: Bug in Euclid's proof
There is a problem with euclids proof in the tutorial at the beginning of the beamerguide --- it is wrong.\
It it true that (19!+1) is not divisible by any integer <= 19, but that is definitely not enough to prove that it is prime.\
You will find euclids proof explained here:\ http://aleph0.clarku.edu/~djoyce/java/elements/bookIX/propIX20.html\
The reason why I report this as a bug is that I read the beamer documentation some years ago and up until two days ago I thought the proof was valid ;o)
I hope you understand that this 'bugs' me ;o)
Btw, I love beamer. Thank you so much for your effort!