[seqfan] Dual Sierpinski problem

[Tomasz Ordowski]

Dear number lovers!

By the dual Sierpinski conjecture, if p is an odd prime,
then for every m > 0 with 2^m < p there exists n > 0
such that (p - 2^m)*2^n + 1 is prime.

Possible counterexamples are primes p of the form
p = k + 2^m for k = 21181, 22699, 24737, 55459, ...
For k = 67607, I found no such prime p.
Maybe someone else will find it.

Best regards,

Tom Ordo
____________
https://oeis.org/A076336
https://en.wikipedia.org/wiki/Sierpi%C5%84ski_number