The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
Newsgroups: sci.math, sci.logic
From: Norman Megill <n...@see.signature>
Date: Sun, 08 May 2005 08:57:31 -0400
Local: Sun, May 8 2005 8:57 am
Subject: A proof that there are infinitely many primes
While Euclid's classic proof that there are infinitely many primes is
easy to understand intuitively, I found the following proof simpler to formalize for an automated proof verifier. (Specifically, this proof avoids the product of a hypothetical finite set of all primes, which I found cumbersome to work with.) Here is the proof: For any natural number n, the smallest divisor (greater than 1) of n!+1 As simple as it is, I was unable to find a published reference for this -- You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
| ||||||||||||||