On Wed, Jan 30, 2013 at 07:18:20AM -0500, Robert G. Wilson v wrote: > Don, > > What about the least k-almost Sophie Germain primes? > I suppose it is computationally infeasible for large k. Is there an unconditional proof that at least one k-almost Sophie Germain prime exists for all k?