[seqfan] Re: Searching for "Sophie Germain 5-almost primes"

[Charles Greathouse]

Surely not, since we don't even know that there are infinitely many Sophie
Germain primes!

Charles Greathouse
Analyst/Programmer
Case Western Reserve University


On Thu, Jan 31, 2013 at 8:04 AM, Georgi Guninski <guninski at guninski.com>wrote:

> 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?
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>