You can generate an infinite number of these by solving three equations with

the Chinese Remainder Theorem. Pick two different primes > 3, call them

p and q. Solve these three equations:

x == 0 mod 6

x == 1 mod p

x == q-1 mod q

set k to be x/6

Example, let p=7, q=11. Solution is x == 120 mod 462.

x = 120+462t for t = 0, 1, 2, 3, ...

k = 20 + 77t for t = 0, 1, 2, 3, ...

Different p and q will get you different infinite series. Some numbers will

belong to more than one series.

Tom Hadley

-----Original Message-----

From: mcnamara_gio [mailto:

mcnamara_gio@...]

Sent: Thursday, January 13, 2005 7:09 AM

To:

primenumbers@yahoogroups.com
Subject: [PrimeNumbers] 6k-1 6k+1 primes

does anybody know where to find such k's for which neither 6k-1 nor

6k+1

is prime or a program that finds such k's. please e-mail me if you

have such information

Unsubscribe by an email to:

primenumbers-unsubscribe@yahoogroups.com
The Prime Pages :

http://www.primepages.org/
Yahoo! Groups Links