Re: Approaching a twin primes conjecture proof

From: Christian Bau (christian.bau_at_cbau.freeserve.co.uk)
Date: 06/29/04 

Date: Tue, 29 Jun 2004 23:24:19 +0100

In article <3c65f87.0406291355.b7d46a2@posting.google.com>,
 jstevh@msn.com (James Harris) wrote:

> The twin primes conjecture is that there are an infinity of twin
> primes which are primes separated by 2. For instance, 5 and 7 are
> twin primes, as 7-5 = 2.
>
> Here's an idea that's a variant on the proof of the infinitude of
> primes, might not be new, but why not throw it out there?
>
> Multiply every prime *except* 3 up to some arbitrary j-th prime. Now
> add 1.
>
> The result is either divisible by 3 or has a residue of -1 or 1 with
> respect to 3.
>
> If the result is not divisible by 3 it is prime.

Where did you get that stupid idea from?

The first two of these numbers "work" (11 and 71), the next one is a
composite number (170171 = 379 * 449).

Try a bit harder the next time.

Relevant Pages