File: formula.txt

package info (click to toggle)
codespeak-lib 0.9.1-3
  • links: PTS
  • area: main
  • in suites: lenny
  • size: 3,212 kB
  • ctags: 5,409
  • sloc: python: 33,390; ansic: 961; xml: 582; makefile: 90
file content (8 lines) | stat: -rw-r--r-- 434 bytes parent folder | download | duplicates (2) 
1
2
3
4
5
6
7
8
 
Euklids proof about the infinitude of primes
============================================

If there were only a finite amount of primes then there would be a largest
prime :latexformula:`p`. However, the number :latexformula:`p! + 1` is not
divisible by any number :latexformula:`1, ..., p`. Therefore, a prime dividing
:latexformula:`p! + 1` has to be bigger than :latexformula:`p`. Therefore there
is an infinite number of primes.