PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Viewing Version 1 of 'proof that there are infinitely many primes'
[ view 'proof that there are infinitely many primes' | back to history ]

Title of object: proof that there are infinitely many primes
Canonical Name: ProofThatThereAreInfinitelyManyPrimes
Type: Proof

Created on: 2002-06-04 15:02:01-04
Modified on: 2002-06-04 15:02:01-04

Creator: mathwizard
Modifier: mathwizard
Author: mathwizard

Classification: msc:11A41

Preamble:

% this is the default PlanetMath preamble. as your knowledge
% of TeX increases, you will probably want to edit this, but
% it should be fine as is for beginners.
% almost certainly you want these
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
% used for TeXing text within eps files
%\usepackage{psfrag}
% need this for including graphics (\includegraphics)
%\usepackage{graphicx}
% for neatly defining theorems and propositions
%\usepackage{amsthm}
% making logically defined graphics
%\usepackage{xypic}
% there are many more packages, add them here as you need them
% define commands here
Content:

If there was only a finite amount of primes then there would be some largest prime $p$. However $p!+1$ is not divisible by any number $n\leq p$ greater than one, so $p!+1$ cannot be factored by the primes we already know and there must be some prime greater than $p$. Thus there are infinitely many primes.